TSTP Solution File: KLE139+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : KLE139+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 : n011.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 108.74s 15.89s
% Output : Refutation 108.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 31 ( 30 unt; 0 def)
% Number of atoms : 32 ( 31 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 : 5 ( 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 : 44 ( 42 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f315890,plain,
$false,
inference(trivial_inequality_removal,[],[f315228]) ).
fof(f315228,plain,
strong_iteration(sK0) != strong_iteration(sK0),
inference(superposition,[],[f53,f314766]) ).
fof(f314766,plain,
! [X0] : strong_iteration(X0) = addition(one,multiplication(strong_iteration(X0),X0)),
inference(forward_demodulation,[],[f314765,f39]) ).
fof(f39,plain,
! [X0] : strong_iteration(X0) = addition(star(X0),multiplication(strong_iteration(X0),zero)),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
! [X0] : strong_iteration(X0) = addition(star(X0),multiplication(strong_iteration(X0),zero)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',isolation) ).
fof(f314765,plain,
! [X0] : addition(star(X0),multiplication(strong_iteration(X0),zero)) = addition(one,multiplication(strong_iteration(X0),X0)),
inference(forward_demodulation,[],[f314764,f31]) ).
fof(f31,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0] : zero = multiplication(zero,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_annihilation) ).
fof(f314764,plain,
! [X0] : addition(one,multiplication(strong_iteration(X0),X0)) = addition(star(X0),multiplication(strong_iteration(X0),multiplication(zero,X0))),
inference(forward_demodulation,[],[f314002,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/sandbox/benchmark/theBenchmark.p',multiplicative_associativity) ).
fof(f314002,plain,
! [X0] : addition(one,multiplication(strong_iteration(X0),X0)) = addition(star(X0),multiplication(multiplication(strong_iteration(X0),zero),X0)),
inference(superposition,[],[f6870,f39]) ).
fof(f6870,plain,
! [X0,X1] : addition(star(X0),multiplication(X1,X0)) = addition(one,multiplication(addition(star(X0),X1),X0)),
inference(superposition,[],[f160,f46]) ).
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/sandbox/benchmark/theBenchmark.p',distributivity2) ).
fof(f160,plain,
! [X0,X1] : addition(star(X0),X1) = addition(one,addition(multiplication(star(X0),X0),X1)),
inference(superposition,[],[f43,f37]) ).
fof(f37,plain,
! [X0] : star(X0) = addition(one,multiplication(star(X0),X0)),
inference(cnf_transformation,[],[f12]) ).
fof(f12,axiom,
! [X0] : star(X0) = addition(one,multiplication(star(X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',star_unfold2) ).
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/sandbox/benchmark/theBenchmark.p',additive_associativity) ).
fof(f53,plain,
strong_iteration(sK0) != addition(one,multiplication(strong_iteration(sK0),sK0)),
inference(superposition,[],[f30,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/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f30,plain,
strong_iteration(sK0) != addition(multiplication(strong_iteration(sK0),sK0),one),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
strong_iteration(sK0) != addition(multiplication(strong_iteration(sK0),sK0),one),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f23,f27]) ).
fof(f27,plain,
( ? [X0] : strong_iteration(X0) != addition(multiplication(strong_iteration(X0),X0),one)
=> strong_iteration(sK0) != addition(multiplication(strong_iteration(sK0),sK0),one) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
? [X0] : strong_iteration(X0) != addition(multiplication(strong_iteration(X0),X0),one),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
~ ! [X0] : strong_iteration(X0) = addition(multiplication(strong_iteration(X0),X0),one),
inference(rectify,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X3] : strong_iteration(X3) = addition(multiplication(strong_iteration(X3),X3),one),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X3] : strong_iteration(X3) = addition(multiplication(strong_iteration(X3),X3),one),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE139+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n011.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 05:05:46 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.36 % (16517)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.37 % (16521)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.20/0.37 TRYING [1]
% 0.20/0.37 TRYING [2]
% 0.20/0.37 % (16520)WARNING: value z3 for option sas not known
% 0.20/0.37 % (16518)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.20/0.37 % (16519)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.20/0.37 TRYING [3]
% 0.20/0.37 % (16520)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.20/0.37 % (16522)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.20/0.37 % (16523)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.20/0.37 % (16524)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.20/0.38 TRYING [1]
% 0.20/0.38 TRYING [4]
% 0.20/0.38 TRYING [2]
% 0.20/0.40 TRYING [3]
% 0.20/0.41 TRYING [5]
% 0.20/0.45 TRYING [4]
% 0.20/0.49 TRYING [6]
% 0.20/0.54 TRYING [5]
% 2.21/0.66 TRYING [7]
% 2.97/0.79 TRYING [6]
% 4.81/1.05 TRYING [8]
% 7.84/1.47 TRYING [1]
% 7.84/1.47 TRYING [2]
% 7.84/1.47 TRYING [3]
% 7.84/1.49 TRYING [7]
% 7.84/1.49 TRYING [4]
% 8.06/1.53 TRYING [5]
% 8.97/1.63 TRYING [6]
% 10.39/1.90 TRYING [7]
% 10.39/1.90 TRYING [9]
% 15.33/2.56 TRYING [8]
% 23.16/3.65 TRYING [10]
% 25.50/4.00 TRYING [9]
% 27.99/4.34 TRYING [8]
% 49.95/7.51 TRYING [10]
% 56.14/8.39 TRYING [11]
% 92.08/13.47 TRYING [11]
% 94.38/13.83 TRYING [12]
% 108.74/15.87 % (16523)First to succeed.
% 108.74/15.89 % (16523)Refutation found. Thanks to Tanya!
% 108.74/15.89 % SZS status Theorem for theBenchmark
% 108.74/15.89 % SZS output start Proof for theBenchmark
% See solution above
% 108.74/15.89 % (16523)------------------------------
% 108.74/15.89 % (16523)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 108.74/15.89 % (16523)Termination reason: Refutation
% 108.74/15.89
% 108.74/15.89 % (16523)Memory used [KB]: 135968
% 108.74/15.89 % (16523)Time elapsed: 15.503 s
% 108.74/15.89 % (16523)Instructions burned: 48377 (million)
% 108.74/15.89 % (16523)------------------------------
% 108.74/15.89 % (16523)------------------------------
% 108.74/15.89 % (16517)Success in time 15.427 s
%------------------------------------------------------------------------------