TSTP Solution File: KLE129+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : KLE129+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 : n028.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:28:19 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 16 unt; 0 def)
% Number of atoms : 45 ( 44 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 35 ( 16 ~; 8 |; 4 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 30 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f143,plain,
$false,
inference(subsumption_resolution,[],[f142,f53]) ).
fof(f53,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',additive_idempotence) ).
fof(f142,plain,
addition(divergence(sK0),divergence(sK0)) != divergence(sK0),
inference(subsumption_resolution,[],[f141,f58]) ).
fof(f58,plain,
zero != divergence(sK0),
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
( zero != divergence(sK0)
& ! [X1] :
( zero = domain(X1)
| forward_diamond(sK0,domain(X1)) != addition(domain(X1),forward_diamond(sK0,domain(X1))) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f39,f44]) ).
fof(f44,plain,
( ? [X0] :
( zero != divergence(X0)
& ! [X1] :
( zero = domain(X1)
| addition(domain(X1),forward_diamond(X0,domain(X1))) != forward_diamond(X0,domain(X1)) ) )
=> ( zero != divergence(sK0)
& ! [X1] :
( zero = domain(X1)
| forward_diamond(sK0,domain(X1)) != addition(domain(X1),forward_diamond(sK0,domain(X1))) ) ) ),
introduced(choice_axiom,[]) ).
fof(f39,plain,
? [X0] :
( zero != divergence(X0)
& ! [X1] :
( zero = domain(X1)
| addition(domain(X1),forward_diamond(X0,domain(X1))) != forward_diamond(X0,domain(X1)) ) ),
inference(ennf_transformation,[],[f31]) ).
fof(f31,plain,
~ ! [X0] :
( ! [X1] :
( addition(domain(X1),forward_diamond(X0,domain(X1))) = forward_diamond(X0,domain(X1))
=> zero = domain(X1) )
=> zero = divergence(X0) ),
inference(rectify,[],[f30]) ).
fof(f30,negated_conjecture,
~ ! [X3] :
( ! [X4] :
( forward_diamond(X3,domain(X4)) = addition(domain(X4),forward_diamond(X3,domain(X4)))
=> zero = domain(X4) )
=> zero = divergence(X3) ),
inference(negated_conjecture,[],[f29]) ).
fof(f29,conjecture,
! [X3] :
( ! [X4] :
( forward_diamond(X3,domain(X4)) = addition(domain(X4),forward_diamond(X3,domain(X4)))
=> zero = domain(X4) )
=> zero = divergence(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f141,plain,
( zero = divergence(sK0)
| addition(divergence(sK0),divergence(sK0)) != divergence(sK0) ),
inference(superposition,[],[f137,f65]) ).
fof(f65,plain,
! [X0] : antidomain(antidomain(multiplication(X0,antidomain(antidomain(divergence(X0)))))) = divergence(X0),
inference(definition_unfolding,[],[f59,f63]) ).
fof(f63,plain,
! [X0,X1] : antidomain(antidomain(multiplication(X0,antidomain(antidomain(X1))))) = forward_diamond(X0,X1),
inference(definition_unfolding,[],[f54,f52,f52]) ).
fof(f52,plain,
! [X0] : antidomain(antidomain(X0)) = domain(X0),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0] : antidomain(antidomain(X0)) = domain(X0),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X3] : antidomain(antidomain(X3)) = domain(X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain4) ).
fof(f54,plain,
! [X0,X1] : domain(multiplication(X0,domain(X1))) = forward_diamond(X0,X1),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1] : domain(multiplication(X0,domain(X1))) = forward_diamond(X0,X1),
inference(rectify,[],[f23]) ).
fof(f23,axiom,
! [X3,X4] : forward_diamond(X3,X4) = domain(multiplication(X3,domain(X4))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',forward_diamond) ).
fof(f59,plain,
! [X0] : divergence(X0) = forward_diamond(X0,divergence(X0)),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0] : divergence(X0) = forward_diamond(X0,divergence(X0)),
inference(rectify,[],[f27]) ).
fof(f27,axiom,
! [X3] : divergence(X3) = forward_diamond(X3,divergence(X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divergence1) ).
fof(f137,plain,
! [X0] :
( antidomain(antidomain(multiplication(sK0,antidomain(antidomain(divergence(X0)))))) != addition(divergence(X0),antidomain(antidomain(multiplication(sK0,antidomain(antidomain(divergence(X0)))))))
| zero = divergence(X0) ),
inference(superposition,[],[f64,f65]) ).
fof(f64,plain,
! [X1] :
( addition(antidomain(antidomain(X1)),antidomain(antidomain(multiplication(sK0,antidomain(antidomain(antidomain(antidomain(X1)))))))) != antidomain(antidomain(multiplication(sK0,antidomain(antidomain(antidomain(antidomain(X1)))))))
| zero = antidomain(antidomain(X1)) ),
inference(definition_unfolding,[],[f57,f52,f63,f52,f52,f63,f52]) ).
fof(f57,plain,
! [X1] :
( zero = domain(X1)
| forward_diamond(sK0,domain(X1)) != addition(domain(X1),forward_diamond(sK0,domain(X1))) ),
inference(cnf_transformation,[],[f45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE129+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/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.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 00:34:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.50 % (18107)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.19/0.50 % (18091)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.50 % (18094)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.19/0.51 % (18099)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.51 % (18090)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.51 % (18091)First to succeed.
% 0.19/0.51 % (18091)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (18091)------------------------------
% 0.19/0.51 % (18091)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (18091)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (18091)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (18091)Memory used [KB]: 6012
% 0.19/0.51 % (18091)Time elapsed: 0.111 s
% 0.19/0.51 % (18091)Instructions burned: 6 (million)
% 0.19/0.51 % (18091)------------------------------
% 0.19/0.51 % (18091)------------------------------
% 0.19/0.51 % (18081)Success in time 0.165 s
%------------------------------------------------------------------------------