TSTP Solution File: KLE150+2 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : KLE150+2 : 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 : n014.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:18 EDT 2022
% Result : Theorem 0.20s 0.60s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 50 ( 28 unt; 0 def)
% Number of atoms : 76 ( 30 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 50 ( 24 ~; 17 |; 4 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 44 ( 42 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f307,plain,
$false,
inference(avatar_sat_refutation,[],[f74,f300,f306]) ).
fof(f306,plain,
spl4_2,
inference(avatar_contradiction_clause,[],[f305]) ).
fof(f305,plain,
( $false
| spl4_2 ),
inference(subsumption_resolution,[],[f304,f89]) ).
fof(f89,plain,
! [X1] : leq(X1,X1),
inference(trivial_inequality_removal,[],[f84]) ).
fof(f84,plain,
! [X1] :
( leq(X1,X1)
| X1 != X1 ),
inference(superposition,[],[f49,f56]) ).
fof(f56,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence) ).
fof(f49,plain,
! [X0,X1] :
( addition(X1,X0) != X0
| leq(X1,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(nnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( addition(X1,X0) = X0
<=> leq(X1,X0) ),
inference(rectify,[],[f18]) ).
fof(f18,axiom,
! [X1,X0] :
( addition(X0,X1) = X1
<=> leq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).
fof(f304,plain,
( ~ leq(sF2,sF2)
| spl4_2 ),
inference(forward_demodulation,[],[f73,f268]) ).
fof(f268,plain,
sF2 = sF3,
inference(forward_demodulation,[],[f262,f63]) ).
fof(f63,plain,
addition(one,sF1) = sF2,
introduced(function_definition,[]) ).
fof(f262,plain,
addition(one,sF1) = sF3,
inference(superposition,[],[f226,f55]) ).
fof(f55,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,[],[f22]) ).
fof(f22,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/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f226,plain,
addition(sF1,one) = sF3,
inference(forward_demodulation,[],[f225,f64]) ).
fof(f64,plain,
strong_iteration(sF1) = sF3,
introduced(function_definition,[]) ).
fof(f225,plain,
addition(sF1,one) = strong_iteration(sF1),
inference(superposition,[],[f53,f219]) ).
fof(f219,plain,
! [X10] : sF1 = multiplication(sF1,X10),
inference(forward_demodulation,[],[f218,f62]) ).
fof(f62,plain,
multiplication(sK0,zero) = sF1,
introduced(function_definition,[]) ).
fof(f218,plain,
! [X10] : multiplication(sK0,zero) = multiplication(sF1,X10),
inference(forward_demodulation,[],[f211,f61]) ).
fof(f61,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(f211,plain,
! [X10] : multiplication(sK0,multiplication(zero,X10)) = multiplication(sF1,X10),
inference(superposition,[],[f59,f62]) ).
fof(f59,plain,
! [X2,X0,X1] : multiplication(X2,multiplication(X1,X0)) = multiplication(multiplication(X2,X1),X0),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X1,X2] : multiplication(X2,multiplication(X1,X0)) = multiplication(multiplication(X2,X1),X0),
inference(rectify,[],[f27]) ).
fof(f27,plain,
! [X1,X2,X0] : multiplication(X0,multiplication(X2,X1)) = multiplication(multiplication(X0,X2),X1),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X0,X2,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_associativity) ).
fof(f53,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/sandbox/benchmark/theBenchmark.p',infty_unfold1) ).
fof(f73,plain,
( ~ leq(sF2,sF3)
| spl4_2 ),
inference(avatar_component_clause,[],[f71]) ).
fof(f71,plain,
( spl4_2
<=> leq(sF2,sF3) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f300,plain,
spl4_1,
inference(avatar_contradiction_clause,[],[f299]) ).
fof(f299,plain,
( $false
| spl4_1 ),
inference(subsumption_resolution,[],[f298,f89]) ).
fof(f298,plain,
( ~ leq(sF2,sF2)
| spl4_1 ),
inference(superposition,[],[f69,f268]) ).
fof(f69,plain,
( ~ leq(sF3,sF2)
| spl4_1 ),
inference(avatar_component_clause,[],[f67]) ).
fof(f67,plain,
( spl4_1
<=> leq(sF3,sF2) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f74,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f65,f71,f67]) ).
fof(f65,plain,
( ~ leq(sF2,sF3)
| ~ leq(sF3,sF2) ),
inference(definition_folding,[],[f45,f63,f62,f64,f62,f64,f62,f63,f62]) ).
fof(f45,plain,
( ~ leq(addition(one,multiplication(sK0,zero)),strong_iteration(multiplication(sK0,zero)))
| ~ leq(strong_iteration(multiplication(sK0,zero)),addition(one,multiplication(sK0,zero))) ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
( ~ leq(addition(one,multiplication(sK0,zero)),strong_iteration(multiplication(sK0,zero)))
| ~ leq(strong_iteration(multiplication(sK0,zero)),addition(one,multiplication(sK0,zero))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f28,f32]) ).
fof(f32,plain,
( ? [X0] :
( ~ leq(addition(one,multiplication(X0,zero)),strong_iteration(multiplication(X0,zero)))
| ~ leq(strong_iteration(multiplication(X0,zero)),addition(one,multiplication(X0,zero))) )
=> ( ~ leq(addition(one,multiplication(sK0,zero)),strong_iteration(multiplication(sK0,zero)))
| ~ leq(strong_iteration(multiplication(sK0,zero)),addition(one,multiplication(sK0,zero))) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
? [X0] :
( ~ leq(addition(one,multiplication(X0,zero)),strong_iteration(multiplication(X0,zero)))
| ~ leq(strong_iteration(multiplication(X0,zero)),addition(one,multiplication(X0,zero))) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,plain,
~ ! [X0] :
( leq(strong_iteration(multiplication(X0,zero)),addition(one,multiplication(X0,zero)))
& leq(addition(one,multiplication(X0,zero)),strong_iteration(multiplication(X0,zero))) ),
inference(rectify,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X3] :
( leq(addition(one,multiplication(X3,zero)),strong_iteration(multiplication(X3,zero)))
& leq(strong_iteration(multiplication(X3,zero)),addition(one,multiplication(X3,zero))) ),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X3] :
( leq(addition(one,multiplication(X3,zero)),strong_iteration(multiplication(X3,zero)))
& leq(strong_iteration(multiplication(X3,zero)),addition(one,multiplication(X3,zero))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : KLE150+2 : 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.14/0.35 % Computer : n014.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 Aug 30 00:28:18 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.56 % (17658)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.57 % (17650)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.57 % (17640)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.57 % (17648)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.58 % (17642)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.58 % (17648)First to succeed.
% 0.20/0.59 % (17657)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.59 % (17642)Instruction limit reached!
% 0.20/0.59 % (17642)------------------------------
% 0.20/0.59 % (17642)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.59 % (17642)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.59 % (17642)Termination reason: Unknown
% 0.20/0.59 % (17642)Termination phase: Saturation
% 0.20/0.59
% 0.20/0.59 % (17642)Memory used [KB]: 5500
% 0.20/0.59 % (17642)Time elapsed: 0.100 s
% 0.20/0.59 % (17642)Instructions burned: 7 (million)
% 0.20/0.59 % (17642)------------------------------
% 0.20/0.59 % (17642)------------------------------
% 0.20/0.60 % (17650)Also succeeded, but the first one will report.
% 0.20/0.60 % (17648)Refutation found. Thanks to Tanya!
% 0.20/0.60 % SZS status Theorem for theBenchmark
% 0.20/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.60 % (17648)------------------------------
% 0.20/0.60 % (17648)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.60 % (17648)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.60 % (17648)Termination reason: Refutation
% 0.20/0.60
% 0.20/0.60 % (17648)Memory used [KB]: 5628
% 0.20/0.60 % (17648)Time elapsed: 0.147 s
% 0.20/0.60 % (17648)Instructions burned: 11 (million)
% 0.20/0.60 % (17648)------------------------------
% 0.20/0.60 % (17648)------------------------------
% 0.20/0.60 % (17634)Success in time 0.24 s
%------------------------------------------------------------------------------