TSTP Solution File: NUM341+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : NUM341+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n010.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 08:18:48 EDT 2024
% Result : Theorem 0.21s 0.40s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 10 unt; 0 def)
% Number of atoms : 104 ( 13 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 108 ( 44 ~; 36 |; 17 &)
% ( 6 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 103 ( 97 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1443,plain,
$false,
inference(unit_resulting_resolution,[],[f884,f1236,f1277,f888]) ).
fof(f888,plain,
! [X0,X1] :
( ~ sP1(X1)
| ~ sP0(X0)
| less(X0,X1) ),
inference(general_splitting,[],[f886,f887_D]) ).
fof(f887,plain,
! [X3,X1] :
( ~ rdn_translate(X1,rdn_pos(X3))
| sP1(X1) ),
inference(cnf_transformation,[],[f887_D]) ).
fof(f887_D,plain,
! [X1] :
( ! [X3] : ~ rdn_translate(X1,rdn_pos(X3))
<=> ~ sP1(X1) ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP1])]) ).
fof(f886,plain,
! [X3,X0,X1] :
( less(X0,X1)
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ sP0(X0) ),
inference(general_splitting,[],[f868,f885_D]) ).
fof(f885,plain,
! [X2,X0] :
( ~ rdn_translate(X0,rdn_neg(X2))
| sP0(X0) ),
inference(cnf_transformation,[],[f885_D]) ).
fof(f885_D,plain,
! [X0] :
( ! [X2] : ~ rdn_translate(X0,rdn_neg(X2))
<=> ~ sP0(X0) ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP0])]) ).
fof(f868,plain,
! [X2,X3,X0,X1] :
( less(X0,X1)
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_neg(X2)) ),
inference(cnf_transformation,[],[f442]) ).
fof(f442,plain,
! [X0,X1,X2,X3] :
( less(X0,X1)
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_neg(X2)) ),
inference(flattening,[],[f441]) ).
fof(f441,plain,
! [X0,X1,X2,X3] :
( less(X0,X1)
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_neg(X2)) ),
inference(ennf_transformation,[],[f409]) ).
fof(f409,plain,
! [X0,X1,X2,X3] :
( ( rdn_translate(X1,rdn_pos(X3))
& rdn_translate(X0,rdn_neg(X2)) )
=> less(X0,X1) ),
inference(rectify,[],[f282]) ).
fof(f282,axiom,
! [X0,X1,X9,X10] :
( ( rdn_translate(X1,rdn_pos(X10))
& rdn_translate(X0,rdn_neg(X9)) )
=> less(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_entry_point_neg_pos) ).
fof(f1277,plain,
! [X0] : sP1(X0),
inference(unit_resulting_resolution,[],[f1067,f887]) ).
fof(f1067,plain,
! [X0,X1] : rdn_translate(X0,X1),
inference(superposition,[],[f1065,f926]) ).
fof(f926,plain,
! [X2,X3] : X2 = X3,
inference(subsumption_resolution,[],[f925,f923]) ).
fof(f923,plain,
! [X2,X0,X1] : sum(X1,X2,X0),
inference(subsumption_resolution,[],[f866,f478]) ).
fof(f478,plain,
! [X2,X0,X1] :
( difference(X2,X0,X1)
| sum(X0,X1,X2) ),
inference(cnf_transformation,[],[f473]) ).
fof(f473,plain,
! [X0,X1,X2] :
( ( ~ difference(X2,X0,X1)
| ~ difference(X2,X1,X0)
| ~ sum(X0,X1,X2) )
& ( ( difference(X2,X0,X1)
& difference(X2,X1,X0) )
| sum(X0,X1,X2) ) ),
inference(flattening,[],[f472]) ).
fof(f472,plain,
! [X0,X1,X2] :
( ( ~ difference(X2,X0,X1)
| ~ difference(X2,X1,X0)
| ~ sum(X0,X1,X2) )
& ( ( difference(X2,X0,X1)
& difference(X2,X1,X0) )
| sum(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f426]) ).
fof(f426,plain,
! [X0,X1,X2] :
( sum(X0,X1,X2)
<~> ( difference(X2,X0,X1)
& difference(X2,X1,X0) ) ),
inference(ennf_transformation,[],[f403]) ).
fof(f403,negated_conjecture,
~ ? [X0,X1,X2] :
( sum(X0,X1,X2)
<=> ( difference(X2,X0,X1)
& difference(X2,X1,X0) ) ),
inference(negated_conjecture,[],[f402]) ).
fof(f402,conjecture,
? [X0,X1,X2] :
( sum(X0,X1,X2)
<=> ( difference(X2,X0,X1)
& difference(X2,X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_same_as_subtract) ).
fof(f866,plain,
! [X2,X0,X1] :
( sum(X1,X2,X0)
| ~ difference(X0,X1,X2) ),
inference(cnf_transformation,[],[f476]) ).
fof(f476,plain,
! [X0,X1,X2] :
( ( sum(X1,X2,X0)
| ~ difference(X0,X1,X2) )
& ( difference(X0,X1,X2)
| ~ sum(X1,X2,X0) ) ),
inference(nnf_transformation,[],[f296]) ).
fof(f296,axiom,
! [X0,X1,X2] :
( sum(X1,X2,X0)
<=> difference(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',minus_entry_point) ).
fof(f925,plain,
! [X2,X3,X0,X1] :
( X2 = X3
| ~ sum(X0,X1,X2) ),
inference(subsumption_resolution,[],[f871,f923]) ).
fof(f871,plain,
! [X2,X3,X0,X1] :
( X2 = X3
| ~ sum(X0,X1,X3)
| ~ sum(X0,X1,X2) ),
inference(cnf_transformation,[],[f448]) ).
fof(f448,plain,
! [X0,X1,X2,X3] :
( X2 = X3
| ~ sum(X0,X1,X3)
| ~ sum(X0,X1,X2) ),
inference(flattening,[],[f447]) ).
fof(f447,plain,
! [X0,X1,X2,X3] :
( X2 = X3
| ~ sum(X0,X1,X3)
| ~ sum(X0,X1,X2) ),
inference(ennf_transformation,[],[f412]) ).
fof(f412,plain,
! [X0,X1,X2,X3] :
( ( sum(X0,X1,X3)
& sum(X0,X1,X2) )
=> X2 = X3 ),
inference(rectify,[],[f293]) ).
fof(f293,axiom,
! [X0,X1,X14,X15] :
( ( sum(X0,X1,X15)
& sum(X0,X1,X14) )
=> X14 = X15 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unique_sum) ).
fof(f1065,plain,
! [X0] : rdn_translate(nn9,X0),
inference(superposition,[],[f498,f926]) ).
fof(f498,plain,
rdn_translate(nn9,rdn_neg(rdnn(n9))),
inference(cnf_transformation,[],[f137]) ).
fof(f137,axiom,
rdn_translate(nn9,rdn_neg(rdnn(n9))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdnn9) ).
fof(f1236,plain,
! [X0] : sP0(X0),
inference(unit_resulting_resolution,[],[f1067,f885]) ).
fof(f884,plain,
! [X1] : ~ less(X1,X1),
inference(equality_resolution,[],[f858]) ).
fof(f858,plain,
! [X0,X1] :
( X0 != X1
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f475]) ).
fof(f475,plain,
! [X0,X1] :
( ( less(X0,X1)
| X0 = X1
| less(X1,X0) )
& ( ( X0 != X1
& ~ less(X1,X0) )
| ~ less(X0,X1) ) ),
inference(flattening,[],[f474]) ).
fof(f474,plain,
! [X0,X1] :
( ( less(X0,X1)
| X0 = X1
| less(X1,X0) )
& ( ( X0 != X1
& ~ less(X1,X0) )
| ~ less(X0,X1) ) ),
inference(nnf_transformation,[],[f284]) ).
fof(f284,axiom,
! [X0,X1] :
( less(X0,X1)
<=> ( X0 != X1
& ~ less(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_property) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM341+1 : TPTP v8.1.2. Released v3.1.0.
% 0.13/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n010.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 15:21:38 EDT 2024
% 0.21/0.35 % CPUTime :
% 0.21/0.35 % (14724)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.38 % (14727)WARNING: value z3 for option sas not known
% 0.21/0.38 % (14725)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.38 % (14729)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.21/0.38 % (14730)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.21/0.38 % (14728)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.38 % (14726)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.38 % (14727)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.21/0.38 % (14731)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.21/0.40 % (14731)First to succeed.
% 0.21/0.40 % (14731)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-14724"
% 0.21/0.40 % (14731)Refutation found. Thanks to Tanya!
% 0.21/0.40 % SZS status Theorem for theBenchmark
% 0.21/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.40 % (14731)------------------------------
% 0.21/0.40 % (14731)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.40 % (14731)Termination reason: Refutation
% 0.21/0.40
% 0.21/0.40 % (14731)Memory used [KB]: 1417
% 0.21/0.40 % (14731)Time elapsed: 0.018 s
% 0.21/0.40 % (14731)Instructions burned: 36 (million)
% 0.21/0.40 % (14724)Success in time 0.042 s
%------------------------------------------------------------------------------