TSTP Solution File: GEO262+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : GEO262+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n019.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 31 16:09:35 EDT 2022
% Result : Theorem 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 5 unt; 0 def)
% Number of atoms : 121 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 140 ( 50 ~; 23 |; 58 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 84 ( 60 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f251,plain,
$false,
inference(resolution,[],[f249,f127]) ).
fof(f127,plain,
convergent_lines(sK1,sK3),
inference(cnf_transformation,[],[f108]) ).
fof(f108,plain,
( ~ apart_point_and_line(sK0,sK3)
& between_on_line(sK4,sK5,sK0,sK2)
& ~ between_on_line(sK1,intersection_point(sK1,parallel_through_point(sK3,sK5)),sK0,intersection_point(sK1,parallel_through_point(sK3,sK2)))
& ~ apart_point_and_line(sK0,sK1)
& convergent_lines(sK4,sK1)
& convergent_lines(sK1,sK3)
& convergent_lines(sK4,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f106,f107]) ).
fof(f107,plain,
( ? [X0,X1,X2,X3,X4,X5] :
( ~ apart_point_and_line(X0,X3)
& between_on_line(X4,X5,X0,X2)
& ~ between_on_line(X1,intersection_point(X1,parallel_through_point(X3,X5)),X0,intersection_point(X1,parallel_through_point(X3,X2)))
& ~ apart_point_and_line(X0,X1)
& convergent_lines(X4,X1)
& convergent_lines(X1,X3)
& convergent_lines(X4,X3) )
=> ( ~ apart_point_and_line(sK0,sK3)
& between_on_line(sK4,sK5,sK0,sK2)
& ~ between_on_line(sK1,intersection_point(sK1,parallel_through_point(sK3,sK5)),sK0,intersection_point(sK1,parallel_through_point(sK3,sK2)))
& ~ apart_point_and_line(sK0,sK1)
& convergent_lines(sK4,sK1)
& convergent_lines(sK1,sK3)
& convergent_lines(sK4,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f106,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ apart_point_and_line(X0,X3)
& between_on_line(X4,X5,X0,X2)
& ~ between_on_line(X1,intersection_point(X1,parallel_through_point(X3,X5)),X0,intersection_point(X1,parallel_through_point(X3,X2)))
& ~ apart_point_and_line(X0,X1)
& convergent_lines(X4,X1)
& convergent_lines(X1,X3)
& convergent_lines(X4,X3) ),
inference(rectify,[],[f100]) ).
fof(f100,plain,
? [X0,X4,X5,X3,X1,X2] :
( ~ apart_point_and_line(X0,X3)
& between_on_line(X1,X2,X0,X5)
& ~ between_on_line(X4,intersection_point(X4,parallel_through_point(X3,X2)),X0,intersection_point(X4,parallel_through_point(X3,X5)))
& ~ apart_point_and_line(X0,X4)
& convergent_lines(X1,X4)
& convergent_lines(X4,X3)
& convergent_lines(X1,X3) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X3,X4,X5,X2,X1,X0] :
( ~ between_on_line(X4,intersection_point(X4,parallel_through_point(X3,X2)),X0,intersection_point(X4,parallel_through_point(X3,X5)))
& convergent_lines(X4,X3)
& between_on_line(X1,X2,X0,X5)
& convergent_lines(X1,X3)
& ~ apart_point_and_line(X0,X3)
& ~ apart_point_and_line(X0,X4)
& convergent_lines(X1,X4) ),
inference(ennf_transformation,[],[f34]) ).
fof(f34,plain,
~ ! [X3,X4,X5,X2,X1,X0] :
( ( convergent_lines(X4,X3)
& between_on_line(X1,X2,X0,X5)
& convergent_lines(X1,X3)
& ~ apart_point_and_line(X0,X3)
& ~ apart_point_and_line(X0,X4)
& convergent_lines(X1,X4) )
=> between_on_line(X4,intersection_point(X4,parallel_through_point(X3,X2)),X0,intersection_point(X4,parallel_through_point(X3,X5))) ),
inference(rectify,[],[f33]) ).
fof(f33,negated_conjecture,
~ ! [X3,X1,X0,X5,X2,X4] :
( ( convergent_lines(X1,X2)
& between_on_line(X1,X0,X3,X4)
& convergent_lines(X2,X5)
& convergent_lines(X1,X5)
& ~ apart_point_and_line(X3,X5)
& ~ apart_point_and_line(X3,X2) )
=> between_on_line(X2,intersection_point(X2,parallel_through_point(X5,X0)),X3,intersection_point(X2,parallel_through_point(X5,X4))) ),
inference(negated_conjecture,[],[f32]) ).
fof(f32,conjecture,
! [X3,X1,X0,X5,X2,X4] :
( ( convergent_lines(X1,X2)
& between_on_line(X1,X0,X3,X4)
& convergent_lines(X2,X5)
& convergent_lines(X1,X5)
& ~ apart_point_and_line(X3,X5)
& ~ apart_point_and_line(X3,X2) )
=> between_on_line(X2,intersection_point(X2,parallel_through_point(X5,X0)),X3,intersection_point(X2,parallel_through_point(X5,X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f249,plain,
! [X2,X3] : ~ convergent_lines(X2,X3),
inference(subsumption_resolution,[],[f245,f164]) ).
fof(f164,plain,
! [X0,X1] :
( unequally_directed_lines(X1,X0)
| ~ convergent_lines(X1,X0) ),
inference(cnf_transformation,[],[f69]) ).
fof(f69,plain,
! [X0,X1] :
( ( unequally_directed_lines(X1,reverse_line(X0))
& unequally_directed_lines(X1,X0) )
| ~ convergent_lines(X1,X0) ),
inference(ennf_transformation,[],[f61]) ).
fof(f61,plain,
! [X1,X0] :
( convergent_lines(X1,X0)
=> ( unequally_directed_lines(X1,reverse_line(X0))
& unequally_directed_lines(X1,X0) ) ),
inference(unused_predicate_definition_removal,[],[f39]) ).
fof(f39,plain,
! [X1,X0] :
( convergent_lines(X1,X0)
<=> ( unequally_directed_lines(X1,reverse_line(X0))
& unequally_directed_lines(X1,X0) ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X2,X1] :
( convergent_lines(X1,X2)
<=> ( unequally_directed_lines(X1,X2)
& unequally_directed_lines(X1,reverse_line(X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con_def) ).
fof(f245,plain,
! [X2,X3] :
( ~ convergent_lines(X2,X3)
| ~ unequally_directed_lines(X2,X3) ),
inference(resolution,[],[f224,f165]) ).
fof(f165,plain,
! [X0,X1] :
( unequally_directed_lines(X1,reverse_line(X0))
| ~ convergent_lines(X1,X0) ),
inference(cnf_transformation,[],[f69]) ).
fof(f224,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1) ),
inference(resolution,[],[f180,f150]) ).
fof(f150,plain,
! [X0,X1] : ~ left_convergent_lines(X1,X0),
inference(cnf_transformation,[],[f73]) ).
fof(f73,plain,
! [X0,X1] :
( ~ left_convergent_lines(X1,X0)
& ~ left_convergent_lines(X1,reverse_line(X0)) ),
inference(ennf_transformation,[],[f60]) ).
fof(f60,plain,
! [X0,X1] :
~ ( left_convergent_lines(X1,X0)
| left_convergent_lines(X1,reverse_line(X0)) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X2,X1] :
~ ( left_convergent_lines(X1,reverse_line(X2))
| left_convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',oag11) ).
fof(f180,plain,
! [X0,X1] :
( left_convergent_lines(X1,X0)
| ~ unequally_directed_lines(X1,X0)
| ~ unequally_directed_lines(X1,reverse_line(X0)) ),
inference(subsumption_resolution,[],[f171,f149]) ).
fof(f149,plain,
! [X0,X1] : ~ left_convergent_lines(X1,reverse_line(X0)),
inference(cnf_transformation,[],[f73]) ).
fof(f171,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X1,reverse_line(X0))
| ~ unequally_directed_lines(X1,X0)
| left_convergent_lines(X1,reverse_line(X0))
| left_convergent_lines(X1,X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0,X1] :
( left_convergent_lines(X1,X0)
| ~ unequally_directed_lines(X1,reverse_line(X0))
| ~ unequally_directed_lines(X1,X0)
| left_convergent_lines(X1,reverse_line(X0)) ),
inference(rectify,[],[f64]) ).
fof(f64,plain,
! [X1,X0] :
( left_convergent_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1)) ),
inference(flattening,[],[f63]) ).
fof(f63,plain,
! [X0,X1] :
( left_convergent_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1)) ),
inference(ennf_transformation,[],[f59]) ).
fof(f59,plain,
! [X0,X1] :
( ( unequally_directed_lines(X0,X1)
& unequally_directed_lines(X0,reverse_line(X1)) )
=> ( left_convergent_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1)) ) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X1,X2] :
( ( unequally_directed_lines(X1,reverse_line(X2))
& unequally_directed_lines(X1,X2) )
=> ( left_convergent_lines(X1,X2)
| left_convergent_lines(X1,reverse_line(X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',oag9) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GEO262+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.04/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 29 21:36:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 % (1977)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.47 % (1993)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.19/0.47 % (1985)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.48 % (1985)Refutation not found, incomplete strategy% (1985)------------------------------
% 0.19/0.48 % (1985)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (1993)First to succeed.
% 0.19/0.49 % (1985)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (1985)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.49
% 0.19/0.49 % (1985)Memory used [KB]: 6012
% 0.19/0.49 % (1985)Time elapsed: 0.087 s
% 0.19/0.49 % (1985)Instructions burned: 3 (million)
% 0.19/0.49 % (1985)------------------------------
% 0.19/0.49 % (1985)------------------------------
% 0.19/0.49 % (1993)Refutation found. Thanks to Tanya!
% 0.19/0.49 % SZS status Theorem for theBenchmark
% 0.19/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49 % (1993)------------------------------
% 0.19/0.49 % (1993)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (1993)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (1993)Termination reason: Refutation
% 0.19/0.49
% 0.19/0.49 % (1993)Memory used [KB]: 6012
% 0.19/0.49 % (1993)Time elapsed: 0.096 s
% 0.19/0.49 % (1993)Instructions burned: 5 (million)
% 0.19/0.49 % (1993)------------------------------
% 0.19/0.49 % (1993)------------------------------
% 0.19/0.49 % (1963)Success in time 0.145 s
%------------------------------------------------------------------------------