TSTP Solution File: KLE059+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : KLE059+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 : n013.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:00 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 8 unt; 0 def)
% Number of atoms : 22 ( 21 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 17 ( 9 ~; 0 |; 4 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 12 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f79,plain,
$false,
inference(trivial_inequality_removal,[],[f78]) ).
fof(f78,plain,
domain(sK1) != domain(sK1),
inference(forward_demodulation,[],[f74,f53]) ).
fof(f53,plain,
sK1 = addition(sK0,sK1),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
( sK1 = addition(sK0,sK1)
& domain(sK1) != addition(domain(sK0),domain(sK1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f28,f34]) ).
fof(f34,plain,
( ? [X0,X1] :
( addition(X0,X1) = X1
& addition(domain(X0),domain(X1)) != domain(X1) )
=> ( sK1 = addition(sK0,sK1)
& domain(sK1) != addition(domain(sK0),domain(sK1)) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
? [X0,X1] :
( addition(X0,X1) = X1
& addition(domain(X0),domain(X1)) != domain(X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,plain,
~ ! [X1,X0] :
( addition(X0,X1) = X1
=> addition(domain(X0),domain(X1)) = domain(X1) ),
inference(rectify,[],[f19]) ).
fof(f19,negated_conjecture,
~ ! [X3,X4] :
( addition(X3,X4) = X4
=> domain(X4) = addition(domain(X3),domain(X4)) ),
inference(negated_conjecture,[],[f18]) ).
fof(f18,conjecture,
! [X3,X4] :
( addition(X3,X4) = X4
=> domain(X4) = addition(domain(X3),domain(X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f74,plain,
domain(addition(sK0,sK1)) != domain(sK1),
inference(superposition,[],[f52,f46]) ).
fof(f46,plain,
! [X0,X1] : domain(addition(X1,X0)) = addition(domain(X1),domain(X0)),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] : domain(addition(X1,X0)) = addition(domain(X1),domain(X0)),
inference(rectify,[],[f17]) ).
fof(f17,axiom,
! [X4,X3] : domain(addition(X3,X4)) = addition(domain(X3),domain(X4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain5) ).
fof(f52,plain,
domain(sK1) != addition(domain(sK0),domain(sK1)),
inference(cnf_transformation,[],[f35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : KLE059+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.14 % 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 : n013.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:20:47 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.50 % (17019)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.51 % (17008)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.20/0.51 % (17028)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.51 % (17008)First to succeed.
% 0.20/0.51 % (17028)Also succeeded, but the first one will report.
% 0.20/0.51 % (17016)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51 % (17008)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Theorem for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (17008)------------------------------
% 0.20/0.51 % (17008)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (17008)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (17008)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (17008)Memory used [KB]: 895
% 0.20/0.51 % (17008)Time elapsed: 0.102 s
% 0.20/0.51 % (17008)Instructions burned: 3 (million)
% 0.20/0.51 % (17008)------------------------------
% 0.20/0.51 % (17008)------------------------------
% 0.20/0.51 % (17002)Success in time 0.152 s
%------------------------------------------------------------------------------