TSTP Solution File: LCL646+1.001 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : LCL646+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 : n006.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:43:38 EDT 2022
% Result : Theorem 1.51s 0.57s
% Output : Refutation 1.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 187 ( 0 equ)
% Maximal formula atoms : 18 ( 8 avg)
% Number of connectives : 300 ( 135 ~; 128 |; 32 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 8 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(f29,plain,
$false,
inference(subsumption_resolution,[],[f25,f23]) ).
fof(f23,plain,
~ p2(sK1),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
( r1(sK0,sK1)
& ~ p2(sK1)
& ! [X2] :
( ~ r1(sK0,X2)
| p2(X2) )
& ! [X3] :
( p2(X3)
| ~ r1(sK0,X3) )
& r1(sK0,sK2)
& r1(sK0,sK3)
& r1(sK0,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f11,f16,f15,f14,f13,f12]) ).
fof(f12,plain,
( ? [X0] :
( ? [X1] :
( r1(X0,X1)
& ~ p2(X1) )
& ! [X2] :
( ~ r1(X0,X2)
| p2(X2) )
& ! [X3] :
( p2(X3)
| ~ r1(X0,X3) )
& ? [X4] : r1(X0,X4)
& ? [X5] : r1(X0,X5)
& ? [X6] : r1(X0,X6) )
=> ( ? [X1] :
( r1(sK0,X1)
& ~ p2(X1) )
& ! [X2] :
( ~ r1(sK0,X2)
| p2(X2) )
& ! [X3] :
( p2(X3)
| ~ r1(sK0,X3) )
& ? [X4] : r1(sK0,X4)
& ? [X5] : r1(sK0,X5)
& ? [X6] : r1(sK0,X6) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
( ? [X1] :
( r1(sK0,X1)
& ~ p2(X1) )
=> ( r1(sK0,sK1)
& ~ p2(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
( ? [X4] : r1(sK0,X4)
=> r1(sK0,sK2) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( ? [X5] : r1(sK0,X5)
=> r1(sK0,sK3) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ? [X6] : r1(sK0,X6)
=> r1(sK0,sK4) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0] :
( ? [X1] :
( r1(X0,X1)
& ~ p2(X1) )
& ! [X2] :
( ~ r1(X0,X2)
| p2(X2) )
& ! [X3] :
( p2(X3)
| ~ r1(X0,X3) )
& ? [X4] : r1(X0,X4)
& ? [X5] : r1(X0,X5)
& ? [X6] : r1(X0,X6) ),
inference(rectify,[],[f10]) ).
fof(f10,plain,
? [X0] :
( ? [X6] :
( r1(X0,X6)
& ~ p2(X6) )
& ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
& ! [X4] :
( p2(X4)
| ~ r1(X0,X4) )
& ? [X7] : r1(X0,X7)
& ? [X2] : r1(X0,X2)
& ? [X3] : r1(X0,X3) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,plain,
? [X0] :
~ ( ! [X7] : ~ r1(X0,X7)
| ! [X3] : ~ r1(X0,X3)
| ! [X2] : ~ r1(X0,X2)
| ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ! [X4] :
( p2(X4)
| ~ r1(X0,X4) )
| ! [X6] :
( p2(X6)
| ~ r1(X0,X6) ) ),
inference(pure_predicate_removal,[],[f8]) ).
fof(f8,plain,
? [X0] :
~ ( ! [X7] : ~ r1(X0,X7)
| ! [X3] : ~ r1(X0,X3)
| ! [X2] : ~ r1(X0,X2)
| ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ! [X4] :
( p2(X4)
| ~ r1(X0,X4) )
| ! [X6] :
( p2(X6)
| ~ r1(X0,X6) )
| ~ ! [X5] :
( p6(X5)
| ~ r1(X0,X5) ) ),
inference(pure_predicate_removal,[],[f7]) ).
fof(f7,plain,
? [X0] :
~ ( ~ ! [X8] :
( ~ r1(X0,X8)
| p4(X8) )
| ! [X7] : ~ r1(X0,X7)
| ! [X3] : ~ r1(X0,X3)
| ! [X2] : ~ r1(X0,X2)
| ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ! [X4] :
( p2(X4)
| ~ r1(X0,X4) )
| ! [X6] :
( p2(X6)
| ~ r1(X0,X6) )
| ~ ! [X5] :
( p6(X5)
| ~ r1(X0,X5) ) ),
inference(pure_predicate_removal,[],[f6]) ).
fof(f6,plain,
? [X0] :
~ ( ~ ! [X8] :
( ~ r1(X0,X8)
| p4(X8) )
| ! [X7] : ~ r1(X0,X7)
| ! [X3] : ~ r1(X0,X3)
| ! [X2] :
( ~ r1(X0,X2)
| p5(X2) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ! [X4] :
( p2(X4)
| ~ r1(X0,X4) )
| ! [X6] :
( p2(X6)
| ~ r1(X0,X6) )
| ~ ! [X5] :
( p6(X5)
| ~ r1(X0,X5) ) ),
inference(pure_predicate_removal,[],[f5]) ).
fof(f5,plain,
? [X0] :
~ ( ~ ! [X8] :
( ~ r1(X0,X8)
| p4(X8) )
| ! [X7] : ~ r1(X0,X7)
| ! [X3] :
( p3(X3)
| ~ r1(X0,X3) )
| ! [X2] :
( ~ r1(X0,X2)
| p5(X2) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ! [X4] :
( p2(X4)
| ~ r1(X0,X4) )
| ! [X6] :
( p2(X6)
| ~ r1(X0,X6) )
| ~ ! [X5] :
( p6(X5)
| ~ r1(X0,X5) ) ),
inference(pure_predicate_removal,[],[f4]) ).
fof(f4,plain,
? [X0] :
~ ( ~ ! [X8] :
( ~ r1(X0,X8)
| p4(X8) )
| ! [X7] :
( ~ r1(X0,X7)
| p1(X7) )
| ! [X3] :
( p3(X3)
| ~ r1(X0,X3) )
| ! [X2] :
( ~ r1(X0,X2)
| p5(X2) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ! [X4] :
( p2(X4)
| ~ r1(X0,X4) )
| ! [X6] :
( p2(X6)
| ~ r1(X0,X6) )
| ~ ! [X5] :
( p6(X5)
| ~ r1(X0,X5) ) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
~ ~ ? [X0] :
~ ( ~ ! [X8] :
( ~ r1(X0,X8)
| p4(X8) )
| ! [X7] :
( ~ r1(X0,X7)
| p1(X7) )
| ! [X3] :
( p3(X3)
| ~ r1(X0,X3) )
| ! [X2] :
( ~ r1(X0,X2)
| p5(X2) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ! [X4] :
( p2(X4)
| ~ r1(X0,X4) )
| ! [X6] :
( p2(X6)
| ~ r1(X0,X6) )
| ~ ! [X5] :
( p6(X5)
| ~ r1(X0,X5) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ~ ? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ! [X1] :
( p5(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p3(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| p6(X1) )
| ! [X1] :
( p2(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( ~ r1(X0,X1)
| p1(X1) )
| ~ ! [X1] :
( p4(X1)
| ~ r1(X0,X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
~ ? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ! [X1] :
( p5(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p3(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ! [X1] :
( ~ r1(X0,X1)
| p6(X1) )
| ! [X1] :
( p2(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( ~ r1(X0,X1)
| p1(X1) )
| ~ ! [X1] :
( p4(X1)
| ~ r1(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(f25,plain,
p2(sK1),
inference(resolution,[],[f21,f24]) ).
fof(f24,plain,
r1(sK0,sK1),
inference(cnf_transformation,[],[f17]) ).
fof(f21,plain,
! [X3] :
( ~ r1(sK0,X3)
| p2(X3) ),
inference(cnf_transformation,[],[f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL646+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 : n006.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:13:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.51/0.56 % (29851)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.51/0.57 % (29859)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.51/0.57 % (29851)First to succeed.
% 1.51/0.57 % (29845)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 1.51/0.57 % (29851)Refutation found. Thanks to Tanya!
% 1.51/0.57 % SZS status Theorem for theBenchmark
% 1.51/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 1.51/0.57 % (29851)------------------------------
% 1.51/0.57 % (29851)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.51/0.57 % (29851)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.51/0.57 % (29851)Termination reason: Refutation
% 1.51/0.57
% 1.51/0.57 % (29851)Memory used [KB]: 5884
% 1.51/0.57 % (29851)Time elapsed: 0.138 s
% 1.51/0.57 % (29851)Instructions burned: 2 (million)
% 1.51/0.57 % (29851)------------------------------
% 1.51/0.57 % (29851)------------------------------
% 1.51/0.57 % (29844)Success in time 0.221 s
%------------------------------------------------------------------------------