TSTP Solution File: GEO226+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GEO226+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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 : Fri May 3 02:17:07 EDT 2024
% Result : Theorem 2.29s 1.19s
% Output : CNFRefutation 2.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 3 unt; 0 def)
% Number of atoms : 95 ( 0 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 103 ( 40 ~; 23 |; 29 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn 32 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ci3) ).
fof(f10,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ci4) ).
fof(f34,axiom,
! [X0,X1] :
( incident_point_and_line(X0,X1)
<=> ~ apart_point_and_line(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a4) ).
fof(f36,conjecture,
! [X5,X6] :
( ( convergent_lines(X5,X6)
& line(X6)
& line(X5) )
=> ? [X0] :
( point(X0)
=> ( incident_point_and_line(X0,X6)
& incident_point_and_line(X0,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f37,negated_conjecture,
~ ! [X5,X6] :
( ( convergent_lines(X5,X6)
& line(X6)
& line(X5) )
=> ? [X0] :
( point(X0)
=> ( incident_point_and_line(X0,X6)
& incident_point_and_line(X0,X5) ) ) ),
inference(negated_conjecture,[],[f36]) ).
fof(f51,plain,
~ ! [X0,X1] :
( ( convergent_lines(X0,X1)
& line(X1)
& line(X0) )
=> ? [X2] :
( point(X2)
=> ( incident_point_and_line(X2,X1)
& incident_point_and_line(X2,X0) ) ) ),
inference(rectify,[],[f37]) ).
fof(f52,plain,
! [X0,X1] :
( ~ apart_point_and_line(X0,X1)
=> incident_point_and_line(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f34]) ).
fof(f61,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f62,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f91,plain,
! [X0,X1] :
( incident_point_and_line(X0,X1)
| apart_point_and_line(X0,X1) ),
inference(ennf_transformation,[],[f52]) ).
fof(f92,plain,
? [X0,X1] :
( ! [X2] :
( ( ~ incident_point_and_line(X2,X1)
| ~ incident_point_and_line(X2,X0) )
& point(X2) )
& convergent_lines(X0,X1)
& line(X1)
& line(X0) ),
inference(ennf_transformation,[],[f51]) ).
fof(f93,plain,
? [X0,X1] :
( ! [X2] :
( ( ~ incident_point_and_line(X2,X1)
| ~ incident_point_and_line(X2,X0) )
& point(X2) )
& convergent_lines(X0,X1)
& line(X1)
& line(X0) ),
inference(flattening,[],[f92]) ).
fof(f94,plain,
( ? [X0,X1] :
( ! [X2] :
( ( ~ incident_point_and_line(X2,X1)
| ~ incident_point_and_line(X2,X0) )
& point(X2) )
& convergent_lines(X0,X1)
& line(X1)
& line(X0) )
=> ( ! [X2] :
( ( ~ incident_point_and_line(X2,sK1)
| ~ incident_point_and_line(X2,sK0) )
& point(X2) )
& convergent_lines(sK0,sK1)
& line(sK1)
& line(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f95,plain,
( ! [X2] :
( ( ~ incident_point_and_line(X2,sK1)
| ~ incident_point_and_line(X2,sK0) )
& point(X2) )
& convergent_lines(sK0,sK1)
& line(sK1)
& line(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f93,f94]) ).
fof(f104,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f105,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f62]) ).
fof(f132,plain,
! [X0,X1] :
( incident_point_and_line(X0,X1)
| apart_point_and_line(X0,X1) ),
inference(cnf_transformation,[],[f91]) ).
fof(f135,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f95]) ).
fof(f137,plain,
! [X2] :
( ~ incident_point_and_line(X2,sK1)
| ~ incident_point_and_line(X2,sK0) ),
inference(cnf_transformation,[],[f95]) ).
cnf(c_57,plain,
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f104]) ).
cnf(c_58,plain,
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f105]) ).
cnf(c_85,plain,
( apart_point_and_line(X0,X1)
| incident_point_and_line(X0,X1) ),
inference(cnf_transformation,[],[f132]) ).
cnf(c_86,negated_conjecture,
( ~ incident_point_and_line(X0,sK1)
| ~ incident_point_and_line(X0,sK0) ),
inference(cnf_transformation,[],[f137]) ).
cnf(c_88,negated_conjecture,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f135]) ).
cnf(c_456,negated_conjecture,
( ~ incident_point_and_line(X0,sK1)
| ~ incident_point_and_line(X0,sK0) ),
inference(demodulation,[status(thm)],[c_86]) ).
cnf(c_457,plain,
( ~ apart_point_and_line(intersection_point(sK0,sK1),sK0)
| ~ convergent_lines(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_458,plain,
( ~ apart_point_and_line(intersection_point(sK0,sK1),sK1)
| ~ convergent_lines(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_512,plain,
( apart_point_and_line(X0,sK1)
| incident_point_and_line(X0,sK1) ),
inference(instantiation,[status(thm)],[c_85]) ).
cnf(c_580,plain,
( apart_point_and_line(intersection_point(sK0,sK1),sK1)
| incident_point_and_line(intersection_point(sK0,sK1),sK1) ),
inference(instantiation,[status(thm)],[c_512]) ).
cnf(c_729,plain,
( apart_point_and_line(intersection_point(sK0,sK1),sK0)
| incident_point_and_line(intersection_point(sK0,sK1),sK0) ),
inference(instantiation,[status(thm)],[c_85]) ).
cnf(c_1410,plain,
( ~ incident_point_and_line(intersection_point(sK0,sK1),sK1)
| ~ incident_point_and_line(intersection_point(sK0,sK1),sK0) ),
inference(instantiation,[status(thm)],[c_456]) ).
cnf(c_1411,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1410,c_729,c_580,c_458,c_457,c_88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO226+3 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.15/0.34 % Computer : n015.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Fri May 3 01:40:21 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.29/1.19 % SZS status Started for theBenchmark.p
% 2.29/1.19 % SZS status Theorem for theBenchmark.p
% 2.29/1.19
% 2.29/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.29/1.19
% 2.29/1.19 ------ iProver source info
% 2.29/1.19
% 2.29/1.19 git: date: 2024-05-02 19:28:25 +0000
% 2.29/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.29/1.19 git: non_committed_changes: false
% 2.29/1.19
% 2.29/1.19 ------ Parsing...
% 2.29/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.29/1.19
% 2.29/1.19 ------ Preprocessing... sf_s rm: 6 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 2.29/1.19
% 2.29/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.29/1.19 ------ Proving...
% 2.29/1.19 ------ Problem Properties
% 2.29/1.19
% 2.29/1.19
% 2.29/1.19 clauses 31
% 2.29/1.19 conjectures 2
% 2.29/1.19 EPR 23
% 2.29/1.19 Horn 14
% 2.29/1.19 unary 8
% 2.29/1.19 binary 8
% 2.29/1.19 lits 80
% 2.29/1.19 lits eq 0
% 2.29/1.19 fd_pure 0
% 2.29/1.19 fd_pseudo 0
% 2.29/1.19 fd_cond 0
% 2.29/1.19 fd_pseudo_cond 0
% 2.29/1.19 AC symbols 0
% 2.29/1.19
% 2.29/1.19 ------ Schedule dynamic 5 is on
% 2.29/1.19
% 2.29/1.19 ------ no equalities: superposition off
% 2.29/1.19
% 2.29/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.29/1.19
% 2.29/1.19
% 2.29/1.19 ------
% 2.29/1.19 Current options:
% 2.29/1.19 ------
% 2.29/1.19
% 2.29/1.19
% 2.29/1.19
% 2.29/1.19
% 2.29/1.19 ------ Proving...
% 2.29/1.19
% 2.29/1.19
% 2.29/1.19 % SZS status Theorem for theBenchmark.p
% 2.29/1.19
% 2.29/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.29/1.19
% 2.29/1.19
%------------------------------------------------------------------------------