TSTP Solution File: GEO263+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : GEO263+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_sat --cores 0 -t %d %s
% Computer : n013.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:12:30 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 8 unt; 0 def)
% Number of atoms : 112 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 110 ( 34 ~; 27 |; 40 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 86 ( 62 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f278,plain,
$false,
inference(subsumption_resolution,[],[f277,f240]) ).
fof(f240,plain,
unequally_directed_lines(sK4,sK3),
inference(resolution,[],[f211,f236]) ).
fof(f236,plain,
convergent_lines(sK4,sK3),
inference(literal_reordering,[],[f130]) ).
fof(f130,plain,
convergent_lines(sK4,sK3),
inference(cnf_transformation,[],[f105]) ).
fof(f105,plain,
( ~ between_on_line(sK4,intersection_point(sK4,parallel_through_point(sK3,sK5)),intersection_point(sK4,parallel_through_point(sK3,sK2)),intersection_point(sK4,parallel_through_point(sK3,sK0)))
& convergent_lines(sK1,sK3)
& convergent_lines(sK4,sK3)
& convergent_lines(sK1,sK4)
& between_on_line(sK1,sK5,sK2,sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f103,f104]) ).
fof(f104,plain,
( ? [X0,X1,X2,X3,X4,X5] :
( ~ between_on_line(X4,intersection_point(X4,parallel_through_point(X3,X5)),intersection_point(X4,parallel_through_point(X3,X2)),intersection_point(X4,parallel_through_point(X3,X0)))
& convergent_lines(X1,X3)
& convergent_lines(X4,X3)
& convergent_lines(X1,X4)
& between_on_line(X1,X5,X2,X0) )
=> ( ~ between_on_line(sK4,intersection_point(sK4,parallel_through_point(sK3,sK5)),intersection_point(sK4,parallel_through_point(sK3,sK2)),intersection_point(sK4,parallel_through_point(sK3,sK0)))
& convergent_lines(sK1,sK3)
& convergent_lines(sK4,sK3)
& convergent_lines(sK1,sK4)
& between_on_line(sK1,sK5,sK2,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f103,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ between_on_line(X4,intersection_point(X4,parallel_through_point(X3,X5)),intersection_point(X4,parallel_through_point(X3,X2)),intersection_point(X4,parallel_through_point(X3,X0)))
& convergent_lines(X1,X3)
& convergent_lines(X4,X3)
& convergent_lines(X1,X4)
& between_on_line(X1,X5,X2,X0) ),
inference(rectify,[],[f80]) ).
fof(f80,plain,
? [X0,X5,X3,X4,X2,X1] :
( ~ between_on_line(X2,intersection_point(X2,parallel_through_point(X4,X1)),intersection_point(X2,parallel_through_point(X4,X3)),intersection_point(X2,parallel_through_point(X4,X0)))
& convergent_lines(X5,X4)
& convergent_lines(X2,X4)
& convergent_lines(X5,X2)
& between_on_line(X5,X1,X3,X0) ),
inference(flattening,[],[f79]) ).
fof(f79,plain,
? [X4,X1,X5,X2,X0,X3] :
( ~ between_on_line(X2,intersection_point(X2,parallel_through_point(X4,X1)),intersection_point(X2,parallel_through_point(X4,X3)),intersection_point(X2,parallel_through_point(X4,X0)))
& convergent_lines(X5,X4)
& convergent_lines(X5,X2)
& convergent_lines(X2,X4)
& between_on_line(X5,X1,X3,X0) ),
inference(ennf_transformation,[],[f50]) ).
fof(f50,plain,
~ ! [X4,X1,X5,X2,X0,X3] :
( ( convergent_lines(X5,X4)
& convergent_lines(X5,X2)
& convergent_lines(X2,X4)
& between_on_line(X5,X1,X3,X0) )
=> between_on_line(X2,intersection_point(X2,parallel_through_point(X4,X1)),intersection_point(X2,parallel_through_point(X4,X3)),intersection_point(X2,parallel_through_point(X4,X0))) ),
inference(rectify,[],[f33]) ).
fof(f33,negated_conjecture,
~ ! [X4,X0,X2,X3,X5,X1] :
( ( between_on_line(X1,X0,X3,X4)
& convergent_lines(X2,X5)
& convergent_lines(X1,X2)
& convergent_lines(X1,X5) )
=> between_on_line(X2,intersection_point(X2,parallel_through_point(X5,X0)),intersection_point(X2,parallel_through_point(X5,X3)),intersection_point(X2,parallel_through_point(X5,X4))) ),
inference(negated_conjecture,[],[f32]) ).
fof(f32,conjecture,
! [X4,X0,X2,X3,X5,X1] :
( ( between_on_line(X1,X0,X3,X4)
& convergent_lines(X2,X5)
& convergent_lines(X1,X2)
& convergent_lines(X1,X5) )
=> between_on_line(X2,intersection_point(X2,parallel_through_point(X5,X0)),intersection_point(X2,parallel_through_point(X5,X3)),intersection_point(X2,parallel_through_point(X5,X4))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f211,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| unequally_directed_lines(X0,X1) ),
inference(literal_reordering,[],[f166]) ).
fof(f166,plain,
! [X0,X1] :
( unequally_directed_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f102,plain,
! [X0,X1] :
( ( unequally_directed_lines(X0,reverse_line(X1))
& unequally_directed_lines(X0,X1) )
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f61]) ).
fof(f61,plain,
! [X1,X0] :
( convergent_lines(X0,X1)
=> ( unequally_directed_lines(X0,reverse_line(X1))
& unequally_directed_lines(X0,X1) ) ),
inference(unused_predicate_definition_removal,[],[f46]) ).
fof(f46,plain,
! [X1,X0] :
( convergent_lines(X0,X1)
<=> ( unequally_directed_lines(X0,reverse_line(X1))
& unequally_directed_lines(X0,X1) ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X2] :
( ( unequally_directed_lines(X1,reverse_line(X2))
& unequally_directed_lines(X1,X2) )
<=> convergent_lines(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con_def) ).
fof(f277,plain,
~ unequally_directed_lines(sK4,sK3),
inference(resolution,[],[f271,f243]) ).
fof(f243,plain,
unequally_directed_lines(sK4,reverse_line(sK3)),
inference(resolution,[],[f207,f236]) ).
fof(f207,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| unequally_directed_lines(X0,reverse_line(X1)) ),
inference(literal_reordering,[],[f167]) ).
fof(f167,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| unequally_directed_lines(X0,reverse_line(X1)) ),
inference(cnf_transformation,[],[f102]) ).
fof(f271,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X1,reverse_line(X0))
| ~ unequally_directed_lines(X1,X0) ),
inference(subsumption_resolution,[],[f270,f231]) ).
fof(f231,plain,
! [X0,X1] : ~ left_convergent_lines(X0,X1),
inference(literal_reordering,[],[f180]) ).
fof(f180,plain,
! [X0,X1] : ~ left_convergent_lines(X0,X1),
inference(cnf_transformation,[],[f87]) ).
fof(f87,plain,
! [X0,X1] :
( ~ left_convergent_lines(X0,reverse_line(X1))
& ~ left_convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,plain,
! [X1,X0] :
~ ( left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X1,X2] :
~ ( left_convergent_lines(X1,X2)
| left_convergent_lines(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oag11) ).
fof(f270,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X1,reverse_line(X0))
| left_convergent_lines(X1,X0)
| ~ unequally_directed_lines(X1,X0) ),
inference(subsumption_resolution,[],[f202,f231]) ).
fof(f202,plain,
! [X0,X1] :
( left_convergent_lines(X1,reverse_line(X0))
| ~ unequally_directed_lines(X1,X0)
| left_convergent_lines(X1,X0)
| ~ unequally_directed_lines(X1,reverse_line(X0)) ),
inference(literal_reordering,[],[f169]) ).
fof(f169,plain,
! [X0,X1] :
( left_convergent_lines(X1,reverse_line(X0))
| left_convergent_lines(X1,X0)
| ~ unequally_directed_lines(X1,reverse_line(X0))
| ~ unequally_directed_lines(X1,X0) ),
inference(cnf_transformation,[],[f122]) ).
fof(f122,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X1,X0)
| left_convergent_lines(X1,X0)
| ~ unequally_directed_lines(X1,reverse_line(X0))
| left_convergent_lines(X1,reverse_line(X0)) ),
inference(rectify,[],[f84]) ).
fof(f84,plain,
! [X1,X0] :
( ~ unequally_directed_lines(X0,X1)
| left_convergent_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,reverse_line(X1)) ),
inference(flattening,[],[f83]) ).
fof(f83,plain,
! [X0,X1] :
( left_convergent_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,plain,
! [X0,X1] :
( ( unequally_directed_lines(X0,reverse_line(X1))
& unequally_directed_lines(X0,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,reverse_line(X2))
| left_convergent_lines(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oag9) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GEO263+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n013.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:29:32 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.48 % (27145)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.48 % (27153)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.49 % (27153)First to succeed.
% 0.20/0.50 % (27153)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (27153)------------------------------
% 0.20/0.50 % (27153)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (27153)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (27153)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (27153)Memory used [KB]: 5884
% 0.20/0.50 % (27153)Time elapsed: 0.011 s
% 0.20/0.50 % (27153)Instructions burned: 8 (million)
% 0.20/0.50 % (27153)------------------------------
% 0.20/0.50 % (27153)------------------------------
% 0.20/0.50 % (27126)Success in time 0.146 s
%------------------------------------------------------------------------------