TSTP Solution File: NUM297+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : NUM297+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 : n031.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 : Tue Apr 30 14:14:10 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 14 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 62 ( 31 ~; 23 |; 5 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 38 ( 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1510,plain,
$false,
inference(resolution,[],[f1509,f502]) ).
fof(f502,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(cnf_transformation,[],[f130]) ).
fof(f130,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdnn2) ).
fof(f1509,plain,
~ rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(resolution,[],[f1508,f501]) ).
fof(f501,plain,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
inference(cnf_transformation,[],[f132]) ).
fof(f132,axiom,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdnn4) ).
fof(f1508,plain,
( ~ rdn_translate(nn4,rdn_neg(rdnn(n4)))
| ~ rdn_translate(nn2,rdn_neg(rdnn(n2))) ),
inference(resolution,[],[f1470,f491]) ).
fof(f491,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(cnf_transformation,[],[f268]) ).
fof(f268,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_positive_less23) ).
fof(f1470,plain,
! [X0] :
( ~ rdn_positive_less(rdnn(X0),rdnn(n3))
| ~ rdn_translate(nn4,rdn_neg(rdnn(n4)))
| ~ rdn_translate(nn2,rdn_neg(rdnn(X0))) ),
inference(resolution,[],[f1222,f487]) ).
fof(f487,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(cnf_transformation,[],[f269]) ).
fof(f269,axiom,
rdn_positive_less(rdnn(n3),rdnn(n4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_positive_less34) ).
fof(f1222,plain,
! [X2,X0,X1] :
( ~ rdn_positive_less(rdnn(X2),rdnn(X1))
| ~ rdn_positive_less(rdnn(X0),rdnn(X2))
| ~ rdn_translate(nn4,rdn_neg(rdnn(X1)))
| ~ rdn_translate(nn2,rdn_neg(rdnn(X0))) ),
inference(resolution,[],[f1190,f860]) ).
fof(f860,plain,
! [X2,X0,X1] :
( rdn_positive_less(rdnn(X0),rdnn(X2))
| ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X0),rdnn(X1)) ),
inference(cnf_transformation,[],[f439]) ).
fof(f439,plain,
! [X0,X1,X2] :
( rdn_positive_less(rdnn(X0),rdnn(X2))
| ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X0),rdnn(X1)) ),
inference(flattening,[],[f438]) ).
fof(f438,plain,
! [X0,X1,X2] :
( rdn_positive_less(rdnn(X0),rdnn(X2))
| ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X0),rdnn(X1)) ),
inference(ennf_transformation,[],[f275]) ).
fof(f275,axiom,
! [X0,X1,X2] :
( ( rdn_positive_less(rdnn(X1),rdnn(X2))
& rdn_positive_less(rdnn(X0),rdnn(X1)) )
=> rdn_positive_less(rdnn(X0),rdnn(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_positive_less_transitivity) ).
fof(f1190,plain,
! [X0,X1] :
( ~ rdn_positive_less(X0,X1)
| ~ rdn_translate(nn2,rdn_neg(X0))
| ~ rdn_translate(nn4,rdn_neg(X1)) ),
inference(resolution,[],[f866,f475]) ).
fof(f475,plain,
~ less(nn4,nn2),
inference(cnf_transformation,[],[f404]) ).
fof(f404,plain,
~ less(nn4,nn2),
inference(flattening,[],[f403]) ).
fof(f403,negated_conjecture,
~ less(nn4,nn2),
inference(negated_conjecture,[],[f402]) ).
fof(f402,conjecture,
less(nn4,nn2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nn4_less_nn2) ).
fof(f866,plain,
! [X2,X3,X0,X1] :
( less(X0,X1)
| ~ rdn_positive_less(X3,X2)
| ~ rdn_translate(X1,rdn_neg(X3))
| ~ rdn_translate(X0,rdn_neg(X2)) ),
inference(cnf_transformation,[],[f446]) ).
fof(f446,plain,
! [X0,X1,X2,X3] :
( less(X0,X1)
| ~ rdn_positive_less(X3,X2)
| ~ rdn_translate(X1,rdn_neg(X3))
| ~ rdn_translate(X0,rdn_neg(X2)) ),
inference(flattening,[],[f445]) ).
fof(f445,plain,
! [X0,X1,X2,X3] :
( less(X0,X1)
| ~ rdn_positive_less(X3,X2)
| ~ rdn_translate(X1,rdn_neg(X3))
| ~ rdn_translate(X0,rdn_neg(X2)) ),
inference(ennf_transformation,[],[f412]) ).
fof(f412,plain,
! [X0,X1,X2,X3] :
( ( rdn_positive_less(X3,X2)
& rdn_translate(X1,rdn_neg(X3))
& rdn_translate(X0,rdn_neg(X2)) )
=> less(X0,X1) ),
inference(rectify,[],[f283]) ).
fof(f283,axiom,
! [X0,X1,X9,X10] :
( ( rdn_positive_less(X10,X9)
& rdn_translate(X1,rdn_neg(X10))
& rdn_translate(X0,rdn_neg(X9)) )
=> less(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_entry_point_neg_neg) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : NUM297+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.10 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.29 % Computer : n031.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Apr 30 00:40:58 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 % (17914)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.33 % (17917)WARNING: value z3 for option sas not known
% 0.14/0.33 % (17918)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.33 % (17916)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.33 % (17919)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.33 % (17921)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.33 % (17917)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.33 % (17915)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.33 % (17920)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.36 TRYING [1]
% 0.14/0.37 TRYING [2]
% 0.14/0.39 % (17920)First to succeed.
% 0.14/0.39 % (17920)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.39 % (17920)------------------------------
% 0.14/0.39 % (17920)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.39 % (17920)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (17920)Memory used [KB]: 2207
% 0.14/0.39 % (17920)Time elapsed: 0.064 s
% 0.14/0.39 % (17920)Instructions burned: 136 (million)
% 0.14/0.39 % (17920)------------------------------
% 0.14/0.39 % (17920)------------------------------
% 0.14/0.39 % (17914)Success in time 0.089 s
%------------------------------------------------------------------------------