TSTP Solution File: KLE007+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : KLE007+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 : n029.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:43 EDT 2022
% Result : Theorem 0.19s 0.47s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of formulae : 54 ( 31 unt; 0 def)
% Number of atoms : 120 ( 68 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 101 ( 35 ~; 25 |; 30 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 49 ( 41 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f132,plain,
$false,
inference(subsumption_resolution,[],[f131,f91]) ).
fof(f91,plain,
one != sF8,
inference(definition_folding,[],[f70,f90,f89,f88,f86,f85,f87,f86,f85]) ).
fof(f87,plain,
sF5 = multiplication(sF4,sK1),
introduced(function_definition,[]) ).
fof(f85,plain,
c(sK0) = sF3,
introduced(function_definition,[]) ).
fof(f86,plain,
sF4 = addition(sK0,sF3),
introduced(function_definition,[]) ).
fof(f88,plain,
c(sK1) = sF6,
introduced(function_definition,[]) ).
fof(f89,plain,
sF7 = multiplication(sF4,sF6),
introduced(function_definition,[]) ).
fof(f90,plain,
addition(sF5,sF7) = sF8,
introduced(function_definition,[]) ).
fof(f70,plain,
one != addition(multiplication(addition(sK0,c(sK0)),sK1),multiplication(addition(sK0,c(sK0)),c(sK1))),
inference(cnf_transformation,[],[f48]) ).
fof(f48,plain,
( test(sK1)
& test(sK0)
& one != addition(multiplication(addition(sK0,c(sK0)),sK1),multiplication(addition(sK0,c(sK0)),c(sK1))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f46,f47]) ).
fof(f47,plain,
( ? [X0,X1] :
( test(X1)
& test(X0)
& one != addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))) )
=> ( test(sK1)
& test(sK0)
& one != addition(multiplication(addition(sK0,c(sK0)),sK1),multiplication(addition(sK0,c(sK0)),c(sK1))) ) ),
introduced(choice_axiom,[]) ).
fof(f46,plain,
? [X0,X1] :
( test(X1)
& test(X0)
& one != addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))) ),
inference(rectify,[],[f40]) ).
fof(f40,plain,
? [X1,X0] :
( test(X0)
& test(X1)
& one != addition(multiplication(addition(X1,c(X1)),X0),multiplication(addition(X1,c(X1)),c(X0))) ),
inference(flattening,[],[f39]) ).
fof(f39,plain,
? [X0,X1] :
( one != addition(multiplication(addition(X1,c(X1)),X0),multiplication(addition(X1,c(X1)),c(X0)))
& test(X0)
& test(X1) ),
inference(ennf_transformation,[],[f23]) ).
fof(f23,plain,
~ ! [X0,X1] :
( ( test(X0)
& test(X1) )
=> one = addition(multiplication(addition(X1,c(X1)),X0),multiplication(addition(X1,c(X1)),c(X0))) ),
inference(rectify,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X4,X3] :
( ( test(X4)
& test(X3) )
=> one = addition(multiplication(addition(X3,c(X3)),X4),multiplication(addition(X3,c(X3)),c(X4))) ),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X4,X3] :
( ( test(X4)
& test(X3) )
=> one = addition(multiplication(addition(X3,c(X3)),X4),multiplication(addition(X3,c(X3)),c(X4))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f131,plain,
one = sF8,
inference(forward_demodulation,[],[f130,f122]) ).
fof(f122,plain,
one = addition(sK1,sF6),
inference(superposition,[],[f81,f112]) ).
fof(f112,plain,
one = addition(sF6,sK1),
inference(resolution,[],[f63,f96]) ).
fof(f96,plain,
complement(sK1,sF6),
inference(subsumption_resolution,[],[f95,f72]) ).
fof(f72,plain,
test(sK1),
inference(cnf_transformation,[],[f48]) ).
fof(f95,plain,
( complement(sK1,sF6)
| ~ test(sK1) ),
inference(superposition,[],[f84,f88]) ).
fof(f84,plain,
! [X0] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[],[f68]) ).
fof(f68,plain,
! [X0,X1] :
( complement(X0,X1)
| c(X0) != X1
| ~ test(X0) ),
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
! [X0,X1] :
( ( ( complement(X0,X1)
| c(X0) != X1 )
& ( c(X0) = X1
| ~ complement(X0,X1) ) )
| ~ test(X0) ),
inference(rectify,[],[f44]) ).
fof(f44,plain,
! [X1,X0] :
( ( ( complement(X1,X0)
| c(X1) != X0 )
& ( c(X1) = X0
| ~ complement(X1,X0) ) )
| ~ test(X1) ),
inference(nnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X1,X0] :
( ( complement(X1,X0)
<=> c(X1) = X0 )
| ~ test(X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f30,plain,
! [X1,X0] :
( test(X1)
=> ( complement(X1,X0)
<=> c(X1) = X0 ) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X4,X3] :
( test(X3)
=> ( complement(X3,X4)
<=> c(X3) = X4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_3) ).
fof(f63,plain,
! [X0,X1] :
( ~ complement(X0,X1)
| addition(X1,X0) = one ),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0,X1] :
( ( complement(X0,X1)
| zero != multiplication(X0,X1)
| zero != multiplication(X1,X0)
| addition(X1,X0) != one )
& ( ( zero = multiplication(X0,X1)
& zero = multiplication(X1,X0)
& addition(X1,X0) = one )
| ~ complement(X0,X1) ) ),
inference(rectify,[],[f42]) ).
fof(f42,plain,
! [X1,X0] :
( ( complement(X1,X0)
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1)
| addition(X0,X1) != one )
& ( ( zero = multiplication(X1,X0)
& zero = multiplication(X0,X1)
& addition(X0,X1) = one )
| ~ complement(X1,X0) ) ),
inference(flattening,[],[f41]) ).
fof(f41,plain,
! [X1,X0] :
( ( complement(X1,X0)
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1)
| addition(X0,X1) != one )
& ( ( zero = multiplication(X1,X0)
& zero = multiplication(X0,X1)
& addition(X0,X1) = one )
| ~ complement(X1,X0) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X1,X0] :
( complement(X1,X0)
<=> ( zero = multiplication(X1,X0)
& zero = multiplication(X0,X1)
& addition(X0,X1) = one ) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X3,X4] :
( complement(X4,X3)
<=> ( one = addition(X3,X4)
& zero = multiplication(X3,X4)
& zero = multiplication(X4,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_2) ).
fof(f81,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f56]) ).
fof(f56,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(rectify,[],[f22]) ).
fof(f22,plain,
! [X1,X0] : 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(f130,plain,
addition(sK1,sF6) = sF8,
inference(forward_demodulation,[],[f129,f128]) ).
fof(f128,plain,
sF6 = sF7,
inference(forward_demodulation,[],[f125,f75]) ).
fof(f75,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(f125,plain,
sF7 = multiplication(one,sF6),
inference(superposition,[],[f89,f123]) ).
fof(f123,plain,
one = sF4,
inference(superposition,[],[f115,f86]) ).
fof(f115,plain,
one = addition(sK0,sF3),
inference(superposition,[],[f111,f81]) ).
fof(f111,plain,
one = addition(sF3,sK0),
inference(resolution,[],[f63,f97]) ).
fof(f97,plain,
complement(sK0,sF3),
inference(subsumption_resolution,[],[f94,f71]) ).
fof(f71,plain,
test(sK0),
inference(cnf_transformation,[],[f48]) ).
fof(f94,plain,
( ~ test(sK0)
| complement(sK0,sF3) ),
inference(superposition,[],[f84,f85]) ).
fof(f129,plain,
addition(sK1,sF7) = sF8,
inference(superposition,[],[f90,f127]) ).
fof(f127,plain,
sF5 = sK1,
inference(forward_demodulation,[],[f126,f75]) ).
fof(f126,plain,
sF5 = multiplication(one,sK1),
inference(superposition,[],[f87,f123]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE007+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/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.34 % Computer : n029.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:31:26 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 % (20461)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.19/0.45 % (20470)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.19/0.47 % (20461)First to succeed.
% 0.19/0.47 % (20461)Refutation found. Thanks to Tanya!
% 0.19/0.47 % SZS status Theorem for theBenchmark
% 0.19/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.47 % (20461)------------------------------
% 0.19/0.47 % (20461)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47 % (20461)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.47 % (20461)Termination reason: Refutation
% 0.19/0.47
% 0.19/0.47 % (20461)Memory used [KB]: 5500
% 0.19/0.47 % (20461)Time elapsed: 0.065 s
% 0.19/0.47 % (20461)Instructions burned: 4 (million)
% 0.19/0.47 % (20461)------------------------------
% 0.19/0.47 % (20461)------------------------------
% 0.19/0.47 % (20448)Success in time 0.129 s
%------------------------------------------------------------------------------