TSTP Solution File: LCL664+1.001 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : LCL664+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 : n022.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:44:14 EDT 2022
% Result : Theorem 0.20s 0.47s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 3 unt; 0 def)
% Number of atoms : 186 ( 0 equ)
% Maximal formula atoms : 18 ( 8 avg)
% Number of connectives : 300 ( 135 ~; 128 |; 32 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 9 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 112 ( 80 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f32,plain,
$false,
inference(unit_resulting_resolution,[],[f22,f21,f24]) ).
fof(f24,plain,
! [X3] :
( ~ r1(sK0,X3)
| p12(X3) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( r1(sK0,sK1)
& r1(sK0,sK2)
& ! [X3] :
( ~ r1(sK0,X3)
| p12(X3) )
& r1(sK0,sK3)
& ~ p12(sK4)
& r1(sK0,sK4)
& ! [X6] :
( ~ r1(sK0,X6)
| p12(X6) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f12,f17,f16,f15,f14,f13]) ).
fof(f13,plain,
( ? [X0] :
( ? [X1] : r1(X0,X1)
& ? [X2] : r1(X0,X2)
& ! [X3] :
( ~ r1(X0,X3)
| p12(X3) )
& ? [X4] : r1(X0,X4)
& ? [X5] :
( ~ p12(X5)
& r1(X0,X5) )
& ! [X6] :
( ~ r1(X0,X6)
| p12(X6) ) )
=> ( ? [X1] : r1(sK0,X1)
& ? [X2] : r1(sK0,X2)
& ! [X3] :
( ~ r1(sK0,X3)
| p12(X3) )
& ? [X4] : r1(sK0,X4)
& ? [X5] :
( ~ p12(X5)
& r1(sK0,X5) )
& ! [X6] :
( ~ r1(sK0,X6)
| p12(X6) ) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
( ? [X1] : r1(sK0,X1)
=> r1(sK0,sK1) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( ? [X2] : r1(sK0,X2)
=> r1(sK0,sK2) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ? [X4] : r1(sK0,X4)
=> r1(sK0,sK3) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( ? [X5] :
( ~ p12(X5)
& r1(sK0,X5) )
=> ( ~ p12(sK4)
& r1(sK0,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
? [X0] :
( ? [X1] : r1(X0,X1)
& ? [X2] : r1(X0,X2)
& ! [X3] :
( ~ r1(X0,X3)
| p12(X3) )
& ? [X4] : r1(X0,X4)
& ? [X5] :
( ~ p12(X5)
& r1(X0,X5) )
& ! [X6] :
( ~ r1(X0,X6)
| p12(X6) ) ),
inference(rectify,[],[f11]) ).
fof(f11,plain,
? [X0] :
( ? [X1] : r1(X0,X1)
& ? [X3] : r1(X0,X3)
& ! [X2] :
( ~ r1(X0,X2)
| p12(X2) )
& ? [X4] : r1(X0,X4)
& ? [X8] :
( ~ p12(X8)
& r1(X0,X8) )
& ! [X7] :
( ~ r1(X0,X7)
| p12(X7) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,plain,
? [X0] :
~ ( ! [X1] : ~ r1(X0,X1)
| ! [X3] : ~ r1(X0,X3)
| ! [X8] :
( ~ r1(X0,X8)
| p12(X8) )
| ~ ! [X7] :
( ~ r1(X0,X7)
| p12(X7) )
| ! [X4] : ~ r1(X0,X4)
| ~ ! [X2] :
( ~ r1(X0,X2)
| p12(X2) ) ),
inference(pure_predicate_removal,[],[f9]) ).
fof(f9,plain,
? [X0] :
~ ( ! [X1] : ~ r1(X0,X1)
| ! [X3] : ~ r1(X0,X3)
| ! [X8] :
( ~ r1(X0,X8)
| p12(X8) )
| ~ ! [X7] :
( ~ r1(X0,X7)
| p12(X7) )
| ! [X4] : ~ r1(X0,X4)
| ~ ! [X2] :
( ~ r1(X0,X2)
| p12(X2) )
| ~ ! [X5] :
( p16(X5)
| ~ r1(X0,X5) ) ),
inference(pure_predicate_removal,[],[f8]) ).
fof(f8,plain,
? [X0] :
~ ( ! [X1] : ~ r1(X0,X1)
| ! [X3] : ~ r1(X0,X3)
| ~ ! [X6] :
( ~ r1(X0,X6)
| p14(X6) )
| ! [X8] :
( ~ r1(X0,X8)
| p12(X8) )
| ~ ! [X7] :
( ~ r1(X0,X7)
| p12(X7) )
| ! [X4] : ~ r1(X0,X4)
| ~ ! [X2] :
( ~ r1(X0,X2)
| p12(X2) )
| ~ ! [X5] :
( p16(X5)
| ~ r1(X0,X5) ) ),
inference(pure_predicate_removal,[],[f7]) ).
fof(f7,plain,
? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| p15(X1) )
| ! [X3] : ~ r1(X0,X3)
| ~ ! [X6] :
( ~ r1(X0,X6)
| p14(X6) )
| ! [X8] :
( ~ r1(X0,X8)
| p12(X8) )
| ~ ! [X7] :
( ~ r1(X0,X7)
| p12(X7) )
| ! [X4] : ~ r1(X0,X4)
| ~ ! [X2] :
( ~ r1(X0,X2)
| p12(X2) )
| ~ ! [X5] :
( p16(X5)
| ~ r1(X0,X5) ) ),
inference(pure_predicate_removal,[],[f6]) ).
fof(f6,plain,
? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| p15(X1) )
| ! [X3] :
( ~ r1(X0,X3)
| p13(X3) )
| ~ ! [X6] :
( ~ r1(X0,X6)
| p14(X6) )
| ! [X8] :
( ~ r1(X0,X8)
| p12(X8) )
| ~ ! [X7] :
( ~ r1(X0,X7)
| p12(X7) )
| ! [X4] : ~ r1(X0,X4)
| ~ ! [X2] :
( ~ r1(X0,X2)
| p12(X2) )
| ~ ! [X5] :
( p16(X5)
| ~ r1(X0,X5) ) ),
inference(pure_predicate_removal,[],[f5]) ).
fof(f5,plain,
? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| p15(X1) )
| ! [X3] :
( ~ r1(X0,X3)
| p13(X3) )
| ~ ! [X6] :
( ~ r1(X0,X6)
| p14(X6) )
| ! [X8] :
( ~ r1(X0,X8)
| p12(X8) )
| ~ ! [X7] :
( ~ r1(X0,X7)
| p12(X7) )
| ! [X4] :
( ~ r1(X0,X4)
| p11(X4) )
| ~ ! [X2] :
( ~ r1(X0,X2)
| p12(X2) )
| ~ ! [X5] :
( p16(X5)
| ~ r1(X0,X5) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
~ ~ ? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| p15(X1) )
| ! [X3] :
( ~ r1(X0,X3)
| p13(X3) )
| ~ ! [X6] :
( ~ r1(X0,X6)
| p14(X6) )
| ! [X8] :
( ~ r1(X0,X8)
| p12(X8) )
| ~ ! [X7] :
( ~ r1(X0,X7)
| p12(X7) )
| ! [X4] :
( ~ r1(X0,X4)
| p11(X4) )
| ~ ! [X2] :
( ~ r1(X0,X2)
| p12(X2) )
| ~ ! [X5] :
( p16(X5)
| ~ r1(X0,X5) ) ),
inference(rectify,[],[f3]) ).
fof(f3,negated_conjecture,
~ ~ ? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| p15(X1) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| p12(X1) )
| ! [X1] :
( p13(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( ~ r1(X0,X1)
| p11(X1) )
| ~ ! [X1] :
( p16(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| p14(X1) )
| ~ ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( ~ r1(X0,X1)
| p12(X1) ) ),
inference(negated_conjecture,[],[f2]) ).
fof(f2,conjecture,
~ ? [X0] :
~ ( ! [X1] :
( ~ r1(X0,X1)
| p15(X1) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| p12(X1) )
| ! [X1] :
( p13(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( ~ r1(X0,X1)
| p11(X1) )
| ~ ! [X1] :
( p16(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| p14(X1) )
| ~ ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( ~ r1(X0,X1)
| p12(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
fof(f21,plain,
r1(sK0,sK4),
inference(cnf_transformation,[],[f18]) ).
fof(f22,plain,
~ p12(sK4),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL664+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.03/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 : n022.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 : Tue Aug 30 02:21:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 % (25564)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.47 % (25573)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.20/0.47 % (25564)First to succeed.
% 0.20/0.47 % (25564)Refutation found. Thanks to Tanya!
% 0.20/0.47 % SZS status Theorem for theBenchmark
% 0.20/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.47 % (25564)------------------------------
% 0.20/0.47 % (25564)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.47 % (25564)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.47 % (25564)Termination reason: Refutation
% 0.20/0.47
% 0.20/0.47 % (25564)Memory used [KB]: 5884
% 0.20/0.47 % (25564)Time elapsed: 0.056 s
% 0.20/0.47 % (25564)Instructions burned: 2 (million)
% 0.20/0.47 % (25564)------------------------------
% 0.20/0.47 % (25564)------------------------------
% 0.20/0.47 % (25552)Success in time 0.126 s
%------------------------------------------------------------------------------