TSTP Solution File: LCL682+1.001 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : LCL682+1.001 : TPTP v8.1.0. Released v4.0.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 : n021.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 17:45:07 EDT 2022
% Result : Theorem 0.18s 0.50s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 28 ( 5 unt; 0 def)
% Number of atoms : 279 ( 0 equ)
% Maximal formula atoms : 28 ( 9 avg)
% Number of connectives : 458 ( 207 ~; 180 |; 62 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 9 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 192 ( 132 !; 60 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f60,plain,
$false,
inference(subsumption_resolution,[],[f58,f33]) ).
fof(f33,plain,
~ p12(sK6),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
( r1(sK1,sK2)
& r1(sK0,sK1)
& r1(sK0,sK3)
& r1(sK3,sK4)
& ! [X5] :
( ~ r1(sK0,X5)
| ( ! [X6] :
( ~ r1(X5,X6)
| p12(X6) )
& ! [X7] :
( p12(X7)
| ~ r1(X5,X7) ) ) )
& r1(sK5,sK6)
& ~ p12(sK6)
& r1(sK0,sK5)
& r1(sK7,sK8)
& r1(sK0,sK7) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8])],[f17,f26,f25,f24,f23,f22,f21,f20,f19,f18]) ).
fof(f18,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] : r1(X1,X2)
& r1(X0,X1) )
& ? [X3] :
( r1(X0,X3)
& ? [X4] : r1(X3,X4) )
& ! [X5] :
( ~ r1(X0,X5)
| ( ! [X6] :
( ~ r1(X5,X6)
| p12(X6) )
& ! [X7] :
( p12(X7)
| ~ r1(X5,X7) ) ) )
& ? [X8] :
( ? [X9] :
( r1(X8,X9)
& ~ p12(X9) )
& r1(X0,X8) )
& ? [X10] :
( ? [X11] : r1(X10,X11)
& r1(X0,X10) ) )
=> ( ? [X1] :
( ? [X2] : r1(X1,X2)
& r1(sK0,X1) )
& ? [X3] :
( r1(sK0,X3)
& ? [X4] : r1(X3,X4) )
& ! [X5] :
( ~ r1(sK0,X5)
| ( ! [X6] :
( ~ r1(X5,X6)
| p12(X6) )
& ! [X7] :
( p12(X7)
| ~ r1(X5,X7) ) ) )
& ? [X8] :
( ? [X9] :
( r1(X8,X9)
& ~ p12(X9) )
& r1(sK0,X8) )
& ? [X10] :
( ? [X11] : r1(X10,X11)
& r1(sK0,X10) ) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
( ? [X1] :
( ? [X2] : r1(X1,X2)
& r1(sK0,X1) )
=> ( ? [X2] : r1(sK1,X2)
& r1(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
( ? [X2] : r1(sK1,X2)
=> r1(sK1,sK2) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
( ? [X3] :
( r1(sK0,X3)
& ? [X4] : r1(X3,X4) )
=> ( r1(sK0,sK3)
& ? [X4] : r1(sK3,X4) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
( ? [X4] : r1(sK3,X4)
=> r1(sK3,sK4) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
( ? [X8] :
( ? [X9] :
( r1(X8,X9)
& ~ p12(X9) )
& r1(sK0,X8) )
=> ( ? [X9] :
( r1(sK5,X9)
& ~ p12(X9) )
& r1(sK0,sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
( ? [X9] :
( r1(sK5,X9)
& ~ p12(X9) )
=> ( r1(sK5,sK6)
& ~ p12(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
( ? [X10] :
( ? [X11] : r1(X10,X11)
& r1(sK0,X10) )
=> ( ? [X11] : r1(sK7,X11)
& r1(sK0,sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
( ? [X11] : r1(sK7,X11)
=> r1(sK7,sK8) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
? [X0] :
( ? [X1] :
( ? [X2] : r1(X1,X2)
& r1(X0,X1) )
& ? [X3] :
( r1(X0,X3)
& ? [X4] : r1(X3,X4) )
& ! [X5] :
( ~ r1(X0,X5)
| ( ! [X6] :
( ~ r1(X5,X6)
| p12(X6) )
& ! [X7] :
( p12(X7)
| ~ r1(X5,X7) ) ) )
& ? [X8] :
( ? [X9] :
( r1(X8,X9)
& ~ p12(X9) )
& r1(X0,X8) )
& ? [X10] :
( ? [X11] : r1(X10,X11)
& r1(X0,X10) ) ),
inference(rectify,[],[f13]) ).
fof(f13,plain,
? [X0] :
( ? [X3] :
( ? [X4] : r1(X3,X4)
& r1(X0,X3) )
& ? [X12] :
( r1(X0,X12)
& ? [X13] : r1(X12,X13) )
& ! [X7] :
( ~ r1(X0,X7)
| ( ! [X10] :
( ~ r1(X7,X10)
| p12(X10) )
& ! [X8] :
( p12(X8)
| ~ r1(X7,X8) ) ) )
& ? [X5] :
( ? [X6] :
( r1(X5,X6)
& ~ p12(X6) )
& r1(X0,X5) )
& ? [X1] :
( ? [X2] : r1(X1,X2)
& r1(X0,X1) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,plain,
? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| ! [X2] : ~ r1(X1,X2) )
| ~ ! [X7] :
( ~ ( ~ ! [X8] :
( p12(X8)
| ~ r1(X7,X8) )
| ~ ! [X10] :
( ~ r1(X7,X10)
| p12(X10) ) )
| ~ r1(X0,X7) )
| ! [X5] :
( ~ r1(X0,X5)
| ! [X6] :
( ~ r1(X5,X6)
| p12(X6) ) )
| ! [X3] :
( ! [X4] : ~ r1(X3,X4)
| ~ r1(X0,X3) )
| ! [X12] :
( ! [X13] : ~ r1(X12,X13)
| ~ r1(X0,X12) ) ),
inference(pure_predicate_removal,[],[f11]) ).
fof(f11,plain,
? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| ! [X2] : ~ r1(X1,X2) )
| ~ ! [X7] :
( ~ ( ~ ! [X9] :
( p16(X9)
| ~ r1(X7,X9) )
| ~ ! [X8] :
( p12(X8)
| ~ r1(X7,X8) )
| ~ ! [X10] :
( ~ r1(X7,X10)
| p12(X10) ) )
| ~ r1(X0,X7) )
| ! [X5] :
( ~ r1(X0,X5)
| ! [X6] :
( ~ r1(X5,X6)
| p12(X6) ) )
| ! [X3] :
( ! [X4] : ~ r1(X3,X4)
| ~ r1(X0,X3) )
| ! [X12] :
( ! [X13] : ~ r1(X12,X13)
| ~ r1(X0,X12) ) ),
inference(pure_predicate_removal,[],[f10]) ).
fof(f10,plain,
? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| ! [X2] : ~ r1(X1,X2) )
| ~ ! [X7] :
( ~ ( ~ ! [X9] :
( p16(X9)
| ~ r1(X7,X9) )
| ~ ! [X11] :
( p14(X11)
| ~ r1(X7,X11) )
| ~ ! [X8] :
( p12(X8)
| ~ r1(X7,X8) )
| ~ ! [X10] :
( ~ r1(X7,X10)
| p12(X10) ) )
| ~ r1(X0,X7) )
| ! [X5] :
( ~ r1(X0,X5)
| ! [X6] :
( ~ r1(X5,X6)
| p12(X6) ) )
| ! [X3] :
( ! [X4] : ~ r1(X3,X4)
| ~ r1(X0,X3) )
| ! [X12] :
( ! [X13] : ~ r1(X12,X13)
| ~ r1(X0,X12) ) ),
inference(pure_predicate_removal,[],[f9]) ).
fof(f9,plain,
? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| ! [X2] :
( ~ r1(X1,X2)
| p15(X2) ) )
| ~ ! [X7] :
( ~ ( ~ ! [X9] :
( p16(X9)
| ~ r1(X7,X9) )
| ~ ! [X11] :
( p14(X11)
| ~ r1(X7,X11) )
| ~ ! [X8] :
( p12(X8)
| ~ r1(X7,X8) )
| ~ ! [X10] :
( ~ r1(X7,X10)
| p12(X10) ) )
| ~ r1(X0,X7) )
| ! [X5] :
( ~ r1(X0,X5)
| ! [X6] :
( ~ r1(X5,X6)
| p12(X6) ) )
| ! [X3] :
( ! [X4] : ~ r1(X3,X4)
| ~ r1(X0,X3) )
| ! [X12] :
( ! [X13] : ~ r1(X12,X13)
| ~ r1(X0,X12) ) ),
inference(pure_predicate_removal,[],[f8]) ).
fof(f8,plain,
? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| ! [X2] :
( ~ r1(X1,X2)
| p15(X2) ) )
| ~ ! [X7] :
( ~ ( ~ ! [X9] :
( p16(X9)
| ~ r1(X7,X9) )
| ~ ! [X11] :
( p14(X11)
| ~ r1(X7,X11) )
| ~ ! [X8] :
( p12(X8)
| ~ r1(X7,X8) )
| ~ ! [X10] :
( ~ r1(X7,X10)
| p12(X10) ) )
| ~ r1(X0,X7) )
| ! [X5] :
( ~ r1(X0,X5)
| ! [X6] :
( ~ r1(X5,X6)
| p12(X6) ) )
| ! [X3] :
( ! [X4] :
( ~ r1(X3,X4)
| p13(X4) )
| ~ r1(X0,X3) )
| ! [X12] :
( ! [X13] : ~ r1(X12,X13)
| ~ r1(X0,X12) ) ),
inference(pure_predicate_removal,[],[f6]) ).
fof(f6,plain,
? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| ! [X2] :
( ~ r1(X1,X2)
| p15(X2) ) )
| ~ ! [X7] :
( ~ ( ~ ! [X9] :
( p16(X9)
| ~ r1(X7,X9) )
| ~ ! [X11] :
( p14(X11)
| ~ r1(X7,X11) )
| ~ ! [X8] :
( p12(X8)
| ~ r1(X7,X8) )
| ~ ! [X10] :
( ~ r1(X7,X10)
| p12(X10) ) )
| ~ r1(X0,X7) )
| ! [X5] :
( ~ r1(X0,X5)
| ! [X6] :
( ~ r1(X5,X6)
| p12(X6) ) )
| ! [X3] :
( ! [X4] :
( ~ r1(X3,X4)
| p13(X4) )
| ~ r1(X0,X3) )
| ! [X12] :
( ! [X13] :
( p11(X13)
| ~ r1(X12,X13) )
| ~ r1(X0,X12) ) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
~ ~ ? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| ! [X2] :
( ~ r1(X1,X2)
| p15(X2) ) )
| ~ ! [X7] :
( ~ ( ~ ! [X9] :
( p16(X9)
| ~ r1(X7,X9) )
| ~ ! [X11] :
( p14(X11)
| ~ r1(X7,X11) )
| ~ ! [X8] :
( p12(X8)
| ~ r1(X7,X8) )
| ~ ! [X10] :
( ~ r1(X7,X10)
| p12(X10) ) )
| ~ r1(X0,X7) )
| ! [X5] :
( ~ r1(X0,X5)
| ! [X6] :
( ~ r1(X5,X6)
| p12(X6) ) )
| ! [X3] :
( ! [X4] :
( ~ r1(X3,X4)
| p13(X4) )
| ~ r1(X0,X3) )
| ! [X12] :
( ! [X13] :
( p11(X13)
| ~ r1(X12,X13) )
| ~ r1(X0,X12) ) ),
inference(rectify,[],[f4]) ).
fof(f4,negated_conjecture,
~ ~ ? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| ! [X0] :
( ~ r1(X1,X0)
| p15(X0) ) )
| ! [X1] :
( ! [X0] :
( ~ r1(X1,X0)
| p13(X0) )
| ~ r1(X0,X1) )
| ! [X1] :
( ~ r1(X0,X1)
| ! [X0] :
( p12(X0)
| ~ r1(X1,X0) ) )
| ~ ! [X1] :
( ~ ( ~ ! [X0] :
( p12(X0)
| ~ r1(X1,X0) )
| ~ ! [X0] :
( ~ r1(X1,X0)
| p16(X0) )
| ~ ! [X0] :
( ~ r1(X1,X0)
| p12(X0) )
| ~ ! [X0] :
( p14(X0)
| ~ r1(X1,X0) ) )
| ~ r1(X0,X1) )
| ! [X1] :
( ! [X0] :
( ~ r1(X1,X0)
| p11(X0) )
| ~ r1(X0,X1) ) ),
inference(negated_conjecture,[],[f3]) ).
fof(f3,conjecture,
~ ? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| ! [X0] :
( ~ r1(X1,X0)
| p15(X0) ) )
| ! [X1] :
( ! [X0] :
( ~ r1(X1,X0)
| p13(X0) )
| ~ r1(X0,X1) )
| ! [X1] :
( ~ r1(X0,X1)
| ! [X0] :
( p12(X0)
| ~ r1(X1,X0) ) )
| ~ ! [X1] :
( ~ ( ~ ! [X0] :
( p12(X0)
| ~ r1(X1,X0) )
| ~ ! [X0] :
( ~ r1(X1,X0)
| p16(X0) )
| ~ ! [X0] :
( ~ r1(X1,X0)
| p12(X0) )
| ~ ! [X0] :
( p14(X0)
| ~ r1(X1,X0) ) )
| ~ r1(X0,X1) )
| ! [X1] :
( ! [X0] :
( ~ r1(X1,X0)
| p11(X0) )
| ~ r1(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(f58,plain,
p12(sK6),
inference(resolution,[],[f51,f34]) ).
fof(f34,plain,
r1(sK5,sK6),
inference(cnf_transformation,[],[f27]) ).
fof(f51,plain,
! [X2] :
( ~ r1(sK5,X2)
| p12(X2) ),
inference(resolution,[],[f35,f32]) ).
fof(f32,plain,
r1(sK0,sK5),
inference(cnf_transformation,[],[f27]) ).
fof(f35,plain,
! [X7,X5] :
( ~ r1(sK0,X5)
| p12(X7)
| ~ r1(X5,X7) ),
inference(cnf_transformation,[],[f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : LCL682+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33 % Computer : n021.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 30 02:25:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.48 % (15102)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.18/0.49 % (15113)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.18/0.49 % (15119)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.18/0.50 % (15113)First to succeed.
% 0.18/0.50 % (15114)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.18/0.50 % (15102)Also succeeded, but the first one will report.
% 0.18/0.50 % (15111)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.18/0.50 % (15113)Refutation found. Thanks to Tanya!
% 0.18/0.50 % SZS status Theorem for theBenchmark
% 0.18/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.50 % (15113)------------------------------
% 0.18/0.50 % (15113)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50 % (15113)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50 % (15113)Termination reason: Refutation
% 0.18/0.50
% 0.18/0.50 % (15113)Memory used [KB]: 1535
% 0.18/0.50 % (15113)Time elapsed: 0.104 s
% 0.18/0.50 % (15113)Instructions burned: 2 (million)
% 0.18/0.50 % (15113)------------------------------
% 0.18/0.50 % (15113)------------------------------
% 0.18/0.50 % (15100)Success in time 0.161 s
%------------------------------------------------------------------------------