TSTP Solution File: KLE138+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : KLE138+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n025.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 : Wed Aug 31 17:29:14 EDT 2022
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 18 unt; 0 def)
% Number of atoms : 18 ( 17 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 15 ( 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f77,plain,
$false,
inference(subsumption_resolution,[],[f76,f46]) ).
fof(f46,plain,
one != strong_iteration(zero),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
one != strong_iteration(zero),
inference(flattening,[],[f20]) ).
fof(f20,negated_conjecture,
one != strong_iteration(zero),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
one = strong_iteration(zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f76,plain,
one = strong_iteration(zero),
inference(forward_demodulation,[],[f70,f63]) ).
fof(f63,plain,
! [X0] : addition(zero,X0) = X0,
inference(superposition,[],[f55,f48]) ).
fof(f48,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(rectify,[],[f29]) ).
fof(f29,plain,
! [X1,X0] : addition(X0,X1) = addition(X1,X0),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f55,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(f70,plain,
strong_iteration(zero) = addition(zero,one),
inference(superposition,[],[f45,f56]) ).
fof(f56,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(f45,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) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE138+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n025.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 Aug 30 00:35:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.51 % (32369)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.51 % (32396)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.19/0.51 % (32379)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.51 % (32369)First to succeed.
% 0.19/0.52 % (32369)Refutation found. Thanks to Tanya!
% 0.19/0.52 % SZS status Theorem for theBenchmark
% 0.19/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52 % (32369)------------------------------
% 0.19/0.52 % (32369)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (32369)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (32369)Termination reason: Refutation
% 0.19/0.52
% 0.19/0.52 % (32369)Memory used [KB]: 895
% 0.19/0.52 % (32369)Time elapsed: 0.112 s
% 0.19/0.52 % (32369)Instructions burned: 3 (million)
% 0.19/0.52 % (32369)------------------------------
% 0.19/0.52 % (32369)------------------------------
% 0.19/0.52 % (32366)Success in time 0.166 s
%------------------------------------------------------------------------------