TSTP Solution File: GEO242+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO242+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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:37 EDT 2023
% Result : Theorem 0.81s 1.15s
% Output : CNFRefutation 0.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 66 ( 26 ~; 12 |; 22 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 4 sgn; 32 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X1,X2] :
~ ( left_convergent_lines(X1,reverse_line(X2))
| left_convergent_lines(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oag11) ).
fof(f31,axiom,
! [X1,X2,X5] :
( left_convergent_lines(X1,X2)
=> ( left_convergent_lines(X1,X5)
| unequally_directed_lines(X2,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oagsub3) ).
fof(f32,conjecture,
! [X0,X3,X1] :
( ( left_convergent_lines(X1,reverse_line(line_connecting(X0,X3)))
& distinct_points(X0,X3)
& ~ apart_point_and_line(X0,X1) )
=> left_apart_point(X3,reverse_line(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f33,negated_conjecture,
~ ! [X0,X3,X1] :
( ( left_convergent_lines(X1,reverse_line(line_connecting(X0,X3)))
& distinct_points(X0,X3)
& ~ apart_point_and_line(X0,X1) )
=> left_apart_point(X3,reverse_line(X1)) ),
inference(negated_conjecture,[],[f32]) ).
fof(f46,plain,
! [X0,X1] :
~ ( left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1) ),
inference(rectify,[],[f16]) ).
fof(f58,plain,
! [X0,X1,X2] :
( left_convergent_lines(X0,X1)
=> ( left_convergent_lines(X0,X2)
| unequally_directed_lines(X1,X2) ) ),
inference(rectify,[],[f31]) ).
fof(f59,plain,
~ ! [X0,X1,X2] :
( ( left_convergent_lines(X2,reverse_line(line_connecting(X0,X1)))
& distinct_points(X0,X1)
& ~ apart_point_and_line(X0,X2) )
=> left_apart_point(X1,reverse_line(X2)) ),
inference(rectify,[],[f33]) ).
fof(f75,plain,
! [X0,X1] :
( ~ left_convergent_lines(X0,reverse_line(X1))
& ~ left_convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f46]) ).
fof(f94,plain,
! [X0,X1,X2] :
( left_convergent_lines(X0,X2)
| unequally_directed_lines(X1,X2)
| ~ left_convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f58]) ).
fof(f95,plain,
! [X0,X1,X2] :
( left_convergent_lines(X0,X2)
| unequally_directed_lines(X1,X2)
| ~ left_convergent_lines(X0,X1) ),
inference(flattening,[],[f94]) ).
fof(f96,plain,
? [X0,X1,X2] :
( ~ left_apart_point(X1,reverse_line(X2))
& left_convergent_lines(X2,reverse_line(line_connecting(X0,X1)))
& distinct_points(X0,X1)
& ~ apart_point_and_line(X0,X2) ),
inference(ennf_transformation,[],[f59]) ).
fof(f97,plain,
? [X0,X1,X2] :
( ~ left_apart_point(X1,reverse_line(X2))
& left_convergent_lines(X2,reverse_line(line_connecting(X0,X1)))
& distinct_points(X0,X1)
& ~ apart_point_and_line(X0,X2) ),
inference(flattening,[],[f96]) ).
fof(f98,plain,
( ? [X0,X1,X2] :
( ~ left_apart_point(X1,reverse_line(X2))
& left_convergent_lines(X2,reverse_line(line_connecting(X0,X1)))
& distinct_points(X0,X1)
& ~ apart_point_and_line(X0,X2) )
=> ( ~ left_apart_point(sK1,reverse_line(sK2))
& left_convergent_lines(sK2,reverse_line(line_connecting(sK0,sK1)))
& distinct_points(sK0,sK1)
& ~ apart_point_and_line(sK0,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
( ~ left_apart_point(sK1,reverse_line(sK2))
& left_convergent_lines(sK2,reverse_line(line_connecting(sK0,sK1)))
& distinct_points(sK0,sK1)
& ~ apart_point_and_line(sK0,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f97,f98]) ).
fof(f116,plain,
! [X0,X1] : ~ left_convergent_lines(X0,X1),
inference(cnf_transformation,[],[f75]) ).
fof(f134,plain,
! [X2,X0,X1] :
( left_convergent_lines(X0,X2)
| unequally_directed_lines(X1,X2)
| ~ left_convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f95]) ).
fof(f137,plain,
left_convergent_lines(sK2,reverse_line(line_connecting(sK0,sK1))),
inference(cnf_transformation,[],[f99]) ).
cnf(c_66,plain,
~ left_convergent_lines(X0,X1),
inference(cnf_transformation,[],[f116]) ).
cnf(c_83,plain,
( ~ left_convergent_lines(X0,X1)
| unequally_directed_lines(X1,X2)
| left_convergent_lines(X0,X2) ),
inference(cnf_transformation,[],[f134]) ).
cnf(c_85,negated_conjecture,
left_convergent_lines(sK2,reverse_line(line_connecting(sK0,sK1))),
inference(cnf_transformation,[],[f137]) ).
cnf(c_106,plain,
~ left_convergent_lines(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_83,c_66]) ).
cnf(c_142,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_85,c_106]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO242+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 29 20:30:45 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.81/1.15 % SZS status Started for theBenchmark.p
% 0.81/1.15 % SZS status Theorem for theBenchmark.p
% 0.81/1.15
% 0.81/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.81/1.15
% 0.81/1.15 ------ iProver source info
% 0.81/1.15
% 0.81/1.15 git: date: 2023-05-31 18:12:56 +0000
% 0.81/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.81/1.15 git: non_committed_changes: false
% 0.81/1.15 git: last_make_outside_of_git: false
% 0.81/1.15
% 0.81/1.15 ------ Parsing...
% 0.81/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.81/1.15
% 0.81/1.15 ------ Preprocessing...
% 0.81/1.15
% 0.81/1.15 % SZS status Theorem for theBenchmark.p
% 0.81/1.15
% 0.81/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.81/1.15
% 0.81/1.15
%------------------------------------------------------------------------------