TSTP Solution File: GEO247+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GEO247+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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:14 EDT 2024
% Result : Theorem 1.01s 1.22s
% Output : CNFRefutation 1.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 108 ( 0 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 108 ( 22 ~; 16 |; 64 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 66 ( 4 sgn 41 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f20,axiom,
! [X2,X3] :
~ ( left_apart_point(X2,reverse_line(X3))
| left_apart_point(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax10_basics) ).
fof(f33,axiom,
! [X2,X5,X3] :
( ( left_apart_point(X2,X3)
& distinct_points(X2,X5) )
=> ( left_convergent_lines(line_connecting(X2,X5),X3)
| left_apart_point(X5,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2_uniq_cons) ).
fof(f37,conjecture,
! [X2,X5,X6,X8,X3,X4] :
( ( left_apart_point(X8,X4)
& right_apart_point(X8,X3)
& right_apart_point(X6,X4)
& left_apart_point(X6,X3)
& right_apart_point(X5,X4)
& right_apart_point(X5,X3)
& left_apart_point(X2,X4)
& left_apart_point(X2,X3) )
=> convergent_lines(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f38,negated_conjecture,
~ ! [X2,X5,X6,X8,X3,X4] :
( ( left_apart_point(X8,X4)
& right_apart_point(X8,X3)
& right_apart_point(X6,X4)
& left_apart_point(X6,X3)
& right_apart_point(X5,X4)
& right_apart_point(X5,X3)
& left_apart_point(X2,X4)
& left_apart_point(X2,X3) )
=> convergent_lines(X3,X4) ),
inference(negated_conjecture,[],[f37]) ).
fof(f53,plain,
! [X0,X1] :
~ ( left_apart_point(X0,reverse_line(X1))
| left_apart_point(X0,X1) ),
inference(rectify,[],[f20]) ).
fof(f66,plain,
! [X0,X1,X2] :
( ( left_apart_point(X0,X2)
& distinct_points(X0,X1) )
=> ( left_convergent_lines(line_connecting(X0,X1),X2)
| left_apart_point(X1,X2) ) ),
inference(rectify,[],[f33]) ).
fof(f70,plain,
~ ! [X0,X1,X2,X3,X4,X5] :
( ( left_apart_point(X3,X5)
& right_apart_point(X3,X4)
& right_apart_point(X2,X5)
& left_apart_point(X2,X4)
& right_apart_point(X1,X5)
& right_apart_point(X1,X4)
& left_apart_point(X0,X5)
& left_apart_point(X0,X4) )
=> convergent_lines(X4,X5) ),
inference(rectify,[],[f38]) ).
fof(f90,plain,
! [X0,X1] :
( ~ left_apart_point(X0,reverse_line(X1))
& ~ left_apart_point(X0,X1) ),
inference(ennf_transformation,[],[f53]) ).
fof(f105,plain,
! [X0,X1,X2] :
( left_convergent_lines(line_connecting(X0,X1),X2)
| left_apart_point(X1,X2)
| ~ left_apart_point(X0,X2)
| ~ distinct_points(X0,X1) ),
inference(ennf_transformation,[],[f66]) ).
fof(f106,plain,
! [X0,X1,X2] :
( left_convergent_lines(line_connecting(X0,X1),X2)
| left_apart_point(X1,X2)
| ~ left_apart_point(X0,X2)
| ~ distinct_points(X0,X1) ),
inference(flattening,[],[f105]) ).
fof(f113,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ convergent_lines(X4,X5)
& left_apart_point(X3,X5)
& right_apart_point(X3,X4)
& right_apart_point(X2,X5)
& left_apart_point(X2,X4)
& right_apart_point(X1,X5)
& right_apart_point(X1,X4)
& left_apart_point(X0,X5)
& left_apart_point(X0,X4) ),
inference(ennf_transformation,[],[f70]) ).
fof(f114,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ convergent_lines(X4,X5)
& left_apart_point(X3,X5)
& right_apart_point(X3,X4)
& right_apart_point(X2,X5)
& left_apart_point(X2,X4)
& right_apart_point(X1,X5)
& right_apart_point(X1,X4)
& left_apart_point(X0,X5)
& left_apart_point(X0,X4) ),
inference(flattening,[],[f113]) ).
fof(f116,plain,
( ? [X0,X1,X2,X3,X4,X5] :
( ~ convergent_lines(X4,X5)
& left_apart_point(X3,X5)
& right_apart_point(X3,X4)
& right_apart_point(X2,X5)
& left_apart_point(X2,X4)
& right_apart_point(X1,X5)
& right_apart_point(X1,X4)
& left_apart_point(X0,X5)
& left_apart_point(X0,X4) )
=> ( ~ convergent_lines(sK4,sK5)
& left_apart_point(sK3,sK5)
& right_apart_point(sK3,sK4)
& right_apart_point(sK2,sK5)
& left_apart_point(sK2,sK4)
& right_apart_point(sK1,sK5)
& right_apart_point(sK1,sK4)
& left_apart_point(sK0,sK5)
& left_apart_point(sK0,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f117,plain,
( ~ convergent_lines(sK4,sK5)
& left_apart_point(sK3,sK5)
& right_apart_point(sK3,sK4)
& right_apart_point(sK2,sK5)
& left_apart_point(sK2,sK4)
& right_apart_point(sK1,sK5)
& right_apart_point(sK1,sK4)
& left_apart_point(sK0,sK5)
& left_apart_point(sK0,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f114,f116]) ).
fof(f137,plain,
! [X0,X1] : ~ left_apart_point(X0,X1),
inference(cnf_transformation,[],[f90]) ).
fof(f154,plain,
! [X2,X0,X1] :
( left_convergent_lines(line_connecting(X0,X1),X2)
| left_apart_point(X1,X2)
| ~ left_apart_point(X0,X2)
| ~ distinct_points(X0,X1) ),
inference(cnf_transformation,[],[f106]) ).
fof(f165,plain,
left_apart_point(sK3,sK5),
inference(cnf_transformation,[],[f117]) ).
cnf(c_69,plain,
~ left_apart_point(X0,X1),
inference(cnf_transformation,[],[f137]) ).
cnf(c_85,plain,
( ~ left_apart_point(X0,X1)
| ~ distinct_points(X0,X2)
| left_convergent_lines(line_connecting(X0,X2),X1)
| left_apart_point(X2,X1) ),
inference(cnf_transformation,[],[f154]) ).
cnf(c_90,negated_conjecture,
left_apart_point(sK3,sK5),
inference(cnf_transformation,[],[f165]) ).
cnf(c_139,plain,
~ left_apart_point(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_85,c_69]) ).
cnf(c_243,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_90,c_139]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GEO247+3 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n002.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 : Fri May 3 01:33:12 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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
% 1.01/1.22 % SZS status Started for theBenchmark.p
% 1.01/1.22 % SZS status Theorem for theBenchmark.p
% 1.01/1.22
% 1.01/1.22 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.01/1.22
% 1.01/1.22 ------ iProver source info
% 1.01/1.22
% 1.01/1.22 git: date: 2024-05-02 19:28:25 +0000
% 1.01/1.22 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.01/1.22 git: non_committed_changes: false
% 1.01/1.22
% 1.01/1.22 ------ Parsing...
% 1.01/1.22 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.01/1.22
% 1.01/1.22 ------ Preprocessing...
% 1.01/1.22
% 1.01/1.22 % SZS status Theorem for theBenchmark.p
% 1.01/1.22
% 1.01/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.01/1.22
% 1.01/1.22
%------------------------------------------------------------------------------