TSTP Solution File: KLE022+2 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : KLE022+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 : n007.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:49 EDT 2022
% Result : Theorem 0.21s 0.57s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 60 ( 24 unt; 3 typ; 0 def)
% Number of atoms : 125 ( 54 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 117 ( 49 ~; 35 |; 19 &)
% ( 7 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 80 ( 76 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_5,type,
sQ4_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_6,type,
sQ5_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_7,type,
sQ6_eqProxy: ( $real * $real ) > $o ).
fof(f312,plain,
$false,
inference(subsumption_resolution,[],[f311,f84]) ).
fof(f84,plain,
! [X0] : addition(X0,X0) = X0,
inference(literal_reordering,[],[f67]) ).
fof(f67,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',additive_idempotence) ).
fof(f311,plain,
sK2 != addition(sK2,sK2),
inference(resolution,[],[f310,f87]) ).
fof(f87,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(literal_reordering,[],[f59]) ).
fof(f59,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(rectify,[],[f31]) ).
fof(f31,plain,
! [X1,X0] :
( addition(X1,X0) != X0
| leq(X1,X0) ),
inference(ennf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( addition(X1,X0) = X0
=> leq(X1,X0) ),
inference(unused_predicate_definition_removal,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( leq(X1,X0)
<=> addition(X1,X0) = X0 ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X1,X0] :
( addition(X0,X1) = X1
<=> leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).
fof(f310,plain,
~ leq(sK2,sK2),
inference(duplicate_literal_removal,[],[f309]) ).
fof(f309,plain,
( ~ leq(sK2,sK2)
| ~ leq(sK2,sK2) ),
inference(forward_demodulation,[],[f297,f294]) ).
fof(f294,plain,
! [X0] : multiplication(X0,addition(sK1,c(sK1))) = X0,
inference(backward_demodulation,[],[f95,f263]) ).
fof(f263,plain,
one = addition(sK1,c(sK1)),
inference(forward_demodulation,[],[f262,f93]) ).
fof(f93,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(literal_reordering,[],[f68]) ).
fof(f68,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1] : 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(f262,plain,
one = addition(c(sK1),sK1),
inference(resolution,[],[f146,f73]) ).
fof(f73,plain,
! [X0,X1] :
( ~ complement(X0,X1)
| addition(X1,X0) = one ),
inference(literal_reordering,[],[f66]) ).
fof(f66,plain,
! [X0,X1] :
( ~ complement(X0,X1)
| addition(X1,X0) = one ),
inference(cnf_transformation,[],[f46]) ).
fof(f46,plain,
! [X0,X1] :
( ( ( addition(X1,X0) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) )
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| addition(X1,X0) != one
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1) ) ),
inference(flattening,[],[f45]) ).
fof(f45,plain,
! [X0,X1] :
( ( ( addition(X1,X0) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) )
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| addition(X1,X0) != one
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1) ) ),
inference(nnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ( addition(X1,X0) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) )
<=> complement(X0,X1) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X4,X3] :
( complement(X4,X3)
<=> ( zero = multiplication(X3,X4)
& zero = multiplication(X4,X3)
& one = addition(X3,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_2) ).
fof(f146,plain,
complement(sK1,c(sK1)),
inference(resolution,[],[f74,f76]) ).
fof(f76,plain,
test(sK1),
inference(literal_reordering,[],[f62]) ).
fof(f62,plain,
test(sK1),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
( test(sK1)
& ( ~ leq(sK2,addition(multiplication(sK2,sK1),multiplication(sK2,c(sK1))))
| ~ leq(addition(multiplication(sK2,sK1),multiplication(sK2,c(sK1))),sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f30,f43]) ).
fof(f43,plain,
( ? [X0,X1] :
( test(X0)
& ( ~ leq(X1,addition(multiplication(X1,X0),multiplication(X1,c(X0))))
| ~ leq(addition(multiplication(X1,X0),multiplication(X1,c(X0))),X1) ) )
=> ( test(sK1)
& ( ~ leq(sK2,addition(multiplication(sK2,sK1),multiplication(sK2,c(sK1))))
| ~ leq(addition(multiplication(sK2,sK1),multiplication(sK2,c(sK1))),sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
? [X0,X1] :
( test(X0)
& ( ~ leq(X1,addition(multiplication(X1,X0),multiplication(X1,c(X0))))
| ~ leq(addition(multiplication(X1,X0),multiplication(X1,c(X0))),X1) ) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
~ ! [X0,X1] :
( test(X0)
=> ( leq(addition(multiplication(X1,X0),multiplication(X1,c(X0))),X1)
& leq(X1,addition(multiplication(X1,X0),multiplication(X1,c(X0)))) ) ),
inference(rectify,[],[f18]) ).
fof(f18,negated_conjecture,
~ ! [X4,X3] :
( test(X4)
=> ( leq(X3,addition(multiplication(X3,X4),multiplication(X3,c(X4))))
& leq(addition(multiplication(X3,X4),multiplication(X3,c(X4))),X3) ) ),
inference(negated_conjecture,[],[f17]) ).
fof(f17,conjecture,
! [X4,X3] :
( test(X4)
=> ( leq(X3,addition(multiplication(X3,X4),multiplication(X3,c(X4))))
& leq(addition(multiplication(X3,X4),multiplication(X3,c(X4))),X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f74,plain,
! [X0] :
( ~ test(X0)
| complement(X0,c(X0)) ),
inference(literal_reordering,[],[f72]) ).
fof(f72,plain,
! [X0] :
( ~ test(X0)
| complement(X0,c(X0)) ),
inference(equality_resolution,[],[f57]) ).
fof(f57,plain,
! [X0,X1] :
( ~ test(X0)
| complement(X0,X1)
| c(X0) != X1 ),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X1] :
( ~ test(X0)
| ( ( complement(X0,X1)
| c(X0) != X1 )
& ( c(X0) = X1
| ~ complement(X0,X1) ) ) ),
inference(rectify,[],[f39]) ).
fof(f39,plain,
! [X1,X0] :
( ~ test(X1)
| ( ( complement(X1,X0)
| c(X1) != X0 )
& ( c(X1) = X0
| ~ complement(X1,X0) ) ) ),
inference(nnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X1,X0] :
( ~ test(X1)
| ( complement(X1,X0)
<=> c(X1) = X0 ) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,plain,
! [X1,X0] :
( test(X1)
=> ( complement(X1,X0)
<=> c(X1) = X0 ) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X4,X3] :
( test(X3)
=> ( c(X3) = X4
<=> complement(X3,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_3) ).
fof(f95,plain,
! [X0] : multiplication(X0,one) = X0,
inference(literal_reordering,[],[f52]) ).
fof(f52,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_right_identity) ).
fof(f297,plain,
( ~ leq(sK2,sK2)
| ~ leq(sK2,multiplication(sK2,addition(sK1,c(sK1)))) ),
inference(backward_demodulation,[],[f252,f294]) ).
fof(f252,plain,
( ~ leq(sK2,multiplication(sK2,addition(sK1,c(sK1))))
| ~ leq(multiplication(sK2,addition(sK1,c(sK1))),sK2) ),
inference(forward_demodulation,[],[f251,f90]) ).
fof(f90,plain,
! [X2,X0,X1] : addition(multiplication(X1,X2),multiplication(X1,X0)) = multiplication(X1,addition(X2,X0)),
inference(literal_reordering,[],[f69]) ).
fof(f69,plain,
! [X2,X0,X1] : addition(multiplication(X1,X2),multiplication(X1,X0)) = multiplication(X1,addition(X2,X0)),
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0,X1,X2] : addition(multiplication(X1,X2),multiplication(X1,X0)) = multiplication(X1,addition(X2,X0)),
inference(rectify,[],[f26]) ).
fof(f26,plain,
! [X1,X0,X2] : addition(multiplication(X0,X2),multiplication(X0,X1)) = multiplication(X0,addition(X2,X1)),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X0,X2,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_distributivity) ).
fof(f251,plain,
( ~ leq(sK2,multiplication(sK2,addition(sK1,c(sK1))))
| ~ leq(addition(multiplication(sK2,sK1),multiplication(sK2,c(sK1))),sK2) ),
inference(forward_demodulation,[],[f85,f90]) ).
fof(f85,plain,
( ~ leq(sK2,addition(multiplication(sK2,sK1),multiplication(sK2,c(sK1))))
| ~ leq(addition(multiplication(sK2,sK1),multiplication(sK2,c(sK1))),sK2) ),
inference(literal_reordering,[],[f61]) ).
fof(f61,plain,
( ~ leq(addition(multiplication(sK2,sK1),multiplication(sK2,c(sK1))),sK2)
| ~ leq(sK2,addition(multiplication(sK2,sK1),multiplication(sK2,c(sK1)))) ),
inference(cnf_transformation,[],[f44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : KLE022+2 : 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_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n007.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:07:30 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.54 % (19897)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.55 % (19889)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.55 % (19889)Instruction limit reached!
% 0.21/0.55 % (19889)------------------------------
% 0.21/0.55 % (19889)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55 % (19889)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55 % (19889)Termination reason: Unknown
% 0.21/0.55 % (19889)Termination phase: Saturation
% 0.21/0.55
% 0.21/0.55 % (19889)Memory used [KB]: 895
% 0.21/0.55 % (19889)Time elapsed: 0.003 s
% 0.21/0.55 % (19889)Instructions burned: 2 (million)
% 0.21/0.55 % (19889)------------------------------
% 0.21/0.55 % (19889)------------------------------
% 0.21/0.55 % (19895)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.21/0.55 % (19887)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.55 TRYING [1]
% 0.21/0.55 % (19903)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.21/0.55 TRYING [2]
% 0.21/0.55 TRYING [3]
% 0.21/0.56 % (19905)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.21/0.56 % (19895)First to succeed.
% 0.21/0.57 TRYING [4]
% 0.21/0.57 % (19893)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.21/0.57 % (19895)Refutation found. Thanks to Tanya!
% 0.21/0.57 % SZS status Theorem for theBenchmark
% 0.21/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.57 % (19895)------------------------------
% 0.21/0.57 % (19895)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.57 % (19895)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.57 % (19895)Termination reason: Refutation
% 0.21/0.57
% 0.21/0.57 % (19895)Memory used [KB]: 5884
% 0.21/0.57 % (19895)Time elapsed: 0.013 s
% 0.21/0.57 % (19895)Instructions burned: 10 (million)
% 0.21/0.57 % (19895)------------------------------
% 0.21/0.57 % (19895)------------------------------
% 0.21/0.57 % (19880)Success in time 0.216 s
%------------------------------------------------------------------------------