TSTP Solution File: KLE006+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : KLE006+1 : 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_sat --cores 0 -t %d %s
% Computer : n004.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:28:43 EDT 2022
% Result : Theorem 0.17s 0.49s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 83 ( 47 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 88 ( 33 ~; 25 |; 19 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 36 ( 34 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f91,plain,
$false,
inference(trivial_inequality_removal,[],[f90]) ).
fof(f90,plain,
one != one,
inference(superposition,[],[f48,f87]) ).
fof(f87,plain,
one = addition(sK0,c(sK0)),
inference(resolution,[],[f75,f49]) ).
fof(f49,plain,
test(sK0),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
( test(sK0)
& one != addition(sK0,c(sK0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f31,f34]) ).
fof(f34,plain,
( ? [X0] :
( test(X0)
& one != addition(X0,c(X0)) )
=> ( test(sK0)
& one != addition(sK0,c(sK0)) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
? [X0] :
( test(X0)
& one != addition(X0,c(X0)) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
~ ! [X0] :
( test(X0)
=> one = addition(X0,c(X0)) ),
inference(rectify,[],[f18]) ).
fof(f18,negated_conjecture,
~ ! [X3] :
( test(X3)
=> one = addition(X3,c(X3)) ),
inference(negated_conjecture,[],[f17]) ).
fof(f17,conjecture,
! [X3] :
( test(X3)
=> one = addition(X3,c(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f75,plain,
! [X1] :
( ~ test(X1)
| one = addition(X1,c(X1)) ),
inference(forward_demodulation,[],[f74,f55]) ).
fof(f55,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f74,plain,
! [X1] :
( ~ test(X1)
| one = addition(c(X1),X1) ),
inference(resolution,[],[f62,f68]) ).
fof(f68,plain,
! [X0] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[],[f47]) ).
fof(f47,plain,
! [X0,X1] :
( ~ test(X0)
| complement(X0,X1)
| c(X0) != X1 ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ~ test(X0)
| ( ( complement(X0,X1)
| c(X0) != X1 )
& ( c(X0) = X1
| ~ complement(X0,X1) ) ) ),
inference(rectify,[],[f32]) ).
fof(f32,plain,
! [X1,X0] :
( ~ test(X1)
| ( ( complement(X1,X0)
| c(X1) != X0 )
& ( c(X1) = X0
| ~ complement(X1,X0) ) ) ),
inference(nnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X1,X0] :
( ~ test(X1)
| ( complement(X1,X0)
<=> c(X1) = X0 ) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( test(X1)
=> ( complement(X1,X0)
<=> c(X1) = X0 ) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X4,X3] :
( test(X3)
=> ( complement(X3,X4)
<=> c(X3) = X4 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_3) ).
fof(f62,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| addition(X0,X1) = one ),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0,X1] :
( ( ( zero = multiplication(X1,X0)
& zero = multiplication(X0,X1)
& addition(X0,X1) = one )
| ~ complement(X1,X0) )
& ( complement(X1,X0)
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1)
| addition(X0,X1) != one ) ),
inference(rectify,[],[f43]) ).
fof(f43,plain,
! [X1,X0] :
( ( ( zero = multiplication(X0,X1)
& zero = multiplication(X1,X0)
& addition(X1,X0) = one )
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| zero != multiplication(X0,X1)
| zero != multiplication(X1,X0)
| addition(X1,X0) != one ) ),
inference(flattening,[],[f42]) ).
fof(f42,plain,
! [X1,X0] :
( ( ( zero = multiplication(X0,X1)
& zero = multiplication(X1,X0)
& addition(X1,X0) = one )
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| zero != multiplication(X0,X1)
| zero != multiplication(X1,X0)
| addition(X1,X0) != one ) ),
inference(nnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X1,X0] :
( ( zero = multiplication(X0,X1)
& zero = multiplication(X1,X0)
& addition(X1,X0) = one )
<=> complement(X0,X1) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X4,X3] :
( ( one = addition(X3,X4)
& zero = multiplication(X3,X4)
& zero = multiplication(X4,X3) )
<=> complement(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_2) ).
fof(f48,plain,
one != addition(sK0,c(sK0)),
inference(cnf_transformation,[],[f35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KLE006+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.11/0.33 % Computer : n004.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue Aug 30 00:17:50 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.17/0.48 % (27464)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.17/0.48 % (27466)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.17/0.48 % (27465)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.17/0.48 % (27483)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.17/0.49 % (27472)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.17/0.49 % (27466)First to succeed.
% 0.17/0.49 % (27466)Refutation found. Thanks to Tanya!
% 0.17/0.49 % SZS status Theorem for theBenchmark
% 0.17/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.49 % (27466)------------------------------
% 0.17/0.49 % (27466)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.49 % (27466)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.49 % (27466)Termination reason: Refutation
% 0.17/0.49
% 0.17/0.49 % (27466)Memory used [KB]: 895
% 0.17/0.49 % (27466)Time elapsed: 0.105 s
% 0.17/0.49 % (27466)Instructions burned: 3 (million)
% 0.17/0.49 % (27466)------------------------------
% 0.17/0.49 % (27466)------------------------------
% 0.17/0.49 % (27456)Success in time 0.156 s
%------------------------------------------------------------------------------