TSTP Solution File: KLE140+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : KLE140+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 : n012.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:01 EDT 2024
% Result : Theorem 9.94s 1.77s
% Output : Refutation 9.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 42 ( 28 unt; 0 def)
% Number of atoms : 60 ( 22 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 32 ( 14 ~; 7 |; 5 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 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 : 70 ( 66 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f145193,plain,
$false,
inference(subsumption_resolution,[],[f145192,f31]) ).
fof(f31,plain,
~ leq(strong_iteration(sK0),strong_iteration(sK1)),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
( ~ leq(strong_iteration(sK0),strong_iteration(sK1))
& leq(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f23,f27]) ).
fof(f27,plain,
( ? [X0,X1] :
( ~ leq(strong_iteration(X0),strong_iteration(X1))
& leq(X0,X1) )
=> ( ~ leq(strong_iteration(sK0),strong_iteration(sK1))
& leq(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
? [X0,X1] :
( ~ leq(strong_iteration(X0),strong_iteration(X1))
& leq(X0,X1) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
~ ! [X0,X1] :
( leq(X0,X1)
=> leq(strong_iteration(X0),strong_iteration(X1)) ),
inference(rectify,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X3,X4] :
( leq(X3,X4)
=> leq(strong_iteration(X3),strong_iteration(X4)) ),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X3,X4] :
( leq(X3,X4)
=> leq(strong_iteration(X3),strong_iteration(X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f145192,plain,
leq(strong_iteration(sK0),strong_iteration(sK1)),
inference(forward_demodulation,[],[f144902,f34]) ).
fof(f34,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_right_identity) ).
fof(f144902,plain,
leq(strong_iteration(sK0),multiplication(strong_iteration(sK1),one)),
inference(unit_resulting_resolution,[],[f12294,f6986]) ).
fof(f6986,plain,
! [X2,X0,X1] :
( ~ leq(X1,addition(X2,multiplication(X0,X1)))
| leq(X1,multiplication(strong_iteration(X0),X2)) ),
inference(superposition,[],[f48,f41]) ).
fof(f41,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/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f48,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/sandbox/benchmark/theBenchmark.p',infty_coinduction) ).
fof(f12294,plain,
leq(strong_iteration(sK0),addition(one,multiplication(sK1,strong_iteration(sK0)))),
inference(superposition,[],[f6511,f138]) ).
fof(f138,plain,
! [X0] : strong_iteration(X0) = addition(one,multiplication(X0,strong_iteration(X0))),
inference(superposition,[],[f39,f41]) ).
fof(f39,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/sandbox/benchmark/theBenchmark.p',infty_unfold1) ).
fof(f6511,plain,
! [X0,X1] : leq(addition(X1,multiplication(sK0,X0)),addition(X1,multiplication(sK1,X0))),
inference(superposition,[],[f384,f5782]) ).
fof(f5782,plain,
! [X0] : multiplication(sK1,X0) = addition(multiplication(sK0,X0),multiplication(sK1,X0)),
inference(unit_resulting_resolution,[],[f5740,f42]) ).
fof(f42,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X0,X1) = 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/sandbox/benchmark/theBenchmark.p',order) ).
fof(f5740,plain,
! [X0] : leq(multiplication(sK0,X0),multiplication(sK1,X0)),
inference(superposition,[],[f5465,f59]) ).
fof(f59,plain,
sK1 = addition(sK0,sK1),
inference(unit_resulting_resolution,[],[f30,f42]) ).
fof(f30,plain,
leq(sK0,sK1),
inference(cnf_transformation,[],[f28]) ).
fof(f5465,plain,
! [X2,X0,X1] : leq(multiplication(X0,X1),multiplication(addition(X0,X2),X1)),
inference(superposition,[],[f338,f47]) ).
fof(f47,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distributivity2) ).
fof(f338,plain,
! [X0,X1] : leq(X0,addition(X0,X1)),
inference(unit_resulting_resolution,[],[f190,f43]) ).
fof(f43,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f190,plain,
! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
inference(superposition,[],[f44,f36]) ).
fof(f36,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence) ).
fof(f44,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X2,X1,X0] : addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_associativity) ).
fof(f384,plain,
! [X2,X0,X1] : leq(addition(X0,X1),addition(X0,addition(X1,X2))),
inference(superposition,[],[f338,f44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KLE140+1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 04:56:11 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % (27849)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.36 % (27855)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.14/0.37 % (27852)WARNING: value z3 for option sas not known
% 0.14/0.37 % (27853)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.37 % (27851)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.37 % (27850)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.37 % (27852)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.14/0.37 % (27854)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.14/0.37 % (27856)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.14/0.37 TRYING [1]
% 0.14/0.37 TRYING [2]
% 0.14/0.37 TRYING [3]
% 0.21/0.38 TRYING [1]
% 0.21/0.38 TRYING [2]
% 0.21/0.39 TRYING [4]
% 0.21/0.40 TRYING [3]
% 0.21/0.43 TRYING [5]
% 0.21/0.44 TRYING [4]
% 0.21/0.52 TRYING [6]
% 1.47/0.58 TRYING [5]
% 2.42/0.70 TRYING [7]
% 3.56/0.90 TRYING [6]
% 5.23/1.11 TRYING [8]
% 7.85/1.47 TRYING [1]
% 7.85/1.47 TRYING [2]
% 7.85/1.47 TRYING [3]
% 7.85/1.48 TRYING [4]
% 8.34/1.53 TRYING [5]
% 8.66/1.64 TRYING [6]
% 9.94/1.77 % (27856)First to succeed.
% 9.94/1.77 % (27856)Refutation found. Thanks to Tanya!
% 9.94/1.77 % SZS status Theorem for theBenchmark
% 9.94/1.77 % SZS output start Proof for theBenchmark
% See solution above
% 9.94/1.77 % (27856)------------------------------
% 9.94/1.77 % (27856)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 9.94/1.77 % (27856)Termination reason: Refutation
% 9.94/1.77
% 9.94/1.77 % (27856)Memory used [KB]: 23727
% 9.94/1.77 % (27856)Time elapsed: 1.402 s
% 9.94/1.77 % (27856)Instructions burned: 4463 (million)
% 9.94/1.77 % (27856)------------------------------
% 9.94/1.77 % (27856)------------------------------
% 9.94/1.77 % (27849)Success in time 1.388 s
%------------------------------------------------------------------------------