TSTP Solution File: KLE021+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : KLE021+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 : n006.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:40 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 43 ( 17 unt; 0 def)
% Number of atoms : 103 ( 57 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 98 ( 38 ~; 28 |; 20 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 55 ( 49 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f145,plain,
$false,
inference(avatar_sat_refutation,[],[f141,f144]) ).
fof(f144,plain,
~ spl3_2,
inference(avatar_contradiction_clause,[],[f143]) ).
fof(f143,plain,
( $false
| ~ spl3_2 ),
inference(subsumption_resolution,[],[f142,f62]) ).
fof(f62,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(f142,plain,
( sK0 != multiplication(one,sK0)
| ~ spl3_2 ),
inference(backward_demodulation,[],[f72,f126]) ).
fof(f126,plain,
( one = addition(sK1,c(sK1))
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f125]) ).
fof(f125,plain,
( spl3_2
<=> one = addition(sK1,c(sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f72,plain,
sK0 != multiplication(addition(sK1,c(sK1)),sK0),
inference(superposition,[],[f49,f61]) ).
fof(f61,plain,
! [X2,X0,X1] : addition(multiplication(X1,X2),multiplication(X0,X2)) = multiplication(addition(X1,X0),X2),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X1,X2] : addition(multiplication(X1,X2),multiplication(X0,X2)) = multiplication(addition(X1,X0),X2),
inference(rectify,[],[f20]) ).
fof(f20,plain,
! [X2,X0,X1] : multiplication(addition(X0,X2),X1) = addition(multiplication(X0,X1),multiplication(X2,X1)),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X0,X2,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_distributivity) ).
fof(f49,plain,
addition(multiplication(sK1,sK0),multiplication(c(sK1),sK0)) != sK0,
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
( test(sK1)
& addition(multiplication(sK1,sK0),multiplication(c(sK1),sK0)) != sK0 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f31,f32]) ).
fof(f32,plain,
( ? [X0,X1] :
( test(X1)
& addition(multiplication(X1,X0),multiplication(c(X1),X0)) != X0 )
=> ( test(sK1)
& addition(multiplication(sK1,sK0),multiplication(c(sK1),sK0)) != sK0 ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
? [X0,X1] :
( test(X1)
& addition(multiplication(X1,X0),multiplication(c(X1),X0)) != X0 ),
inference(rectify,[],[f30]) ).
fof(f30,plain,
? [X1,X0] :
( test(X0)
& addition(multiplication(X0,X1),multiplication(c(X0),X1)) != X1 ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,plain,
~ ! [X0,X1] :
( test(X0)
=> addition(multiplication(X0,X1),multiplication(c(X0),X1)) = X1 ),
inference(rectify,[],[f18]) ).
fof(f18,negated_conjecture,
~ ! [X4,X3] :
( test(X4)
=> addition(multiplication(X4,X3),multiplication(c(X4),X3)) = X3 ),
inference(negated_conjecture,[],[f17]) ).
fof(f17,conjecture,
! [X4,X3] :
( test(X4)
=> addition(multiplication(X4,X3),multiplication(c(X4),X3)) = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f141,plain,
spl3_2,
inference(avatar_contradiction_clause,[],[f140]) ).
fof(f140,plain,
( $false
| spl3_2 ),
inference(subsumption_resolution,[],[f129,f127]) ).
fof(f127,plain,
( one != addition(sK1,c(sK1))
| spl3_2 ),
inference(avatar_component_clause,[],[f125]) ).
fof(f129,plain,
one = addition(sK1,c(sK1)),
inference(superposition,[],[f80,f51]) ).
fof(f51,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f80,plain,
one = addition(c(sK1),sK1),
inference(unit_resulting_resolution,[],[f71,f58]) ).
fof(f58,plain,
! [X0,X1] :
( ~ complement(X0,X1)
| addition(X1,X0) = one ),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0,X1] :
( ( ( zero = multiplication(X1,X0)
& addition(X1,X0) = one
& zero = multiplication(X0,X1) )
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| zero != multiplication(X1,X0)
| addition(X1,X0) != one
| zero != multiplication(X0,X1) ) ),
inference(rectify,[],[f37]) ).
fof(f37,plain,
! [X1,X0] :
( ( ( zero = multiplication(X0,X1)
& addition(X0,X1) = one
& zero = multiplication(X1,X0) )
| ~ complement(X1,X0) )
& ( complement(X1,X0)
| zero != multiplication(X0,X1)
| addition(X0,X1) != one
| zero != multiplication(X1,X0) ) ),
inference(flattening,[],[f36]) ).
fof(f36,plain,
! [X1,X0] :
( ( ( zero = multiplication(X0,X1)
& addition(X0,X1) = one
& zero = multiplication(X1,X0) )
| ~ complement(X1,X0) )
& ( complement(X1,X0)
| zero != multiplication(X0,X1)
| addition(X0,X1) != one
| zero != multiplication(X1,X0) ) ),
inference(nnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X1,X0] :
( ( zero = multiplication(X0,X1)
& addition(X0,X1) = one
& zero = multiplication(X1,X0) )
<=> complement(X1,X0) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X3,X4] :
( complement(X4,X3)
<=> ( zero = multiplication(X4,X3)
& zero = multiplication(X3,X4)
& one = addition(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_2) ).
fof(f71,plain,
complement(sK1,c(sK1)),
inference(unit_resulting_resolution,[],[f50,f69]) ).
fof(f69,plain,
! [X1] :
( complement(X1,c(X1))
| ~ test(X1) ),
inference(equality_resolution,[],[f55]) ).
fof(f55,plain,
! [X0,X1] :
( ~ test(X1)
| complement(X1,X0)
| c(X1) != X0 ),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1] :
( ~ test(X1)
| ( ( complement(X1,X0)
| c(X1) != X0 )
& ( c(X1) = X0
| ~ complement(X1,X0) ) ) ),
inference(rectify,[],[f34]) ).
fof(f34,plain,
! [X1,X0] :
( ~ test(X0)
| ( ( complement(X0,X1)
| c(X0) != X1 )
& ( c(X0) = X1
| ~ complement(X0,X1) ) ) ),
inference(nnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X1,X0] :
( ~ test(X0)
| ( complement(X0,X1)
<=> c(X0) = X1 ) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( test(X0)
=> ( complement(X0,X1)
<=> c(X0) = X1 ) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X3,X4] :
( test(X3)
=> ( c(X3) = X4
<=> complement(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_3) ).
fof(f50,plain,
test(sK1),
inference(cnf_transformation,[],[f33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KLE021+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/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 : n006.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:21:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.47 % (12080)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.49 % (12080)First to succeed.
% 0.20/0.50 % (12080)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (12080)------------------------------
% 0.20/0.50 % (12080)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (12080)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (12080)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (12080)Memory used [KB]: 6012
% 0.20/0.50 % (12080)Time elapsed: 0.115 s
% 0.20/0.50 % (12080)Instructions burned: 6 (million)
% 0.20/0.50 % (12080)------------------------------
% 0.20/0.50 % (12080)------------------------------
% 0.20/0.50 % (12076)Success in time 0.155 s
%------------------------------------------------------------------------------