TSTP Solution File: GEO262+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GEO262+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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:19 EDT 2024
% Result : Theorem 0.44s 1.13s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 9 unt; 0 def)
% Number of atoms : 125 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 120 ( 33 ~; 24 |; 52 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 92 ( 8 sgn 58 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( unequally_directed_opposite_lines(X0,X1)
<=> unequally_directed_lines(X0,reverse_line(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a1_defns) ).
fof(f7,axiom,
! [X3,X4] :
( convergent_lines(X3,X4)
<=> ( unequally_directed_opposite_lines(X3,X4)
& unequally_directed_lines(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a7_defns) ).
fof(f19,axiom,
! [X3,X4] :
( ( unequally_directed_lines(X3,reverse_line(X4))
& unequally_directed_lines(X3,X4) )
=> ( left_convergent_lines(X3,reverse_line(X4))
| left_convergent_lines(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax9_basics) ).
fof(f21,axiom,
! [X3,X4] :
~ ( left_convergent_lines(X3,reverse_line(X4))
| left_convergent_lines(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax11_basics) ).
fof(f37,conjecture,
! [X3,X4,X7,X2,X5,X6] :
( ( incident_point_and_line(X5,X7)
& convergent_lines(X4,X7)
& convergent_lines(X3,X7)
& incident_point_and_line(X5,X4)
& convergent_lines(X3,X4)
& between_on_line(X3,X2,X5,X6) )
=> between_on_line(X4,intersection_point(X4,parallel_through_point(X7,X2)),X5,intersection_point(X4,parallel_through_point(X7,X6))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f38,negated_conjecture,
~ ! [X3,X4,X7,X2,X5,X6] :
( ( incident_point_and_line(X5,X7)
& convergent_lines(X4,X7)
& convergent_lines(X3,X7)
& incident_point_and_line(X5,X4)
& convergent_lines(X3,X4)
& between_on_line(X3,X2,X5,X6) )
=> between_on_line(X4,intersection_point(X4,parallel_through_point(X7,X2)),X5,intersection_point(X4,parallel_through_point(X7,X6))) ),
inference(negated_conjecture,[],[f37]) ).
fof(f40,plain,
! [X0,X1] :
( convergent_lines(X0,X1)
<=> ( unequally_directed_opposite_lines(X0,X1)
& unequally_directed_lines(X0,X1) ) ),
inference(rectify,[],[f7]) ).
fof(f52,plain,
! [X0,X1] :
( ( unequally_directed_lines(X0,reverse_line(X1))
& unequally_directed_lines(X0,X1) )
=> ( left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1) ) ),
inference(rectify,[],[f19]) ).
fof(f54,plain,
! [X0,X1] :
~ ( left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1) ),
inference(rectify,[],[f21]) ).
fof(f70,plain,
~ ! [X0,X1,X2,X3,X4,X5] :
( ( incident_point_and_line(X4,X2)
& convergent_lines(X1,X2)
& convergent_lines(X0,X2)
& incident_point_and_line(X4,X1)
& convergent_lines(X0,X1)
& between_on_line(X0,X3,X4,X5) )
=> between_on_line(X1,intersection_point(X1,parallel_through_point(X2,X3)),X4,intersection_point(X1,parallel_through_point(X2,X5))) ),
inference(rectify,[],[f38]) ).
fof(f71,plain,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ( unequally_directed_opposite_lines(X0,X1)
& unequally_directed_lines(X0,X1) ) ),
inference(unused_predicate_definition_removal,[],[f40]) ).
fof(f74,plain,
! [X0,X1] :
( unequally_directed_opposite_lines(X0,X1)
=> unequally_directed_lines(X0,reverse_line(X1)) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f75,plain,
! [X0,X1] :
( unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_opposite_lines(X0,X1) ),
inference(ennf_transformation,[],[f74]) ).
fof(f78,plain,
! [X0,X1] :
( ( unequally_directed_opposite_lines(X0,X1)
& unequally_directed_lines(X0,X1) )
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f71]) ).
fof(f87,plain,
! [X0,X1] :
( left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1) ),
inference(ennf_transformation,[],[f52]) ).
fof(f88,plain,
! [X0,X1] :
( left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1) ),
inference(flattening,[],[f87]) ).
fof(f90,plain,
! [X0,X1] :
( ~ left_convergent_lines(X0,reverse_line(X1))
& ~ left_convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f54]) ).
fof(f112,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ between_on_line(X1,intersection_point(X1,parallel_through_point(X2,X3)),X4,intersection_point(X1,parallel_through_point(X2,X5)))
& incident_point_and_line(X4,X2)
& convergent_lines(X1,X2)
& convergent_lines(X0,X2)
& incident_point_and_line(X4,X1)
& convergent_lines(X0,X1)
& between_on_line(X0,X3,X4,X5) ),
inference(ennf_transformation,[],[f70]) ).
fof(f113,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ between_on_line(X1,intersection_point(X1,parallel_through_point(X2,X3)),X4,intersection_point(X1,parallel_through_point(X2,X5)))
& incident_point_and_line(X4,X2)
& convergent_lines(X1,X2)
& convergent_lines(X0,X2)
& incident_point_and_line(X4,X1)
& convergent_lines(X0,X1)
& between_on_line(X0,X3,X4,X5) ),
inference(flattening,[],[f112]) ).
fof(f119,plain,
( ? [X0,X1,X2,X3,X4,X5] :
( ~ between_on_line(X1,intersection_point(X1,parallel_through_point(X2,X3)),X4,intersection_point(X1,parallel_through_point(X2,X5)))
& incident_point_and_line(X4,X2)
& convergent_lines(X1,X2)
& convergent_lines(X0,X2)
& incident_point_and_line(X4,X1)
& convergent_lines(X0,X1)
& between_on_line(X0,X3,X4,X5) )
=> ( ~ between_on_line(sK1,intersection_point(sK1,parallel_through_point(sK2,sK3)),sK4,intersection_point(sK1,parallel_through_point(sK2,sK5)))
& incident_point_and_line(sK4,sK2)
& convergent_lines(sK1,sK2)
& convergent_lines(sK0,sK2)
& incident_point_and_line(sK4,sK1)
& convergent_lines(sK0,sK1)
& between_on_line(sK0,sK3,sK4,sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f120,plain,
( ~ between_on_line(sK1,intersection_point(sK1,parallel_through_point(sK2,sK3)),sK4,intersection_point(sK1,parallel_through_point(sK2,sK5)))
& incident_point_and_line(sK4,sK2)
& convergent_lines(sK1,sK2)
& convergent_lines(sK0,sK2)
& incident_point_and_line(sK4,sK1)
& convergent_lines(sK0,sK1)
& between_on_line(sK0,sK3,sK4,sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f113,f119]) ).
fof(f121,plain,
! [X0,X1] :
( unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_opposite_lines(X0,X1) ),
inference(cnf_transformation,[],[f75]) ).
fof(f127,plain,
! [X0,X1] :
( unequally_directed_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f78]) ).
fof(f128,plain,
! [X0,X1] :
( unequally_directed_opposite_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f78]) ).
fof(f151,plain,
! [X0,X1] :
( left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
fof(f154,plain,
! [X0,X1] : ~ left_convergent_lines(X0,X1),
inference(cnf_transformation,[],[f90]) ).
fof(f155,plain,
! [X0,X1] : ~ left_convergent_lines(X0,reverse_line(X1)),
inference(cnf_transformation,[],[f90]) ).
fof(f177,plain,
convergent_lines(sK1,sK2),
inference(cnf_transformation,[],[f120]) ).
cnf(c_49,plain,
( ~ unequally_directed_opposite_lines(X0,X1)
| unequally_directed_lines(X0,reverse_line(X1)) ),
inference(cnf_transformation,[],[f121]) ).
cnf(c_55,plain,
( ~ convergent_lines(X0,X1)
| unequally_directed_opposite_lines(X0,X1) ),
inference(cnf_transformation,[],[f128]) ).
cnf(c_56,plain,
( ~ convergent_lines(X0,X1)
| unequally_directed_lines(X0,X1) ),
inference(cnf_transformation,[],[f127]) ).
cnf(c_79,plain,
( ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f151]) ).
cnf(c_82,plain,
~ left_convergent_lines(X0,reverse_line(X1)),
inference(cnf_transformation,[],[f155]) ).
cnf(c_83,plain,
~ left_convergent_lines(X0,X1),
inference(cnf_transformation,[],[f154]) ).
cnf(c_103,negated_conjecture,
convergent_lines(sK1,sK2),
inference(cnf_transformation,[],[f177]) ).
cnf(c_134,plain,
~ convergent_lines(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_56,c_83,c_82,c_56,c_55,c_49,c_79]) ).
cnf(c_137,plain,
~ convergent_lines(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_55,c_134]) ).
cnf(c_300,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_103,c_137]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GEO262+3 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12 % Command : run_iprover %s %d THM
% 0.12/0.32 % Computer : n013.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Fri May 3 01:15:19 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.44/1.13 % SZS status Started for theBenchmark.p
% 0.44/1.13 % SZS status Theorem for theBenchmark.p
% 0.44/1.13
% 0.44/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.44/1.13
% 0.44/1.13 ------ iProver source info
% 0.44/1.13
% 0.44/1.13 git: date: 2024-05-02 19:28:25 +0000
% 0.44/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.44/1.13 git: non_committed_changes: false
% 0.44/1.13
% 0.44/1.13 ------ Parsing...
% 0.44/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.44/1.13
% 0.44/1.13 ------ Preprocessing...
% 0.44/1.13
% 0.44/1.13 % SZS status Theorem for theBenchmark.p
% 0.44/1.13
% 0.44/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.13
% 0.44/1.13
%------------------------------------------------------------------------------