TSTP Solution File: GEO237+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO237+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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:35 EDT 2023
% Result : Theorem 0.68s 1.07s
% Output : CNFRefutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 8 unt; 0 def)
% Number of atoms : 80 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 85 ( 33 ~; 21 |; 21 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 60 ( 6 sgn; 38 !; 12 ?)
% 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(f6,axiom,
! [X2,X3] :
( apart_point_and_line(X2,X3)
<=> ( right_apart_point(X2,X3)
| left_apart_point(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a6_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,X6,X3] :
( apart_point_and_line(X6,X3)
=> ( divides_points(X3,X2,X5)
=> ( divides_points(X3,X5,X6)
| divides_points(X3,X2,X6) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f38,negated_conjecture,
~ ! [X2,X5,X6,X3] :
( apart_point_and_line(X6,X3)
=> ( divides_points(X3,X2,X5)
=> ( divides_points(X3,X5,X6)
| divides_points(X3,X2,X6) ) ) ),
inference(negated_conjecture,[],[f37]) ).
fof(f39,plain,
! [X0,X1] :
( apart_point_and_line(X0,X1)
<=> ( right_apart_point(X0,X1)
| left_apart_point(X0,X1) ) ),
inference(rectify,[],[f6]) ).
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,X3] :
( apart_point_and_line(X2,X3)
=> ( divides_points(X3,X0,X1)
=> ( divides_points(X3,X1,X2)
| divides_points(X3,X0,X2) ) ) ),
inference(rectify,[],[f38]) ).
fof(f83,plain,
! [X0,X1] :
( ~ left_apart_point(X0,reverse_line(X1))
& ~ left_apart_point(X0,X1) ),
inference(ennf_transformation,[],[f53]) ).
fof(f106,plain,
? [X0,X1,X2,X3] :
( ~ divides_points(X3,X1,X2)
& ~ divides_points(X3,X0,X2)
& divides_points(X3,X0,X1)
& apart_point_and_line(X2,X3) ),
inference(ennf_transformation,[],[f70]) ).
fof(f107,plain,
? [X0,X1,X2,X3] :
( ~ divides_points(X3,X1,X2)
& ~ divides_points(X3,X0,X2)
& divides_points(X3,X0,X1)
& apart_point_and_line(X2,X3) ),
inference(flattening,[],[f106]) ).
fof(f108,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(f109,plain,
! [X0,X1] :
( ( apart_point_and_line(X0,X1)
| ( ~ right_apart_point(X0,X1)
& ~ left_apart_point(X0,X1) ) )
& ( right_apart_point(X0,X1)
| left_apart_point(X0,X1)
| ~ apart_point_and_line(X0,X1) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f110,plain,
! [X0,X1] :
( ( apart_point_and_line(X0,X1)
| ( ~ right_apart_point(X0,X1)
& ~ left_apart_point(X0,X1) ) )
& ( right_apart_point(X0,X1)
| left_apart_point(X0,X1)
| ~ apart_point_and_line(X0,X1) ) ),
inference(flattening,[],[f109]) ).
fof(f113,plain,
( ? [X0,X1,X2,X3] :
( ~ divides_points(X3,X1,X2)
& ~ divides_points(X3,X0,X2)
& divides_points(X3,X0,X1)
& apart_point_and_line(X2,X3) )
=> ( ~ divides_points(sK3,sK1,sK2)
& ~ divides_points(sK3,sK0,sK2)
& divides_points(sK3,sK0,sK1)
& apart_point_and_line(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f114,plain,
( ~ divides_points(sK3,sK1,sK2)
& ~ divides_points(sK3,sK0,sK2)
& divides_points(sK3,sK0,sK1)
& apart_point_and_line(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f107,f113]) ).
fof(f115,plain,
! [X0,X1] :
( left_apart_point(X0,reverse_line(X1))
| ~ right_apart_point(X0,X1) ),
inference(cnf_transformation,[],[f108]) ).
fof(f118,plain,
! [X0,X1] :
( right_apart_point(X0,X1)
| left_apart_point(X0,X1)
| ~ apart_point_and_line(X0,X1) ),
inference(cnf_transformation,[],[f110]) ).
fof(f139,plain,
! [X0,X1] : ~ left_apart_point(X0,X1),
inference(cnf_transformation,[],[f83]) ).
fof(f140,plain,
! [X0,X1] : ~ left_apart_point(X0,reverse_line(X1)),
inference(cnf_transformation,[],[f83]) ).
fof(f160,plain,
apart_point_and_line(sK2,sK3),
inference(cnf_transformation,[],[f114]) ).
cnf(c_50,plain,
( ~ right_apart_point(X0,X1)
| left_apart_point(X0,reverse_line(X1)) ),
inference(cnf_transformation,[],[f115]) ).
cnf(c_54,plain,
( ~ apart_point_and_line(X0,X1)
| right_apart_point(X0,X1)
| left_apart_point(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
cnf(c_73,plain,
~ left_apart_point(X0,reverse_line(X1)),
inference(cnf_transformation,[],[f140]) ).
cnf(c_74,plain,
~ left_apart_point(X0,X1),
inference(cnf_transformation,[],[f139]) ).
cnf(c_97,negated_conjecture,
apart_point_and_line(sK2,sK3),
inference(cnf_transformation,[],[f160]) ).
cnf(c_134,plain,
~ apart_point_and_line(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_54,c_74,c_73,c_50,c_54]) ).
cnf(c_244,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_97,c_134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO237+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n025.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 : Tue Aug 29 23:26:10 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.68/1.07 % SZS status Started for theBenchmark.p
% 0.68/1.07 % SZS status Theorem for theBenchmark.p
% 0.68/1.07
% 0.68/1.07 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.68/1.07
% 0.68/1.07 ------ iProver source info
% 0.68/1.07
% 0.68/1.07 git: date: 2023-05-31 18:12:56 +0000
% 0.68/1.07 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.68/1.07 git: non_committed_changes: false
% 0.68/1.07 git: last_make_outside_of_git: false
% 0.68/1.07
% 0.68/1.07 ------ Parsing...
% 0.68/1.07 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.68/1.07
% 0.68/1.07 ------ Preprocessing...
% 0.68/1.07
% 0.68/1.07 % SZS status Theorem for theBenchmark.p
% 0.68/1.07
% 0.68/1.07 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.68/1.07
% 0.68/1.07
%------------------------------------------------------------------------------