TSTP Solution File: KLE146+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : KLE146+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 : n027.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:17 EDT 2022
% Result : Theorem 0.21s 0.51s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 29 ( 24 unt; 0 def)
% Number of atoms : 38 ( 23 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 23 ( 14 ~; 5 |; 2 &)
% ( 1 <=>; 1 =>; 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 39 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f159,plain,
$false,
inference(trivial_inequality_removal,[],[f156]) ).
fof(f156,plain,
strong_iteration(sK0) != strong_iteration(sK0),
inference(superposition,[],[f73,f140]) ).
fof(f140,plain,
! [X15] : addition(one,strong_iteration(X15)) = strong_iteration(X15),
inference(superposition,[],[f107,f86]) ).
fof(f86,plain,
! [X2] : addition(one,multiplication(X2,strong_iteration(X2))) = strong_iteration(X2),
inference(superposition,[],[f58,f52]) ).
fof(f52,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(rectify,[],[f21]) ).
fof(f21,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(f58,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(f107,plain,
! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
inference(superposition,[],[f45,f46]) ).
fof(f46,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence) ).
fof(f45,plain,
! [X2,X0,X1] : addition(X1,addition(X0,X2)) = addition(addition(X1,X0),X2),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1,X2] : addition(X1,addition(X0,X2)) = addition(addition(X1,X0),X2),
inference(rectify,[],[f27]) ).
fof(f27,plain,
! [X0,X2,X1] : addition(addition(X2,X0),X1) = addition(X2,addition(X0,X1)),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X2,X0] : addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_associativity) ).
fof(f73,plain,
addition(one,strong_iteration(sK0)) != strong_iteration(sK0),
inference(resolution,[],[f47,f53]) ).
fof(f53,plain,
~ leq(one,strong_iteration(sK0)),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
~ leq(one,strong_iteration(sK0)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f31,f39]) ).
fof(f39,plain,
( ? [X0] : ~ leq(one,strong_iteration(X0))
=> ~ leq(one,strong_iteration(sK0)) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
? [X0] : ~ leq(one,strong_iteration(X0)),
inference(ennf_transformation,[],[f26]) ).
fof(f26,plain,
~ ! [X0] : leq(one,strong_iteration(X0)),
inference(rectify,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X3] : leq(one,strong_iteration(X3)),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X3] : leq(one,strong_iteration(X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f47,plain,
! [X0,X1] :
( leq(X1,X0)
| addition(X1,X0) != X0 ),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1] :
( ( addition(X1,X0) = X0
| ~ leq(X1,X0) )
& ( leq(X1,X0)
| addition(X1,X0) != X0 ) ),
inference(rectify,[],[f34]) ).
fof(f34,plain,
! [X1,X0] :
( ( addition(X0,X1) = X1
| ~ leq(X0,X1) )
& ( leq(X0,X1)
| addition(X0,X1) != X1 ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X1,X0] :
( addition(X0,X1) = X1
<=> leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KLE146+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/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.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 00:42:15 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.50 % (27572)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.21/0.50 % (27581)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.50 % (27580)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.50 % (27580)Instruction limit reached!
% 0.21/0.50 % (27580)------------------------------
% 0.21/0.50 % (27580)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.50 % (27580)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.50 % (27580)Termination reason: Unknown
% 0.21/0.50 % (27580)Termination phase: Saturation
% 0.21/0.50
% 0.21/0.50 % (27580)Memory used [KB]: 5373
% 0.21/0.50 % (27580)Time elapsed: 0.101 s
% 0.21/0.50 % (27580)Instructions burned: 2 (million)
% 0.21/0.50 % (27580)------------------------------
% 0.21/0.50 % (27580)------------------------------
% 0.21/0.50 % (27582)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.51 % (27588)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.51 TRYING [1]
% 0.21/0.51 TRYING [2]
% 0.21/0.51 % (27581)First to succeed.
% 0.21/0.51 TRYING [3]
% 0.21/0.51 % (27581)Refutation found. Thanks to Tanya!
% 0.21/0.51 % SZS status Theorem for theBenchmark
% 0.21/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51 % (27581)------------------------------
% 0.21/0.51 % (27581)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (27581)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (27581)Termination reason: Refutation
% 0.21/0.51
% 0.21/0.51 % (27581)Memory used [KB]: 1023
% 0.21/0.51 % (27581)Time elapsed: 0.120 s
% 0.21/0.51 % (27581)Instructions burned: 8 (million)
% 0.21/0.51 % (27581)------------------------------
% 0.21/0.51 % (27581)------------------------------
% 0.21/0.51 % (27571)Success in time 0.157 s
%------------------------------------------------------------------------------