TSTP Solution File: KLE151+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : KLE151+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n002.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 : Tue Apr 30 13:12:03 EDT 2024
% Result : Theorem 47.45s 7.20s
% Output : Refutation 47.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 35 ( 28 unt; 0 def)
% Number of atoms : 44 ( 22 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 26 ( 17 ~; 5 |; 1 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 52 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f434598,plain,
$false,
inference(subsumption_resolution,[],[f434597,f35]) ).
fof(f35,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence) ).
fof(f434597,plain,
multiplication(sK0,strong_iteration(multiplication(sK1,sK0))) != addition(multiplication(sK0,strong_iteration(multiplication(sK1,sK0))),multiplication(sK0,strong_iteration(multiplication(sK1,sK0)))),
inference(forward_demodulation,[],[f434596,f324981]) ).
fof(f324981,plain,
! [X2,X0,X1] : multiplication(X2,strong_iteration(multiplication(X0,X1))) = addition(X2,multiplication(X2,multiplication(X0,multiplication(X1,strong_iteration(multiplication(X0,X1)))))),
inference(superposition,[],[f20455,f1045]) ).
fof(f1045,plain,
! [X0,X1] : strong_iteration(multiplication(X0,X1)) = addition(multiplication(X0,multiplication(X1,strong_iteration(multiplication(X0,X1)))),one),
inference(superposition,[],[f38,f44]) ).
fof(f44,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_associativity) ).
fof(f38,plain,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
inference(cnf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',infty_unfold1) ).
fof(f20455,plain,
! [X0,X1] : multiplication(X1,addition(X0,one)) = addition(X1,multiplication(X1,X0)),
inference(superposition,[],[f13215,f40]) ).
fof(f40,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(f13215,plain,
! [X0,X1] : multiplication(X0,addition(one,X1)) = addition(X0,multiplication(X0,X1)),
inference(superposition,[],[f45,f33]) ).
fof(f33,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_right_identity) ).
fof(f45,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distributivity1) ).
fof(f434596,plain,
addition(sK0,multiplication(sK0,multiplication(sK1,multiplication(sK0,strong_iteration(multiplication(sK1,sK0)))))) != addition(multiplication(sK0,strong_iteration(multiplication(sK1,sK0))),addition(sK0,multiplication(sK0,multiplication(sK1,multiplication(sK0,strong_iteration(multiplication(sK1,sK0))))))),
inference(unit_resulting_resolution,[],[f21920,f42]) ).
fof(f42,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( ( leq(X0,X1)
| addition(X0,X1) != X1 )
& ( addition(X0,X1) = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).
fof(f21920,plain,
~ leq(multiplication(sK0,strong_iteration(multiplication(sK1,sK0))),addition(sK0,multiplication(sK0,multiplication(sK1,multiplication(sK0,strong_iteration(multiplication(sK1,sK0))))))),
inference(forward_demodulation,[],[f21919,f44]) ).
fof(f21919,plain,
~ leq(multiplication(sK0,strong_iteration(multiplication(sK1,sK0))),addition(sK0,multiplication(multiplication(sK0,sK1),multiplication(sK0,strong_iteration(multiplication(sK1,sK0)))))),
inference(forward_demodulation,[],[f21775,f40]) ).
fof(f21775,plain,
~ leq(multiplication(sK0,strong_iteration(multiplication(sK1,sK0))),addition(multiplication(multiplication(sK0,sK1),multiplication(sK0,strong_iteration(multiplication(sK1,sK0)))),sK0)),
inference(unit_resulting_resolution,[],[f30,f47]) ).
fof(f47,plain,
! [X2,X0,X1] :
( ~ leq(X2,addition(multiplication(X0,X2),X1))
| leq(X2,multiplication(strong_iteration(X0),X1)) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( leq(X2,multiplication(strong_iteration(X0),X1))
| ~ leq(X2,addition(multiplication(X0,X2),X1)) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0,X1,X2] :
( leq(X2,addition(multiplication(X0,X2),X1))
=> leq(X2,multiplication(strong_iteration(X0),X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',infty_coinduction) ).
fof(f30,plain,
~ leq(multiplication(sK0,strong_iteration(multiplication(sK1,sK0))),multiplication(strong_iteration(multiplication(sK0,sK1)),sK0)),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
~ leq(multiplication(sK0,strong_iteration(multiplication(sK1,sK0))),multiplication(strong_iteration(multiplication(sK0,sK1)),sK0)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f23,f27]) ).
fof(f27,plain,
( ? [X0,X1] : ~ leq(multiplication(X0,strong_iteration(multiplication(X1,X0))),multiplication(strong_iteration(multiplication(X0,X1)),X0))
=> ~ leq(multiplication(sK0,strong_iteration(multiplication(sK1,sK0))),multiplication(strong_iteration(multiplication(sK0,sK1)),sK0)) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
? [X0,X1] : ~ leq(multiplication(X0,strong_iteration(multiplication(X1,X0))),multiplication(strong_iteration(multiplication(X0,X1)),X0)),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
~ ! [X0,X1] : leq(multiplication(X0,strong_iteration(multiplication(X1,X0))),multiplication(strong_iteration(multiplication(X0,X1)),X0)),
inference(rectify,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X3,X4] : leq(multiplication(X3,strong_iteration(multiplication(X4,X3))),multiplication(strong_iteration(multiplication(X3,X4)),X3)),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X3,X4] : leq(multiplication(X3,strong_iteration(multiplication(X4,X3))),multiplication(strong_iteration(multiplication(X3,X4)),X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE151+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n002.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 Apr 30 05:18:55 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % (32669)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.36 % (32671)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.36 % (32673)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.36 % (32672)WARNING: value z3 for option sas not known
% 0.13/0.36 % (32670)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.36 % (32676)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.13/0.36 % (32672)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.36 % (32675)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.13/0.36 % (32674)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.13/0.36 TRYING [1]
% 0.13/0.36 TRYING [2]
% 0.13/0.36 TRYING [3]
% 0.13/0.36 TRYING [1]
% 0.13/0.37 TRYING [2]
% 0.13/0.37 TRYING [4]
% 0.13/0.38 TRYING [3]
% 0.19/0.41 TRYING [5]
% 0.19/0.42 TRYING [4]
% 0.19/0.52 TRYING [6]
% 0.19/0.56 TRYING [5]
% 3.13/0.82 TRYING [7]
% 6.30/1.29 TRYING [6]
% 7.82/1.46 TRYING [1]
% 7.82/1.47 TRYING [2]
% 7.82/1.47 TRYING [3]
% 7.82/1.49 TRYING [4]
% 8.41/1.56 TRYING [5]
% 9.37/1.69 TRYING [6]
% 10.49/1.85 TRYING [8]
% 13.19/2.28 TRYING [7]
% 27.91/4.33 TRYING [8]
% 28.57/4.47 TRYING [9]
% 46.54/7.04 TRYING [7]
% 47.45/7.19 % (32676)First to succeed.
% 47.45/7.20 % (32676)Refutation found. Thanks to Tanya!
% 47.45/7.20 % SZS status Theorem for theBenchmark
% 47.45/7.20 % SZS output start Proof for theBenchmark
% See solution above
% 47.45/7.20 % (32676)------------------------------
% 47.45/7.20 % (32676)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 47.45/7.20 % (32676)Termination reason: Refutation
% 47.45/7.20
% 47.45/7.20 % (32676)Memory used [KB]: 56926
% 47.45/7.20 % (32676)Time elapsed: 6.827 s
% 47.45/7.20 % (32676)Instructions burned: 14214 (million)
% 47.45/7.20 % (32676)------------------------------
% 47.45/7.20 % (32676)------------------------------
% 47.45/7.20 % (32669)Success in time 6.838 s
%------------------------------------------------------------------------------