TSTP Solution File: GEO251+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO251+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:41 EDT 2023
% Result : Theorem 0.78s 1.14s
% Output : CNFRefutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 6 unt; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 34 ( 17 ~; 6 |; 6 &)
% ( 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 : 35 ( 4 sgn; 23 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( right_apart_point(X0,X1)
<=> left_apart_point(X0,reverse_line(X1)) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',ax10_basics) ).
fof(f37,conjecture,
! [X2,X5,X3] :
( right_apart_point(X5,parallel_through_point(X3,X2))
=> left_apart_point(X2,parallel_through_point(X3,X5)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f38,negated_conjecture,
~ ! [X2,X5,X3] :
( right_apart_point(X5,parallel_through_point(X3,X2))
=> left_apart_point(X2,parallel_through_point(X3,X5)) ),
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))
=> left_apart_point(X0,parallel_through_point(X2,X1)) ),
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] :
( ~ left_apart_point(X0,parallel_through_point(X2,X1))
& right_apart_point(X1,parallel_through_point(X2,X0)) ),
inference(ennf_transformation,[],[f70]) ).
fof(f109,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(f110,plain,
( ? [X0,X1,X2] :
( ~ left_apart_point(X0,parallel_through_point(X2,X1))
& right_apart_point(X1,parallel_through_point(X2,X0)) )
=> ( ~ left_apart_point(sK0,parallel_through_point(sK2,sK1))
& right_apart_point(sK1,parallel_through_point(sK2,sK0)) ) ),
introduced(choice_axiom,[]) ).
fof(f111,plain,
( ~ left_apart_point(sK0,parallel_through_point(sK2,sK1))
& right_apart_point(sK1,parallel_through_point(sK2,sK0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f108,f110]) ).
fof(f112,plain,
! [X0,X1] :
( left_apart_point(X0,reverse_line(X1))
| ~ right_apart_point(X0,X1) ),
inference(cnf_transformation,[],[f109]) ).
fof(f130,plain,
! [X0,X1] : ~ left_apart_point(X0,reverse_line(X1)),
inference(cnf_transformation,[],[f85]) ).
fof(f150,plain,
right_apart_point(sK1,parallel_through_point(sK2,sK0)),
inference(cnf_transformation,[],[f111]) ).
cnf(c_50,plain,
( ~ right_apart_point(X0,X1)
| left_apart_point(X0,reverse_line(X1)) ),
inference(cnf_transformation,[],[f112]) ).
cnf(c_66,plain,
~ left_apart_point(X0,reverse_line(X1)),
inference(cnf_transformation,[],[f130]) ).
cnf(c_88,negated_conjecture,
right_apart_point(sK1,parallel_through_point(sK2,sK0)),
inference(cnf_transformation,[],[f150]) ).
cnf(c_113,plain,
~ right_apart_point(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_50,c_66,c_50]) ).
cnf(c_221,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_88,c_113]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GEO251+3 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 29 23:18:24 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.78/1.14 % SZS status Started for theBenchmark.p
% 0.78/1.14 % SZS status Theorem for theBenchmark.p
% 0.78/1.14
% 0.78/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.78/1.14
% 0.78/1.14 ------ iProver source info
% 0.78/1.14
% 0.78/1.14 git: date: 2023-05-31 18:12:56 +0000
% 0.78/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.78/1.14 git: non_committed_changes: false
% 0.78/1.14 git: last_make_outside_of_git: false
% 0.78/1.14
% 0.78/1.14 ------ Parsing...
% 0.78/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.78/1.14
% 0.78/1.14 ------ Preprocessing...
% 0.78/1.14
% 0.78/1.14 % SZS status Theorem for theBenchmark.p
% 0.78/1.14
% 0.78/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.78/1.14
% 0.78/1.14
%------------------------------------------------------------------------------