TSTP Solution File: GEO262+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO262+1 : TPTP v8.1.2. Bugfixed v6.4.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 : Wed Aug 30 23:10:45 EDT 2023
% Result : Theorem 0.48s 1.18s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 9 unt; 0 def)
% Number of atoms : 115 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 128 ( 46 ~; 21 |; 52 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 82 ( 8 sgn; 50 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
<=> ( unequally_directed_lines(X1,reverse_line(X2))
& unequally_directed_lines(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con_def) ).
fof(f14,axiom,
! [X1,X2] :
( ( unequally_directed_lines(X1,reverse_line(X2))
& unequally_directed_lines(X1,X2) )
=> ( left_convergent_lines(X1,reverse_line(X2))
| left_convergent_lines(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',oag9) ).
fof(f16,axiom,
! [X1,X2] :
~ ( left_convergent_lines(X1,reverse_line(X2))
| left_convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',oag11) ).
fof(f32,conjecture,
! [X1,X2,X5,X0,X3,X4] :
( ( ~ apart_point_and_line(X3,X5)
& convergent_lines(X2,X5)
& convergent_lines(X1,X5)
& ~ apart_point_and_line(X3,X2)
& convergent_lines(X1,X2)
& between_on_line(X1,X0,X3,X4) )
=> between_on_line(X2,intersection_point(X2,parallel_through_point(X5,X0)),X3,intersection_point(X2,parallel_through_point(X5,X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f33,negated_conjecture,
~ ! [X1,X2,X5,X0,X3,X4] :
( ( ~ apart_point_and_line(X3,X5)
& convergent_lines(X2,X5)
& convergent_lines(X1,X5)
& ~ apart_point_and_line(X3,X2)
& convergent_lines(X1,X2)
& between_on_line(X1,X0,X3,X4) )
=> between_on_line(X2,intersection_point(X2,parallel_through_point(X5,X0)),X3,intersection_point(X2,parallel_through_point(X5,X4))) ),
inference(negated_conjecture,[],[f32]) ).
fof(f34,plain,
! [X0,X1] :
( convergent_lines(X0,X1)
<=> ( unequally_directed_lines(X0,reverse_line(X1))
& unequally_directed_lines(X0,X1) ) ),
inference(rectify,[],[f2]) ).
fof(f45,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,[],[f14]) ).
fof(f46,plain,
! [X0,X1] :
~ ( left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1) ),
inference(rectify,[],[f16]) ).
fof(f59,plain,
~ ! [X0,X1,X2,X3,X4,X5] :
( ( ~ apart_point_and_line(X4,X2)
& convergent_lines(X1,X2)
& convergent_lines(X0,X2)
& ~ apart_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,[],[f33]) ).
fof(f60,plain,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ( unequally_directed_lines(X0,reverse_line(X1))
& unequally_directed_lines(X0,X1) ) ),
inference(unused_predicate_definition_removal,[],[f34]) ).
fof(f63,plain,
! [X0,X1] :
( ( unequally_directed_lines(X0,reverse_line(X1))
& unequally_directed_lines(X0,X1) )
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f60]) ).
fof(f76,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,[],[f45]) ).
fof(f77,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,[],[f76]) ).
fof(f79,plain,
! [X0,X1] :
( ~ left_convergent_lines(X0,reverse_line(X1))
& ~ left_convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f46]) ).
fof(f100,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)))
& ~ apart_point_and_line(X4,X2)
& convergent_lines(X1,X2)
& convergent_lines(X0,X2)
& ~ apart_point_and_line(X4,X1)
& convergent_lines(X0,X1)
& between_on_line(X0,X3,X4,X5) ),
inference(ennf_transformation,[],[f59]) ).
fof(f101,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)))
& ~ apart_point_and_line(X4,X2)
& convergent_lines(X1,X2)
& convergent_lines(X0,X2)
& ~ apart_point_and_line(X4,X1)
& convergent_lines(X0,X1)
& between_on_line(X0,X3,X4,X5) ),
inference(flattening,[],[f100]) ).
fof(f106,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)))
& ~ apart_point_and_line(X4,X2)
& convergent_lines(X1,X2)
& convergent_lines(X0,X2)
& ~ apart_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)))
& ~ apart_point_and_line(sK4,sK2)
& convergent_lines(sK1,sK2)
& convergent_lines(sK0,sK2)
& ~ apart_point_and_line(sK4,sK1)
& convergent_lines(sK0,sK1)
& between_on_line(sK0,sK3,sK4,sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f107,plain,
( ~ between_on_line(sK1,intersection_point(sK1,parallel_through_point(sK2,sK3)),sK4,intersection_point(sK1,parallel_through_point(sK2,sK5)))
& ~ apart_point_and_line(sK4,sK2)
& convergent_lines(sK1,sK2)
& convergent_lines(sK0,sK2)
& ~ apart_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])],[f101,f106]) ).
fof(f110,plain,
! [X0,X1] :
( unequally_directed_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f63]) ).
fof(f111,plain,
! [X0,X1] :
( unequally_directed_lines(X0,reverse_line(X1))
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f63]) ).
fof(f136,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,[],[f77]) ).
fof(f139,plain,
! [X0,X1] : ~ left_convergent_lines(X0,X1),
inference(cnf_transformation,[],[f79]) ).
fof(f140,plain,
! [X0,X1] : ~ left_convergent_lines(X0,reverse_line(X1)),
inference(cnf_transformation,[],[f79]) ).
fof(f162,plain,
convergent_lines(sK1,sK2),
inference(cnf_transformation,[],[f107]) ).
cnf(c_51,plain,
( ~ convergent_lines(X0,X1)
| unequally_directed_lines(X0,reverse_line(X1)) ),
inference(cnf_transformation,[],[f111]) ).
cnf(c_52,plain,
( ~ convergent_lines(X0,X1)
| unequally_directed_lines(X0,X1) ),
inference(cnf_transformation,[],[f110]) ).
cnf(c_77,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,[],[f136]) ).
cnf(c_80,plain,
~ left_convergent_lines(X0,reverse_line(X1)),
inference(cnf_transformation,[],[f140]) ).
cnf(c_81,plain,
~ left_convergent_lines(X0,X1),
inference(cnf_transformation,[],[f139]) ).
cnf(c_101,negated_conjecture,
convergent_lines(sK1,sK2),
inference(cnf_transformation,[],[f162]) ).
cnf(c_126,plain,
~ convergent_lines(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_52,c_81,c_80,c_52,c_51,c_77]) ).
cnf(c_131,plain,
~ convergent_lines(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_51,c_126]) ).
cnf(c_160,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_101,c_131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO262+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n015.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 29 23:16:11 EDT 2023
% 0.14/0.34 % 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
% 0.48/1.18 % SZS status Started for theBenchmark.p
% 0.48/1.18 % SZS status Theorem for theBenchmark.p
% 0.48/1.18
% 0.48/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.48/1.18
% 0.48/1.18 ------ iProver source info
% 0.48/1.18
% 0.48/1.18 git: date: 2023-05-31 18:12:56 +0000
% 0.48/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.48/1.18 git: non_committed_changes: false
% 0.48/1.18 git: last_make_outside_of_git: false
% 0.48/1.18
% 0.48/1.18 ------ Parsing...
% 0.48/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.18
% 0.48/1.18 ------ Preprocessing...
% 0.48/1.18
% 0.48/1.18 % SZS status Theorem for theBenchmark.p
% 0.48/1.18
% 0.48/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.18
% 0.48/1.18
%------------------------------------------------------------------------------