TSTP Solution File: KLE035+2 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : KLE035+2 : 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 : n014.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:54 EDT 2022
% Result : Theorem 0.20s 0.58s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 44 ( 33 unt; 0 def)
% Number of atoms : 86 ( 24 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 61 ( 19 ~; 3 |; 34 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 76 ( 60 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f103,plain,
$false,
inference(subsumption_resolution,[],[f102,f85]) ).
fof(f85,plain,
leq(multiplication(sK1,multiplication(sK0,c(sK3))),zero),
inference(backward_demodulation,[],[f62,f74]) ).
fof(f74,plain,
! [X2,X0,X1] : multiplication(multiplication(X2,X1),X0) = multiplication(X2,multiplication(X1,X0)),
inference(cnf_transformation,[],[f48]) ).
fof(f48,plain,
! [X0,X1,X2] : multiplication(multiplication(X2,X1),X0) = multiplication(X2,multiplication(X1,X0)),
inference(rectify,[],[f23]) ).
fof(f23,plain,
! [X1,X2,X0] : multiplication(X0,multiplication(X2,X1)) = multiplication(multiplication(X0,X2),X1),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X0,X2,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_associativity) ).
fof(f62,plain,
leq(multiplication(multiplication(sK1,sK0),c(sK3)),zero),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
( leq(multiplication(multiplication(sK1,sK0),c(sK3)),zero)
& test(sK1)
& test(sK3)
& ~ leq(multiplication(multiplication(sK1,addition(sK2,sK0)),c(sK3)),zero)
& leq(multiplication(multiplication(sK1,sK2),c(sK3)),zero) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f41,f42]) ).
fof(f42,plain,
( ? [X0,X1,X2,X3] :
( leq(multiplication(multiplication(X1,X0),c(X3)),zero)
& test(X1)
& test(X3)
& ~ leq(multiplication(multiplication(X1,addition(X2,X0)),c(X3)),zero)
& leq(multiplication(multiplication(X1,X2),c(X3)),zero) )
=> ( leq(multiplication(multiplication(sK1,sK0),c(sK3)),zero)
& test(sK1)
& test(sK3)
& ~ leq(multiplication(multiplication(sK1,addition(sK2,sK0)),c(sK3)),zero)
& leq(multiplication(multiplication(sK1,sK2),c(sK3)),zero) ) ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
? [X0,X1,X2,X3] :
( leq(multiplication(multiplication(X1,X0),c(X3)),zero)
& test(X1)
& test(X3)
& ~ leq(multiplication(multiplication(X1,addition(X2,X0)),c(X3)),zero)
& leq(multiplication(multiplication(X1,X2),c(X3)),zero) ),
inference(rectify,[],[f39]) ).
fof(f39,plain,
? [X0,X1,X3,X2] :
( leq(multiplication(multiplication(X1,X0),c(X2)),zero)
& test(X1)
& test(X2)
& ~ leq(multiplication(multiplication(X1,addition(X3,X0)),c(X2)),zero)
& leq(multiplication(multiplication(X1,X3),c(X2)),zero) ),
inference(flattening,[],[f38]) ).
fof(f38,plain,
? [X3,X1,X0,X2] :
( ~ leq(multiplication(multiplication(X1,addition(X3,X0)),c(X2)),zero)
& leq(multiplication(multiplication(X1,X3),c(X2)),zero)
& test(X1)
& test(X2)
& leq(multiplication(multiplication(X1,X0),c(X2)),zero) ),
inference(ennf_transformation,[],[f30]) ).
fof(f30,plain,
~ ! [X3,X1,X0,X2] :
( ( leq(multiplication(multiplication(X1,X3),c(X2)),zero)
& test(X1)
& test(X2)
& leq(multiplication(multiplication(X1,X0),c(X2)),zero) )
=> leq(multiplication(multiplication(X1,addition(X3,X0)),c(X2)),zero) ),
inference(rectify,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X4,X5,X6,X3] :
( ( test(X5)
& test(X6)
& leq(multiplication(multiplication(X5,X3),c(X6)),zero)
& leq(multiplication(multiplication(X5,X4),c(X6)),zero) )
=> leq(multiplication(multiplication(X5,addition(X3,X4)),c(X6)),zero) ),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X4,X5,X6,X3] :
( ( test(X5)
& test(X6)
& leq(multiplication(multiplication(X5,X3),c(X6)),zero)
& leq(multiplication(multiplication(X5,X4),c(X6)),zero) )
=> leq(multiplication(multiplication(X5,addition(X3,X4)),c(X6)),zero) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f102,plain,
~ leq(multiplication(sK1,multiplication(sK0,c(sK3))),zero),
inference(forward_demodulation,[],[f101,f92]) ).
fof(f92,plain,
! [X0] : addition(zero,X0) = X0,
inference(superposition,[],[f56,f68]) ).
fof(f68,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_identity) ).
fof(f56,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f101,plain,
~ leq(addition(zero,multiplication(sK1,multiplication(sK0,c(sK3)))),zero),
inference(forward_demodulation,[],[f99,f56]) ).
fof(f99,plain,
~ leq(addition(multiplication(sK1,multiplication(sK0,c(sK3))),zero),zero),
inference(backward_demodulation,[],[f90,f98]) ).
fof(f98,plain,
zero = multiplication(sK1,multiplication(sK2,c(sK3))),
inference(forward_demodulation,[],[f97,f92]) ).
fof(f97,plain,
zero = addition(zero,multiplication(sK1,multiplication(sK2,c(sK3)))),
inference(forward_demodulation,[],[f96,f56]) ).
fof(f96,plain,
zero = addition(multiplication(sK1,multiplication(sK2,c(sK3))),zero),
inference(resolution,[],[f80,f86]) ).
fof(f86,plain,
leq(multiplication(sK1,multiplication(sK2,c(sK3))),zero),
inference(forward_demodulation,[],[f58,f74]) ).
fof(f58,plain,
leq(multiplication(multiplication(sK1,sK2),c(sK3)),zero),
inference(cnf_transformation,[],[f43]) ).
fof(f80,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0,X1] :
( ( leq(X0,X1)
| addition(X0,X1) != X1 )
& ( addition(X0,X1) = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).
fof(f90,plain,
~ leq(addition(multiplication(sK1,multiplication(sK0,c(sK3))),multiplication(sK1,multiplication(sK2,c(sK3)))),zero),
inference(forward_demodulation,[],[f89,f56]) ).
fof(f89,plain,
~ leq(addition(multiplication(sK1,multiplication(sK2,c(sK3))),multiplication(sK1,multiplication(sK0,c(sK3)))),zero),
inference(forward_demodulation,[],[f88,f69]) ).
fof(f69,plain,
! [X2,X0,X1] : addition(multiplication(X1,X0),multiplication(X1,X2)) = multiplication(X1,addition(X0,X2)),
inference(cnf_transformation,[],[f46]) ).
fof(f46,plain,
! [X0,X1,X2] : addition(multiplication(X1,X0),multiplication(X1,X2)) = multiplication(X1,addition(X0,X2)),
inference(rectify,[],[f26]) ).
fof(f26,plain,
! [X2,X0,X1] : addition(multiplication(X0,X2),multiplication(X0,X1)) = multiplication(X0,addition(X2,X1)),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X0,X2,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_distributivity) ).
fof(f88,plain,
~ leq(multiplication(sK1,addition(multiplication(sK2,c(sK3)),multiplication(sK0,c(sK3)))),zero),
inference(forward_demodulation,[],[f87,f71]) ).
fof(f71,plain,
! [X2,X0,X1] : addition(multiplication(X2,X0),multiplication(X1,X0)) = multiplication(addition(X2,X1),X0),
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0,X1,X2] : addition(multiplication(X2,X0),multiplication(X1,X0)) = multiplication(addition(X2,X1),X0),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X2,X1,X0] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_distributivity) ).
fof(f87,plain,
~ leq(multiplication(sK1,multiplication(addition(sK2,sK0),c(sK3))),zero),
inference(forward_demodulation,[],[f59,f74]) ).
fof(f59,plain,
~ leq(multiplication(multiplication(sK1,addition(sK2,sK0)),c(sK3)),zero),
inference(cnf_transformation,[],[f43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : KLE035+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.14 % 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.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 00:24:18 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.55 % (2644)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.20/0.55 % (2644)Instruction limit reached!
% 0.20/0.55 % (2644)------------------------------
% 0.20/0.55 % (2644)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (2644)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (2644)Termination reason: Unknown
% 0.20/0.55 % (2644)Termination phase: Equality resolution with deletion
% 0.20/0.55
% 0.20/0.55 % (2644)Memory used [KB]: 895
% 0.20/0.55 % (2644)Time elapsed: 0.003 s
% 0.20/0.55 % (2644)Instructions burned: 2 (million)
% 0.20/0.55 % (2644)------------------------------
% 0.20/0.55 % (2644)------------------------------
% 0.20/0.56 % (2636)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.56 % (2639)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.56 TRYING [1]
% 0.20/0.56 TRYING [2]
% 0.20/0.57 % (2643)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.57 % (2658)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.57 % (2659)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.57 TRYING [3]
% 0.20/0.58 % (2659)First to succeed.
% 0.20/0.58 % (2659)Refutation found. Thanks to Tanya!
% 0.20/0.58 % SZS status Theorem for theBenchmark
% 0.20/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.58 % (2659)------------------------------
% 0.20/0.58 % (2659)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.58 % (2659)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.58 % (2659)Termination reason: Refutation
% 0.20/0.58
% 0.20/0.58 % (2659)Memory used [KB]: 5500
% 0.20/0.58 % (2659)Time elapsed: 0.102 s
% 0.20/0.58 % (2659)Instructions burned: 3 (million)
% 0.20/0.58 % (2659)------------------------------
% 0.20/0.58 % (2659)------------------------------
% 0.20/0.58 % (2635)Success in time 0.223 s
%------------------------------------------------------------------------------