TSTP Solution File: GEO249+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GEO249+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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:15 EDT 2024
% Result : Theorem 0.87s 1.18s
% Output : CNFRefutation 0.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 6 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 44 ( 18 ~; 6 |; 15 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 4 sgn 23 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( right_apart_point(X0,X1)
<=> left_apart_point(X0,reverse_line(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a2_defns) ).
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(f37,conjecture,
! [X2,X5,X3] :
( ( right_apart_point(X5,parallel_through_point(X3,X2))
& right_apart_point(X2,X3) )
=> right_apart_point(X5,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f38,negated_conjecture,
~ ! [X2,X5,X3] :
( ( right_apart_point(X5,parallel_through_point(X3,X2))
& right_apart_point(X2,X3) )
=> right_apart_point(X5,X3) ),
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(f70,plain,
~ ! [X0,X1,X2] :
( ( right_apart_point(X1,parallel_through_point(X2,X0))
& right_apart_point(X0,X2) )
=> right_apart_point(X1,X2) ),
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(f108,plain,
? [X0,X1,X2] :
( ~ right_apart_point(X1,X2)
& right_apart_point(X1,parallel_through_point(X2,X0))
& right_apart_point(X0,X2) ),
inference(ennf_transformation,[],[f70]) ).
fof(f109,plain,
? [X0,X1,X2] :
( ~ right_apart_point(X1,X2)
& right_apart_point(X1,parallel_through_point(X2,X0))
& right_apart_point(X0,X2) ),
inference(flattening,[],[f108]) ).
fof(f110,plain,
! [X0,X1] :
( ( right_apart_point(X0,X1)
| ~ left_apart_point(X0,reverse_line(X1)) )
& ( left_apart_point(X0,reverse_line(X1))
| ~ right_apart_point(X0,X1) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f111,plain,
( ? [X0,X1,X2] :
( ~ right_apart_point(X1,X2)
& right_apart_point(X1,parallel_through_point(X2,X0))
& right_apart_point(X0,X2) )
=> ( ~ right_apart_point(sK1,sK2)
& right_apart_point(sK1,parallel_through_point(sK2,sK0))
& right_apart_point(sK0,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f112,plain,
( ~ right_apart_point(sK1,sK2)
& right_apart_point(sK1,parallel_through_point(sK2,sK0))
& right_apart_point(sK0,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f109,f111]) ).
fof(f113,plain,
! [X0,X1] :
( left_apart_point(X0,reverse_line(X1))
| ~ right_apart_point(X0,X1) ),
inference(cnf_transformation,[],[f110]) ).
fof(f131,plain,
! [X0,X1] : ~ left_apart_point(X0,reverse_line(X1)),
inference(cnf_transformation,[],[f85]) ).
fof(f151,plain,
right_apart_point(sK0,sK2),
inference(cnf_transformation,[],[f112]) ).
cnf(c_50,plain,
( ~ right_apart_point(X0,X1)
| left_apart_point(X0,reverse_line(X1)) ),
inference(cnf_transformation,[],[f113]) ).
cnf(c_66,plain,
~ left_apart_point(X0,reverse_line(X1)),
inference(cnf_transformation,[],[f131]) ).
cnf(c_89,negated_conjecture,
right_apart_point(sK0,sK2),
inference(cnf_transformation,[],[f151]) ).
cnf(c_114,plain,
~ right_apart_point(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_50,c_66,c_50]) ).
cnf(c_218,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_89,c_114]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO249+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n029.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:07 EDT 2024
% 0.13/0.35 % 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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.87/1.18 % SZS status Started for theBenchmark.p
% 0.87/1.18 % SZS status Theorem for theBenchmark.p
% 0.87/1.18
% 0.87/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.87/1.18
% 0.87/1.18 ------ iProver source info
% 0.87/1.18
% 0.87/1.18 git: date: 2024-05-02 19:28:25 +0000
% 0.87/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.87/1.18 git: non_committed_changes: false
% 0.87/1.18
% 0.87/1.18 ------ Parsing...
% 0.87/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.87/1.18
% 0.87/1.18 ------ Preprocessing...
% 0.87/1.18
% 0.87/1.18 % SZS status Theorem for theBenchmark.p
% 0.87/1.18
% 0.87/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.87/1.18
% 0.87/1.18
%------------------------------------------------------------------------------