TSTP Solution File: NUM303+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : NUM303+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 : n018.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:11 EDT 2024
% Result : Theorem 6.06s 1.27s
% Output : Refutation 6.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 14 unt; 0 def)
% Number of atoms : 67 ( 10 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 68 ( 31 ~; 23 |; 9 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 50 ( 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f46730,plain,
$false,
inference(subsumption_resolution,[],[f46729,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/sandbox/benchmark/theBenchmark.p',rdn_positive_less23) ).
fof(f46729,plain,
~ rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(subsumption_resolution,[],[f46620,f880]) ).
fof(f880,plain,
! [X1] : ~ less(X1,X1),
inference(equality_resolution,[],[f854]) ).
fof(f854,plain,
! [X0,X1] :
( X0 != X1
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f473]) ).
fof(f473,plain,
! [X0,X1] :
( ( less(X0,X1)
| X0 = X1
| less(X1,X0) )
& ( ( X0 != X1
& ~ less(X1,X0) )
| ~ less(X0,X1) ) ),
inference(flattening,[],[f472]) ).
fof(f472,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/sandbox/benchmark/theBenchmark.p',less_property) ).
fof(f46620,plain,
( less(n21,n21)
| ~ rdn_positive_less(rdnn(n2),rdnn(n3)) ),
inference(resolution,[],[f19781,f692]) ).
fof(f692,plain,
rdn_translate(n21,rdn_pos(rdn(rdnn(n1),rdnn(n2)))),
inference(cnf_transformation,[],[f22]) ).
fof(f22,axiom,
rdn_translate(n21,rdn_pos(rdn(rdnn(n1),rdnn(n2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdn21) ).
fof(f19781,plain,
! [X2,X0,X1] :
( ~ rdn_translate(X0,rdn_pos(rdn(rdnn(X1),X2)))
| less(X0,n21)
| ~ rdn_positive_less(X2,rdnn(n3)) ),
inference(resolution,[],[f1345,f863]) ).
fof(f863,plain,
! [X2,X3,X0,X1] :
( rdn_positive_less(rdn(rdnn(X0),X1),rdn(rdnn(X2),X3))
| ~ rdn_positive_less(X1,X3) ),
inference(cnf_transformation,[],[f440]) ).
fof(f440,plain,
! [X0,X1,X2,X3] :
( rdn_positive_less(rdn(rdnn(X0),X1),rdn(rdnn(X2),X3))
| ~ rdn_positive_less(X1,X3) ),
inference(ennf_transformation,[],[f409]) ).
fof(f409,plain,
! [X0,X1,X2,X3] :
( rdn_positive_less(X1,X3)
=> rdn_positive_less(rdn(rdnn(X0),X1),rdn(rdnn(X2),X3)) ),
inference(rectify,[],[f276]) ).
fof(f276,axiom,
! [X3,X4,X5,X6] :
( rdn_positive_less(X4,X6)
=> rdn_positive_less(rdn(rdnn(X3),X4),rdn(rdnn(X5),X6)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdn_positive_less_multi_digit_high) ).
fof(f1345,plain,
! [X0,X1] :
( ~ rdn_positive_less(X0,rdn(rdnn(n1),rdnn(n3)))
| less(X1,n21)
| ~ rdn_translate(X1,rdn_pos(X0)) ),
inference(resolution,[],[f865,f881]) ).
fof(f881,plain,
rdn_translate(n21,rdn_pos(rdn(rdnn(n1),rdnn(n3)))),
inference(forward_demodulation,[],[f691,f475]) ).
fof(f475,plain,
n21 = n31,
inference(cnf_transformation,[],[f404]) ).
fof(f404,plain,
n21 = n31,
inference(flattening,[],[f403]) ).
fof(f403,negated_conjecture,
~ ( n21 != n31 ),
inference(negated_conjecture,[],[f402]) ).
fof(f402,conjecture,
n21 != n31,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n31_not_n12) ).
fof(f691,plain,
rdn_translate(n31,rdn_pos(rdn(rdnn(n1),rdnn(n3)))),
inference(cnf_transformation,[],[f32]) ).
fof(f32,axiom,
rdn_translate(n31,rdn_pos(rdn(rdnn(n1),rdnn(n3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdn31) ).
fof(f865,plain,
! [X2,X3,X0,X1] :
( ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_positive_less(X2,X3)
| less(X0,X1)
| ~ rdn_translate(X0,rdn_pos(X2)) ),
inference(cnf_transformation,[],[f444]) ).
fof(f444,plain,
! [X0,X1,X2,X3] :
( less(X0,X1)
| ~ rdn_positive_less(X2,X3)
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_pos(X2)) ),
inference(flattening,[],[f443]) ).
fof(f443,plain,
! [X0,X1,X2,X3] :
( less(X0,X1)
| ~ rdn_positive_less(X2,X3)
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_pos(X2)) ),
inference(ennf_transformation,[],[f411]) ).
fof(f411,plain,
! [X0,X1,X2,X3] :
( ( rdn_positive_less(X2,X3)
& rdn_translate(X1,rdn_pos(X3))
& rdn_translate(X0,rdn_pos(X2)) )
=> less(X0,X1) ),
inference(rectify,[],[f281]) ).
fof(f281,axiom,
! [X0,X1,X9,X10] :
( ( rdn_positive_less(X9,X10)
& rdn_translate(X1,rdn_pos(X10))
& rdn_translate(X0,rdn_pos(X9)) )
=> less(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_entry_point_pos_pos) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.15 % Problem : NUM303+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.17 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.38 % Computer : n018.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.39 % CPULimit : 300
% 0.15/0.39 % WCLimit : 300
% 0.15/0.39 % DateTime : Tue Apr 30 00:01:28 EDT 2024
% 0.15/0.39 % CPUTime :
% 0.15/0.39 % (21801)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.42 % (21804)WARNING: value z3 for option sas not known
% 0.15/0.42 % (21802)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.42 % (21803)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.42 % (21805)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.42 % (21804)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.15/0.42 % (21806)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.15/0.42 % (21807)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.15/0.42 % (21808)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.22/0.46 TRYING [1]
% 0.22/0.46 TRYING [2]
% 0.22/0.50 TRYING [1]
% 0.22/0.51 TRYING [2]
% 0.22/0.52 TRYING [3]
% 1.21/0.59 TRYING [3]
% 1.71/0.66 TRYING [4]
% 2.69/0.82 TRYING [4]
% 6.06/1.26 TRYING [1]
% 6.06/1.27 % (21804)First to succeed.
% 6.06/1.27 TRYING [2]
% 6.06/1.27 % (21804)Refutation found. Thanks to Tanya!
% 6.06/1.27 % SZS status Theorem for theBenchmark
% 6.06/1.27 % SZS output start Proof for theBenchmark
% See solution above
% 6.06/1.27 % (21804)------------------------------
% 6.06/1.27 % (21804)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 6.06/1.27 % (21804)Termination reason: Refutation
% 6.06/1.27
% 6.06/1.27 % (21804)Memory used [KB]: 27904
% 6.06/1.27 % (21804)Time elapsed: 0.846 s
% 6.06/1.27 % (21804)Instructions burned: 2483 (million)
% 6.06/1.27 % (21804)------------------------------
% 6.06/1.27 % (21804)------------------------------
% 6.06/1.27 % (21801)Success in time 0.866 s
%------------------------------------------------------------------------------