TSTP Solution File: GEO256+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GEO256+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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 : Mon Jun 24 06:14:14 EDT 2024
% Result : Theorem 0.45s 1.13s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 92 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 97 ( 27 ~; 19 |; 42 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 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 : 60 ( 4 sgn 38 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f20,axiom,
! [X2,X3] :
~ ( left_apart_point(X2,reverse_line(X3))
| left_apart_point(X2,X3) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',ax2_uniq_cons) ).
fof(f37,conjecture,
! [X3,X2,X5,X6,X8] :
( ( left_apart_point(X8,X3)
& incident_point_and_line(X6,X3)
& distinct_points(X5,X6)
& distinct_points(X2,X6) )
=> ( before_on_line(X3,X2,X5)
=> ( before_on_line(X3,X6,X5)
| before_on_line(X3,X2,X6) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f38,negated_conjecture,
~ ! [X3,X2,X5,X6,X8] :
( ( left_apart_point(X8,X3)
& incident_point_and_line(X6,X3)
& distinct_points(X5,X6)
& distinct_points(X2,X6) )
=> ( before_on_line(X3,X2,X5)
=> ( before_on_line(X3,X6,X5)
| before_on_line(X3,X2,X6) ) ) ),
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] :
( ( left_apart_point(X4,X0)
& incident_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,[],[f38]) ).
fof(f85,plain,
! [X0,X1] :
( ~ left_apart_point(X0,reverse_line(X1))
& ~ left_apart_point(X0,X1) ),
inference(ennf_transformation,[],[f53]) ).
fof(f100,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(f101,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,[],[f100]) ).
fof(f108,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)
& incident_point_and_line(X3,X0)
& distinct_points(X2,X3)
& distinct_points(X1,X3) ),
inference(ennf_transformation,[],[f70]) ).
fof(f109,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)
& incident_point_and_line(X3,X0)
& distinct_points(X2,X3)
& distinct_points(X1,X3) ),
inference(flattening,[],[f108]) ).
fof(f113,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)
& incident_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)
& incident_point_and_line(sK3,sK0)
& distinct_points(sK2,sK3)
& distinct_points(sK1,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f114,plain,
( ~ before_on_line(sK0,sK3,sK2)
& ~ before_on_line(sK0,sK1,sK3)
& before_on_line(sK0,sK1,sK2)
& left_apart_point(sK4,sK0)
& incident_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])],[f109,f113]) ).
fof(f137,plain,
! [X0,X1] : ~ left_apart_point(X0,X1),
inference(cnf_transformation,[],[f85]) ).
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,[],[f101]) ).
fof(f161,plain,
left_apart_point(sK4,sK0),
inference(cnf_transformation,[],[f114]) ).
cnf(c_72,plain,
~ left_apart_point(X0,X1),
inference(cnf_transformation,[],[f137]) ).
cnf(c_88,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_95,negated_conjecture,
left_apart_point(sK4,sK0),
inference(cnf_transformation,[],[f161]) ).
cnf(c_137,plain,
~ left_apart_point(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_88,c_72]) ).
cnf(c_261,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_95,c_137]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GEO256+3 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n024.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri Jun 21 09:40:09 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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.45/1.13 % SZS status Started for theBenchmark.p
% 0.45/1.13 % SZS status Theorem for theBenchmark.p
% 0.45/1.13
% 0.45/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.45/1.13
% 0.45/1.13 ------ iProver source info
% 0.45/1.13
% 0.45/1.13 git: date: 2024-06-12 09:56:46 +0000
% 0.45/1.13 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.45/1.13 git: non_committed_changes: false
% 0.45/1.13
% 0.45/1.13 ------ Parsing...
% 0.45/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.45/1.13
% 0.45/1.13 ------ Preprocessing...
% 0.45/1.13
% 0.45/1.13 % SZS status Theorem for theBenchmark.p
% 0.45/1.13
% 0.45/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.13
% 0.45/1.13
%------------------------------------------------------------------------------