TSTP Solution File: KLE059+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---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_uns --cores 0 -t %d %s
% Computer : n024.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:27:56 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 9 unt; 0 def)
% Number of atoms : 23 ( 22 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 : 18 ( 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f67,plain,
$false,
inference(trivial_inequality_removal,[],[f66]) ).
fof(f66,plain,
domain(sK0) != domain(sK0),
inference(forward_demodulation,[],[f60,f38]) ).
fof(f38,plain,
sK0 = addition(sK1,sK0),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
( sK0 = addition(sK1,sK0)
& domain(sK0) != addition(domain(sK1),domain(sK0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f28,f30]) ).
fof(f30,plain,
( ? [X0,X1] :
( addition(X1,X0) = X0
& addition(domain(X1),domain(X0)) != domain(X0) )
=> ( sK0 = addition(sK1,sK0)
& domain(sK0) != addition(domain(sK1),domain(sK0)) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
? [X0,X1] :
( addition(X1,X0) = X0
& addition(domain(X1),domain(X0)) != domain(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,plain,
~ ! [X1,X0] :
( addition(X1,X0) = X0
=> addition(domain(X1),domain(X0)) = domain(X0) ),
inference(rectify,[],[f19]) ).
fof(f19,negated_conjecture,
~ ! [X4,X3] :
( addition(X3,X4) = X4
=> domain(X4) = addition(domain(X3),domain(X4)) ),
inference(negated_conjecture,[],[f18]) ).
fof(f18,conjecture,
! [X4,X3] :
( addition(X3,X4) = X4
=> domain(X4) = addition(domain(X3),domain(X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f60,plain,
domain(addition(sK1,sK0)) != domain(sK0),
inference(superposition,[],[f37,f43]) ).
fof(f43,plain,
! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
inference(rectify,[],[f21]) ).
fof(f21,plain,
! [X1,X0] : addition(domain(X1),domain(X0)) = domain(addition(X1,X0)),
inference(rectify,[],[f17]) ).
fof(f17,axiom,
! [X4,X3] : domain(addition(X3,X4)) = addition(domain(X3),domain(X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain5) ).
fof(f37,plain,
domain(sK0) != addition(domain(sK1),domain(sK0)),
inference(cnf_transformation,[],[f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KLE059+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n024.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:26:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.48 % (32427)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.19/0.50 % (32428)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.50 % (32427)Refutation not found, incomplete strategy% (32427)------------------------------
% 0.19/0.50 % (32427)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (32419)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.50 % (32427)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (32427)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.50
% 0.19/0.50 % (32427)Memory used [KB]: 5884
% 0.19/0.50 % (32427)Time elapsed: 0.094 s
% 0.19/0.50 % (32427)Instructions burned: 2 (million)
% 0.19/0.50 % (32427)------------------------------
% 0.19/0.50 % (32427)------------------------------
% 0.19/0.50 % (32428)First to succeed.
% 0.19/0.50 % (32419)Also succeeded, but the first one will report.
% 0.19/0.50 % (32428)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (32428)------------------------------
% 0.19/0.50 % (32428)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (32428)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (32428)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (32428)Memory used [KB]: 5884
% 0.19/0.50 % (32428)Time elapsed: 0.105 s
% 0.19/0.50 % (32428)Instructions burned: 2 (million)
% 0.19/0.50 % (32428)------------------------------
% 0.19/0.50 % (32428)------------------------------
% 0.19/0.50 % (32416)Success in time 0.152 s
%------------------------------------------------------------------------------