TSTP Solution File: KLE150+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : KLE150+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 : n021.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 2.25s 0.71s
% Output : Refutation 2.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 43 ( 42 unt; 0 def)
% Number of atoms : 44 ( 43 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 9 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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; 3 con; 0-2 aty)
% Number of variables : 61 ( 59 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f13789,plain,
$false,
inference(trivial_inequality_removal,[],[f13658]) ).
fof(f13658,plain,
star(multiplication(sK0,zero)) != star(multiplication(sK0,zero)),
inference(superposition,[],[f11041,f11049]) ).
fof(f11049,plain,
! [X0] : strong_iteration(multiplication(X0,zero)) = star(multiplication(X0,zero)),
inference(forward_demodulation,[],[f10997,f10985]) ).
fof(f10985,plain,
! [X0] : star(multiplication(X0,zero)) = addition(multiplication(X0,zero),one),
inference(superposition,[],[f1835,f9125]) ).
fof(f9125,plain,
! [X0,X1] : multiplication(X0,zero) = multiplication(multiplication(X0,zero),X1),
inference(forward_demodulation,[],[f9124,f3382]) ).
fof(f3382,plain,
! [X0] : multiplication(X0,zero) = multiplication(addition(one,X0),zero),
inference(superposition,[],[f487,f50]) ).
fof(f50,plain,
! [X0] : addition(zero,X0) = X0,
inference(superposition,[],[f40,f32]) ).
fof(f32,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(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(f487,plain,
! [X0,X1] : multiplication(addition(one,X1),X0) = addition(X0,multiplication(X1,X0)),
inference(superposition,[],[f46,f34]) ).
fof(f34,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_left_identity) ).
fof(f46,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/sandbox2/benchmark/theBenchmark.p',distributivity2) ).
fof(f9124,plain,
! [X0,X1] : multiplication(multiplication(X0,zero),X1) = multiplication(addition(one,X0),zero),
inference(forward_demodulation,[],[f9081,f31]) ).
fof(f31,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(f9081,plain,
! [X0,X1] : multiplication(multiplication(X0,zero),X1) = multiplication(addition(one,X0),multiplication(zero,X1)),
inference(superposition,[],[f44,f3382]) ).
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(f1835,plain,
! [X0] : star(X0) = addition(multiplication(X0,star(X0)),one),
inference(forward_demodulation,[],[f1778,f50]) ).
fof(f1778,plain,
! [X0] : addition(multiplication(X0,star(X0)),one) = addition(zero,star(X0)),
inference(superposition,[],[f1586,f37]) ).
fof(f37,plain,
! [X0] : star(X0) = addition(one,multiplication(X0,star(X0))),
inference(cnf_transformation,[],[f11]) ).
fof(f11,axiom,
! [X0] : star(X0) = addition(one,multiplication(X0,star(X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',star_unfold1) ).
fof(f1586,plain,
! [X0,X1] : addition(X1,X0) = addition(zero,addition(X0,X1)),
inference(superposition,[],[f165,f50]) ).
fof(f165,plain,
! [X2,X0,X1] : addition(X0,addition(X1,X2)) = addition(X2,addition(X0,X1)),
inference(superposition,[],[f43,f40]) ).
fof(f43,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/sandbox2/benchmark/theBenchmark.p',additive_associativity) ).
fof(f10997,plain,
! [X0] : strong_iteration(multiplication(X0,zero)) = addition(multiplication(X0,zero),one),
inference(superposition,[],[f36,f9125]) ).
fof(f36,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(f11041,plain,
strong_iteration(multiplication(sK0,zero)) != star(multiplication(sK0,zero)),
inference(backward_demodulation,[],[f30,f10981]) ).
fof(f10981,plain,
! [X0] : addition(one,multiplication(X0,zero)) = star(multiplication(X0,zero)),
inference(superposition,[],[f37,f9125]) ).
fof(f30,plain,
strong_iteration(multiplication(sK0,zero)) != addition(one,multiplication(sK0,zero)),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
strong_iteration(multiplication(sK0,zero)) != addition(one,multiplication(sK0,zero)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f23,f27]) ).
fof(f27,plain,
( ? [X0] : strong_iteration(multiplication(X0,zero)) != addition(one,multiplication(X0,zero))
=> strong_iteration(multiplication(sK0,zero)) != addition(one,multiplication(sK0,zero)) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
? [X0] : strong_iteration(multiplication(X0,zero)) != addition(one,multiplication(X0,zero)),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
~ ! [X0] : strong_iteration(multiplication(X0,zero)) = addition(one,multiplication(X0,zero)),
inference(rectify,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X3] : strong_iteration(multiplication(X3,zero)) = addition(one,multiplication(X3,zero)),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X3] : strong_iteration(multiplication(X3,zero)) = addition(one,multiplication(X3,zero)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : KLE150+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.16 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.37 % Computer : n021.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Tue Apr 30 05:04:40 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.38 % (4728)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.39 % (4731)WARNING: value z3 for option sas not known
% 0.22/0.39 % (4734)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.22/0.39 % (4735)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.22/0.39 % (4733)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.22/0.39 % (4731)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.22/0.39 % (4732)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.22/0.39 % (4730)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.22/0.39 % (4729)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.22/0.39 TRYING [1]
% 0.22/0.40 TRYING [2]
% 0.22/0.40 TRYING [3]
% 0.22/0.40 TRYING [1]
% 0.22/0.40 TRYING [2]
% 0.22/0.41 TRYING [4]
% 0.22/0.43 TRYING [3]
% 0.22/0.45 TRYING [5]
% 0.22/0.47 TRYING [4]
% 1.32/0.55 TRYING [6]
% 1.32/0.59 TRYING [5]
% 1.93/0.65 TRYING [1]
% 1.93/0.65 TRYING [2]
% 1.93/0.65 TRYING [3]
% 1.93/0.66 TRYING [4]
% 2.25/0.70 % (4734)First to succeed.
% 2.25/0.70 TRYING [5]
% 2.25/0.71 % (4734)Refutation found. Thanks to Tanya!
% 2.25/0.71 % SZS status Theorem for theBenchmark
% 2.25/0.71 % SZS output start Proof for theBenchmark
% See solution above
% 2.25/0.71 % (4734)------------------------------
% 2.25/0.71 % (4734)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 2.25/0.71 % (4734)Termination reason: Refutation
% 2.25/0.71
% 2.25/0.71 % (4734)Memory used [KB]: 4859
% 2.25/0.71 % (4734)Time elapsed: 0.317 s
% 2.25/0.71 % (4734)Instructions burned: 603 (million)
% 2.25/0.71 % (4734)------------------------------
% 2.25/0.71 % (4734)------------------------------
% 2.25/0.71 % (4728)Success in time 0.312 s
%------------------------------------------------------------------------------