TSTP Solution File: GEO256+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GEO256+1 : TPTP v8.1.2. Bugfixed v6.4.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:17 EDT 2024
% Result : Theorem 0.92s 1.12s
% Output : CNFRefutation 0.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 103 ( 34 ~; 18 |; 42 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 58 ( 4 sgn 36 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0,X1] :
~ ( left_apart_point(X0,reverse_line(X1))
| left_apart_point(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',oag10) ).
fof(f28,axiom,
! [X0,X3,X1] :
( ( left_apart_point(X0,X1)
& distinct_points(X0,X3) )
=> ( left_convergent_lines(line_connecting(X0,X3),X1)
| left_apart_point(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',oaguc2) ).
fof(f32,conjecture,
! [X1,X0,X3,X4,X6] :
( ( left_apart_point(X6,X1)
& ~ apart_point_and_line(X4,X1)
& distinct_points(X3,X4)
& distinct_points(X0,X4) )
=> ( before_on_line(X1,X0,X3)
=> ( before_on_line(X1,X4,X3)
| before_on_line(X1,X0,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f33,negated_conjecture,
~ ! [X1,X0,X3,X4,X6] :
( ( left_apart_point(X6,X1)
& ~ apart_point_and_line(X4,X1)
& distinct_points(X3,X4)
& distinct_points(X0,X4) )
=> ( before_on_line(X1,X0,X3)
=> ( before_on_line(X1,X4,X3)
| before_on_line(X1,X0,X4) ) ) ),
inference(negated_conjecture,[],[f32]) ).
fof(f56,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,[],[f28]) ).
fof(f59,plain,
~ ! [X0,X1,X2,X3,X4] :
( ( left_apart_point(X4,X0)
& ~ apart_point_and_line(X3,X0)
& distinct_points(X2,X3)
& distinct_points(X1,X3) )
=> ( before_on_line(X0,X1,X2)
=> ( before_on_line(X0,X3,X2)
| before_on_line(X0,X1,X3) ) ) ),
inference(rectify,[],[f33]) ).
fof(f76,plain,
! [X0,X1] :
( ~ left_apart_point(X0,reverse_line(X1))
& ~ left_apart_point(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f90,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,[],[f56]) ).
fof(f91,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,[],[f90]) ).
fof(f98,plain,
? [X0,X1,X2,X3,X4] :
( ~ before_on_line(X0,X3,X2)
& ~ before_on_line(X0,X1,X3)
& before_on_line(X0,X1,X2)
& left_apart_point(X4,X0)
& ~ apart_point_and_line(X3,X0)
& distinct_points(X2,X3)
& distinct_points(X1,X3) ),
inference(ennf_transformation,[],[f59]) ).
fof(f99,plain,
? [X0,X1,X2,X3,X4] :
( ~ before_on_line(X0,X3,X2)
& ~ before_on_line(X0,X1,X3)
& before_on_line(X0,X1,X2)
& left_apart_point(X4,X0)
& ~ apart_point_and_line(X3,X0)
& distinct_points(X2,X3)
& distinct_points(X1,X3) ),
inference(flattening,[],[f98]) ).
fof(f102,plain,
( ? [X0,X1,X2,X3,X4] :
( ~ before_on_line(X0,X3,X2)
& ~ before_on_line(X0,X1,X3)
& before_on_line(X0,X1,X2)
& left_apart_point(X4,X0)
& ~ apart_point_and_line(X3,X0)
& distinct_points(X2,X3)
& distinct_points(X1,X3) )
=> ( ~ before_on_line(sK0,sK3,sK2)
& ~ before_on_line(sK0,sK1,sK3)
& before_on_line(sK0,sK1,sK2)
& left_apart_point(sK4,sK0)
& ~ apart_point_and_line(sK3,sK0)
& distinct_points(sK2,sK3)
& distinct_points(sK1,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f103,plain,
( ~ before_on_line(sK0,sK3,sK2)
& ~ before_on_line(sK0,sK1,sK3)
& before_on_line(sK0,sK1,sK2)
& left_apart_point(sK4,sK0)
& ~ apart_point_and_line(sK3,sK0)
& distinct_points(sK2,sK3)
& distinct_points(sK1,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f99,f102]) ).
fof(f125,plain,
! [X0,X1] : ~ left_apart_point(X0,X1),
inference(cnf_transformation,[],[f76]) ).
fof(f142,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,[],[f91]) ).
fof(f149,plain,
left_apart_point(sK4,sK0),
inference(cnf_transformation,[],[f103]) ).
cnf(c_71,plain,
~ left_apart_point(X0,X1),
inference(cnf_transformation,[],[f125]) ).
cnf(c_87,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,[],[f142]) ).
cnf(c_94,negated_conjecture,
left_apart_point(sK4,sK0),
inference(cnf_transformation,[],[f149]) ).
cnf(c_130,plain,
~ left_apart_point(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_87,c_71]) ).
cnf(c_143,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_94,c_130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : GEO256+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.02/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n002.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 01:41:27 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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
% 0.92/1.12 % SZS status Started for theBenchmark.p
% 0.92/1.12 % SZS status Theorem for theBenchmark.p
% 0.92/1.12
% 0.92/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.92/1.12
% 0.92/1.12 ------ iProver source info
% 0.92/1.12
% 0.92/1.12 git: date: 2024-05-02 19:28:25 +0000
% 0.92/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.92/1.12 git: non_committed_changes: false
% 0.92/1.12
% 0.92/1.12 ------ Parsing...
% 0.92/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.92/1.12
% 0.92/1.12 ------ Preprocessing...
% 0.92/1.12
% 0.92/1.12 % SZS status Theorem for theBenchmark.p
% 0.92/1.12
% 0.92/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.92/1.12
% 0.92/1.12
%------------------------------------------------------------------------------