TSTP Solution File: KLE021+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : KLE021+3 : 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 : n008.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.18s 0.52s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 45 ( 20 unt; 3 typ; 0 def)
% Number of atoms : 92 ( 54 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 83 ( 33 ~; 23 |; 16 &)
% ( 5 <=>; 6 =>; 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 : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 64 ( 60 !; 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(f327,plain,
$false,
inference(subsumption_resolution,[],[f324,f96]) ).
fof(f96,plain,
! [X0] : multiplication(one,X0) = X0,
inference(literal_reordering,[],[f80]) ).
fof(f80,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_left_identity) ).
fof(f324,plain,
sK1 != multiplication(one,sK1),
inference(backward_demodulation,[],[f231,f311]) ).
fof(f311,plain,
one = addition(sK2,c(sK2)),
inference(resolution,[],[f170,f91]) ).
fof(f91,plain,
test(sK2),
inference(literal_reordering,[],[f69]) ).
fof(f69,plain,
test(sK2),
inference(cnf_transformation,[],[f50]) ).
fof(f50,plain,
( test(sK2)
& sK1 != addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f37,f49]) ).
fof(f49,plain,
( ? [X0,X1] :
( test(X1)
& addition(multiplication(X1,X0),multiplication(c(X1),X0)) != X0 )
=> ( test(sK2)
& sK1 != addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)) ) ),
introduced(choice_axiom,[]) ).
fof(f37,plain,
? [X0,X1] :
( test(X1)
& addition(multiplication(X1,X0),multiplication(c(X1),X0)) != X0 ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
~ ! [X1,X0] :
( test(X1)
=> addition(multiplication(X1,X0),multiplication(c(X1),X0)) = X0 ),
inference(rectify,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X3,X4] :
( test(X4)
=> addition(multiplication(X4,X3),multiplication(c(X4),X3)) = X3 ),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X3,X4] :
( test(X4)
=> addition(multiplication(X4,X3),multiplication(c(X4),X3)) = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f170,plain,
! [X0] :
( ~ test(X0)
| one = addition(X0,c(X0)) ),
inference(forward_demodulation,[],[f168,f103]) ).
fof(f103,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(literal_reordering,[],[f58]) ).
fof(f58,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f40]) ).
fof(f40,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/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f168,plain,
! [X0] :
( ~ test(X0)
| one = addition(c(X0),X0) ),
inference(resolution,[],[f83,f86]) ).
fof(f86,plain,
! [X1] :
( complement(X1,c(X1))
| ~ test(X1) ),
inference(literal_reordering,[],[f81]) ).
fof(f81,plain,
! [X1] :
( ~ test(X1)
| complement(X1,c(X1)) ),
inference(equality_resolution,[],[f73]) ).
fof(f73,plain,
! [X0,X1] :
( ~ test(X1)
| complement(X1,X0)
| c(X1) != X0 ),
inference(cnf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0,X1] :
( ~ test(X1)
| ( ( c(X1) = X0
| ~ complement(X1,X0) )
& ( complement(X1,X0)
| c(X1) != X0 ) ) ),
inference(rectify,[],[f53]) ).
fof(f53,plain,
! [X1,X0] :
( ~ test(X0)
| ( ( c(X0) = X1
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| c(X0) != X1 ) ) ),
inference(nnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X1,X0] :
( ~ test(X0)
| ( c(X0) = X1
<=> complement(X0,X1) ) ),
inference(ennf_transformation,[],[f31]) ).
fof(f31,plain,
! [X1,X0] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X3,X4] :
( test(X3)
=> ( complement(X3,X4)
<=> c(X3) = X4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_3) ).
fof(f83,plain,
! [X0,X1] :
( ~ complement(X0,X1)
| addition(X1,X0) = one ),
inference(literal_reordering,[],[f78]) ).
fof(f78,plain,
! [X0,X1] :
( addition(X1,X0) = one
| ~ complement(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f56,plain,
! [X0,X1] :
( ( complement(X0,X1)
| addition(X1,X0) != one
| zero != multiplication(X0,X1)
| zero != multiplication(X1,X0) )
& ( ( addition(X1,X0) = one
& zero = multiplication(X0,X1)
& zero = multiplication(X1,X0) )
| ~ complement(X0,X1) ) ),
inference(flattening,[],[f55]) ).
fof(f55,plain,
! [X0,X1] :
( ( complement(X0,X1)
| addition(X1,X0) != one
| zero != multiplication(X0,X1)
| zero != multiplication(X1,X0) )
& ( ( addition(X1,X0) = one
& zero = multiplication(X0,X1)
& zero = multiplication(X1,X0) )
| ~ complement(X0,X1) ) ),
inference(nnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( complement(X0,X1)
<=> ( addition(X1,X0) = one
& zero = multiplication(X0,X1)
& zero = multiplication(X1,X0) ) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X4,X3] :
( ( zero = multiplication(X3,X4)
& one = addition(X3,X4)
& zero = multiplication(X4,X3) )
<=> complement(X4,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_2) ).
fof(f231,plain,
multiplication(addition(sK2,c(sK2)),sK1) != sK1,
inference(superposition,[],[f85,f87]) ).
fof(f87,plain,
! [X2,X0,X1] : addition(multiplication(X2,X1),multiplication(X0,X1)) = multiplication(addition(X2,X0),X1),
inference(literal_reordering,[],[f59]) ).
fof(f59,plain,
! [X2,X0,X1] : addition(multiplication(X2,X1),multiplication(X0,X1)) = multiplication(addition(X2,X0),X1),
inference(cnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0,X1,X2] : addition(multiplication(X2,X1),multiplication(X0,X1)) = multiplication(addition(X2,X0),X1),
inference(rectify,[],[f22]) ).
fof(f22,plain,
! [X0,X2,X1] : addition(multiplication(X1,X2),multiplication(X0,X2)) = multiplication(addition(X1,X0),X2),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X1,X0,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_distributivity) ).
fof(f85,plain,
sK1 != addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),
inference(literal_reordering,[],[f68]) ).
fof(f68,plain,
sK1 != addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),
inference(cnf_transformation,[],[f50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE021+3 : 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.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 00:25:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.49 % (687)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.18/0.49 % (679)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.18/0.50 % (671)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.18/0.50 TRYING [1]
% 0.18/0.50 % (673)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.18/0.50 TRYING [2]
% 0.18/0.51 TRYING [3]
% 0.18/0.51 % (668)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.51 % (683)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.18/0.51 % (679)First to succeed.
% 0.18/0.51 % (669)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.51 % (670)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.18/0.52 % (679)Refutation found. Thanks to Tanya!
% 0.18/0.52 % SZS status Theorem for theBenchmark
% 0.18/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.52 % (679)------------------------------
% 0.18/0.52 % (679)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52 % (679)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52 % (679)Termination reason: Refutation
% 0.18/0.52
% 0.18/0.52 % (679)Memory used [KB]: 6012
% 0.18/0.52 % (679)Time elapsed: 0.015 s
% 0.18/0.52 % (679)Instructions burned: 12 (million)
% 0.18/0.52 % (679)------------------------------
% 0.18/0.52 % (679)------------------------------
% 0.18/0.52 % (664)Success in time 0.173 s
%------------------------------------------------------------------------------