TSTP Solution File: GEO185+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO185+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 30 23:09:59 EDT 2023
% Result : Theorem 1.66s 1.17s
% Output : CNFRefutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 5 unt; 0 def)
% Number of atoms : 85 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 100 ( 40 ~; 28 |; 26 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn; 27 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( ( apart_point_and_line(X2,X1)
| apart_point_and_line(X2,X0) )
=> distinct_points(X2,intersection_point(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con2) ).
fof(f13,conjecture,
! [X0,X1,X3,X4] :
( ( ~ distinct_points(X0,intersection_point(X3,X4))
& convergent_lines(X3,X4)
& distinct_points(X0,X1) )
=> ( ~ apart_point_and_line(X0,X4)
& ~ apart_point_and_line(X0,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f14,negated_conjecture,
~ ! [X0,X1,X3,X4] :
( ( ~ distinct_points(X0,intersection_point(X3,X4))
& convergent_lines(X3,X4)
& distinct_points(X0,X1) )
=> ( ~ apart_point_and_line(X0,X4)
& ~ apart_point_and_line(X0,X3) ) ),
inference(negated_conjecture,[],[f13]) ).
fof(f16,plain,
~ ! [X0,X1,X2,X3] :
( ( ~ distinct_points(X0,intersection_point(X2,X3))
& convergent_lines(X2,X3)
& distinct_points(X0,X1) )
=> ( ~ apart_point_and_line(X0,X3)
& ~ apart_point_and_line(X0,X2) ) ),
inference(rectify,[],[f14]) ).
fof(f25,plain,
! [X0,X1,X2] :
( distinct_points(X2,intersection_point(X0,X1))
| ( ~ apart_point_and_line(X2,X1)
& ~ apart_point_and_line(X2,X0) )
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f26,plain,
! [X0,X1,X2] :
( distinct_points(X2,intersection_point(X0,X1))
| ( ~ apart_point_and_line(X2,X1)
& ~ apart_point_and_line(X2,X0) )
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f25]) ).
fof(f34,plain,
? [X0,X1,X2,X3] :
( ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) )
& ~ distinct_points(X0,intersection_point(X2,X3))
& convergent_lines(X2,X3)
& distinct_points(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f35,plain,
? [X0,X1,X2,X3] :
( ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) )
& ~ distinct_points(X0,intersection_point(X2,X3))
& convergent_lines(X2,X3)
& distinct_points(X0,X1) ),
inference(flattening,[],[f34]) ).
fof(f36,plain,
( ? [X0,X1,X2,X3] :
( ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) )
& ~ distinct_points(X0,intersection_point(X2,X3))
& convergent_lines(X2,X3)
& distinct_points(X0,X1) )
=> ( ( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) )
& ~ distinct_points(sK0,intersection_point(sK2,sK3))
& convergent_lines(sK2,sK3)
& distinct_points(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f37,plain,
( ( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) )
& ~ distinct_points(sK0,intersection_point(sK2,sK3))
& convergent_lines(sK2,sK3)
& distinct_points(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f35,f36]) ).
fof(f46,plain,
! [X2,X0,X1] :
( distinct_points(X2,intersection_point(X0,X1))
| ~ apart_point_and_line(X2,X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f47,plain,
! [X2,X0,X1] :
( distinct_points(X2,intersection_point(X0,X1))
| ~ apart_point_and_line(X2,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f53,plain,
convergent_lines(sK2,sK3),
inference(cnf_transformation,[],[f37]) ).
fof(f54,plain,
~ distinct_points(sK0,intersection_point(sK2,sK3)),
inference(cnf_transformation,[],[f37]) ).
fof(f55,plain,
( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) ),
inference(cnf_transformation,[],[f37]) ).
cnf(c_57,plain,
( ~ convergent_lines(X0,X1)
| ~ apart_point_and_line(X2,X1)
| distinct_points(X2,intersection_point(X0,X1)) ),
inference(cnf_transformation,[],[f47]) ).
cnf(c_58,plain,
( ~ convergent_lines(X0,X1)
| ~ apart_point_and_line(X2,X0)
| distinct_points(X2,intersection_point(X0,X1)) ),
inference(cnf_transformation,[],[f46]) ).
cnf(c_63,negated_conjecture,
( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) ),
inference(cnf_transformation,[],[f55]) ).
cnf(c_64,negated_conjecture,
~ distinct_points(sK0,intersection_point(sK2,sK3)),
inference(cnf_transformation,[],[f54]) ).
cnf(c_65,negated_conjecture,
convergent_lines(sK2,sK3),
inference(cnf_transformation,[],[f53]) ).
cnf(c_167,plain,
( ~ apart_point_and_line(X0,sK3)
| ~ convergent_lines(sK2,sK3)
| distinct_points(X0,intersection_point(sK2,sK3)) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_168,plain,
( ~ convergent_lines(sK2,sK3)
| ~ apart_point_and_line(sK0,sK3)
| distinct_points(sK0,intersection_point(sK2,sK3)) ),
inference(instantiation,[status(thm)],[c_167]) ).
cnf(c_169,plain,
( ~ apart_point_and_line(X0,sK2)
| ~ convergent_lines(sK2,sK3)
| distinct_points(X0,intersection_point(sK2,sK3)) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_170,plain,
( ~ convergent_lines(sK2,sK3)
| ~ apart_point_and_line(sK0,sK2)
| distinct_points(sK0,intersection_point(sK2,sK3)) ),
inference(instantiation,[status(thm)],[c_169]) ).
cnf(c_171,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_170,c_168,c_63,c_64,c_65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GEO185+2 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 23:51:14 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.66/1.17 % SZS status Started for theBenchmark.p
% 1.66/1.17 % SZS status Theorem for theBenchmark.p
% 1.66/1.17
% 1.66/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.66/1.17
% 1.66/1.17 ------ iProver source info
% 1.66/1.17
% 1.66/1.17 git: date: 2023-05-31 18:12:56 +0000
% 1.66/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.66/1.17 git: non_committed_changes: false
% 1.66/1.17 git: last_make_outside_of_git: false
% 1.66/1.17
% 1.66/1.17 ------ Parsing...
% 1.66/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.66/1.17
% 1.66/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.66/1.17
% 1.66/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.66/1.17 ------ Proving...
% 1.66/1.17 ------ Problem Properties
% 1.66/1.17
% 1.66/1.17
% 1.66/1.17 clauses 18
% 1.66/1.17 conjectures 4
% 1.66/1.17 EPR 13
% 1.66/1.17 Horn 11
% 1.66/1.17 unary 6
% 1.66/1.17 binary 2
% 1.66/1.17 lits 43
% 1.66/1.17 lits eq 0
% 1.66/1.17 fd_pure 0
% 1.66/1.17 fd_pseudo 0
% 1.66/1.17 fd_cond 0
% 1.66/1.17 fd_pseudo_cond 0
% 1.66/1.17 AC symbols 0
% 1.66/1.17
% 1.66/1.17 ------ Schedule dynamic 5 is on
% 1.66/1.17
% 1.66/1.17 ------ no equalities: superposition off
% 1.66/1.17
% 1.66/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.66/1.17
% 1.66/1.17
% 1.66/1.17 ------
% 1.66/1.17 Current options:
% 1.66/1.17 ------
% 1.66/1.17
% 1.66/1.17
% 1.66/1.17
% 1.66/1.17
% 1.66/1.17 ------ Proving...
% 1.66/1.17
% 1.66/1.17
% 1.66/1.17 % SZS status Theorem for theBenchmark.p
% 1.66/1.17
% 1.66/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.66/1.17
% 1.66/1.17
%------------------------------------------------------------------------------