TSTP Solution File: KLE007+3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : KLE007+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n011.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 : Sun May 5 07:16:47 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 14 unt; 0 def)
% Number of atoms : 87 ( 46 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 83 ( 30 ~; 18 |; 24 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 41 ( 35 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f140,plain,
$false,
inference(trivial_inequality_removal,[],[f138]) ).
fof(f138,plain,
one != one,
inference(superposition,[],[f118,f115]) ).
fof(f115,plain,
one = addition(sK1,c(sK1)),
inference(resolution,[],[f88,f46]) ).
fof(f46,plain,
test(sK1),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
( one != addition(multiplication(addition(sK0,c(sK0)),sK1),multiplication(addition(sK0,c(sK0)),c(sK1)))
& test(sK0)
& test(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f30,f37]) ).
fof(f37,plain,
( ? [X0,X1] :
( one != addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1)))
& test(X0)
& test(X1) )
=> ( one != addition(multiplication(addition(sK0,c(sK0)),sK1),multiplication(addition(sK0,c(sK0)),c(sK1)))
& test(sK0)
& test(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
? [X0,X1] :
( one != addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1)))
& test(X0)
& test(X1) ),
inference(flattening,[],[f29]) ).
fof(f29,plain,
? [X0,X1] :
( one != addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1)))
& test(X0)
& test(X1) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
~ ! [X0,X1] :
( ( test(X0)
& test(X1) )
=> one = addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))) ),
inference(rectify,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X3,X4] :
( ( test(X3)
& test(X4) )
=> one = addition(multiplication(addition(X3,c(X3)),X4),multiplication(addition(X3,c(X3)),c(X4))) ),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X3,X4] :
( ( test(X3)
& test(X4) )
=> one = addition(multiplication(addition(X3,c(X3)),X4),multiplication(addition(X3,c(X3)),c(X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f88,plain,
! [X0] :
( ~ test(X0)
| one = addition(X0,c(X0)) ),
inference(forward_demodulation,[],[f87,f58]) ).
fof(f58,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/sandbox2/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f87,plain,
! [X0] :
( one = addition(c(X0),X0)
| ~ test(X0) ),
inference(resolution,[],[f65,f71]) ).
fof(f71,plain,
! [X0] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[],[f59]) ).
fof(f59,plain,
! [X0,X1] :
( complement(X0,X1)
| c(X0) != X1
| ~ test(X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0,X1] :
( ( ( c(X0) = X1
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(nnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1] :
( ( c(X0) = X1
<=> complement(X0,X1) )
| ~ test(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X3,X4] :
( test(X3)
=> ( c(X3) = X4
<=> complement(X3,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_3) ).
fof(f65,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| addition(X0,X1) = one ),
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
! [X0,X1] :
( ( complement(X1,X0)
| addition(X0,X1) != one
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1) )
& ( ( addition(X0,X1) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) )
| ~ complement(X1,X0) ) ),
inference(flattening,[],[f44]) ).
fof(f44,plain,
! [X0,X1] :
( ( complement(X1,X0)
| addition(X0,X1) != one
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1) )
& ( ( addition(X0,X1) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) )
| ~ complement(X1,X0) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( complement(X1,X0)
<=> ( addition(X0,X1) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) ) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X3,X4] :
( complement(X4,X3)
<=> ( one = addition(X3,X4)
& zero = multiplication(X4,X3)
& zero = multiplication(X3,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_2) ).
fof(f118,plain,
one != addition(sK1,c(sK1)),
inference(forward_demodulation,[],[f117,f53]) ).
fof(f53,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_left_identity) ).
fof(f117,plain,
one != addition(multiplication(one,sK1),c(sK1)),
inference(forward_demodulation,[],[f116,f53]) ).
fof(f116,plain,
one != addition(multiplication(one,sK1),multiplication(one,c(sK1))),
inference(backward_demodulation,[],[f48,f114]) ).
fof(f114,plain,
one = addition(sK0,c(sK0)),
inference(resolution,[],[f88,f47]) ).
fof(f47,plain,
test(sK0),
inference(cnf_transformation,[],[f38]) ).
fof(f48,plain,
one != addition(multiplication(addition(sK0,c(sK0)),sK1),multiplication(addition(sK0,c(sK0)),c(sK1))),
inference(cnf_transformation,[],[f38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE007+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 21:21:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (22600)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38 % (22601)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.39 % (22607)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.14/0.39 % (22603)WARNING: value z3 for option sas not known
% 0.14/0.39 % (22605)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.14/0.39 TRYING [1]
% 0.14/0.39 % (22602)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.39 TRYING [2]
% 0.14/0.39 % (22603)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.39 % (22606)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.39 % (22604)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.39 TRYING [1]
% 0.14/0.39 TRYING [2]
% 0.14/0.40 % (22606)First to succeed.
% 0.14/0.40 TRYING [3]
% 0.14/0.40 % (22606)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-22600"
% 0.14/0.40 % (22606)Refutation found. Thanks to Tanya!
% 0.14/0.40 % SZS status Theorem for theBenchmark
% 0.14/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.40 % (22606)------------------------------
% 0.14/0.40 % (22606)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.40 % (22606)Termination reason: Refutation
% 0.14/0.40
% 0.14/0.40 % (22606)Memory used [KB]: 900
% 0.14/0.40 % (22606)Time elapsed: 0.010 s
% 0.14/0.40 % (22606)Instructions burned: 10 (million)
% 0.14/0.40 % (22600)Success in time 0.037 s
%------------------------------------------------------------------------------