TSTP Solution File: KLE148+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : KLE148+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 : n023.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 0.12s 0.37s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 31 ( 25 unt; 0 def)
% Number of atoms : 39 ( 38 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 16 ( 8 ~; 0 |; 4 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 41 ( 37 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f422,plain,
$false,
inference(trivial_inequality_removal,[],[f418]) ).
fof(f418,plain,
sK0 != sK0,
inference(superposition,[],[f31,f409]) ).
fof(f409,plain,
sK0 = multiplication(sK0,strong_iteration(sK1)),
inference(forward_demodulation,[],[f399,f34]) ).
fof(f34,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(f399,plain,
multiplication(sK0,strong_iteration(sK1)) = multiplication(sK0,one),
inference(superposition,[],[f361,f37]) ).
fof(f37,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(f361,plain,
! [X0,X1] : multiplication(sK0,addition(multiplication(sK1,X0),X1)) = multiplication(sK0,X1),
inference(forward_demodulation,[],[f335,f51]) ).
fof(f51,plain,
! [X0] : addition(zero,X0) = X0,
inference(superposition,[],[f41,f33]) ).
fof(f33,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_identity) ).
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/sandbox2/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f335,plain,
! [X0,X1] : multiplication(sK0,addition(multiplication(sK1,X0),X1)) = addition(zero,multiplication(sK0,X1)),
inference(superposition,[],[f46,f260]) ).
fof(f260,plain,
! [X0] : zero = multiplication(sK0,multiplication(sK1,X0)),
inference(forward_demodulation,[],[f251,f32]) ).
fof(f32,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0] : zero = multiplication(zero,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_annihilation) ).
fof(f251,plain,
! [X0] : multiplication(zero,X0) = multiplication(sK0,multiplication(sK1,X0)),
inference(superposition,[],[f45,f30]) ).
fof(f30,plain,
zero = multiplication(sK0,sK1),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
( sK0 != multiplication(sK0,strong_iteration(sK1))
& zero = multiplication(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f23,f27]) ).
fof(f27,plain,
( ? [X0,X1] :
( multiplication(X0,strong_iteration(X1)) != X0
& zero = multiplication(X0,X1) )
=> ( sK0 != multiplication(sK0,strong_iteration(sK1))
& zero = multiplication(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
? [X0,X1] :
( multiplication(X0,strong_iteration(X1)) != X0
& zero = multiplication(X0,X1) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
~ ! [X0,X1] :
( zero = multiplication(X0,X1)
=> multiplication(X0,strong_iteration(X1)) = X0 ),
inference(rectify,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X3,X4] :
( zero = multiplication(X3,X4)
=> multiplication(X3,strong_iteration(X4)) = X3 ),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X3,X4] :
( zero = multiplication(X3,X4)
=> multiplication(X3,strong_iteration(X4)) = X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f45,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(f46,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(f31,plain,
sK0 != multiplication(sK0,strong_iteration(sK1)),
inference(cnf_transformation,[],[f28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : KLE148+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Apr 30 05:20:10 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % (381)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.36 % (384)WARNING: value z3 for option sas not known
% 0.12/0.36 % (384)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.12/0.36 % (388)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.12/0.36 % (383)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.12/0.36 % (386)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.12/0.36 % (385)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.12/0.36 % (387)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.12/0.36 TRYING [1]
% 0.12/0.36 % (382)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.12/0.36 TRYING [2]
% 0.12/0.36 TRYING [3]
% 0.12/0.37 TRYING [1]
% 0.12/0.37 % (387)First to succeed.
% 0.12/0.37 TRYING [2]
% 0.12/0.37 % (387)Refutation found. Thanks to Tanya!
% 0.12/0.37 % SZS status Theorem for theBenchmark
% 0.12/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.37 % (387)------------------------------
% 0.12/0.37 % (387)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.12/0.37 % (387)Termination reason: Refutation
% 0.12/0.37
% 0.12/0.37 % (387)Memory used [KB]: 1011
% 0.12/0.37 % (387)Time elapsed: 0.013 s
% 0.12/0.37 % (387)Instructions burned: 21 (million)
% 0.12/0.37 % (387)------------------------------
% 0.12/0.37 % (387)------------------------------
% 0.12/0.37 % (381)Success in time 0.028 s
%------------------------------------------------------------------------------