TSTP Solution File: NUM303+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM303+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n015.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 May 1 03:28:23 EDT 2024
% Result : Theorem 0.64s 0.83s
% Output : Refutation 0.64s
% 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 : 71 ( 34 ~; 23 |; 9 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 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 : 55 ( 55 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f637,plain,
$false,
inference(subsumption_resolution,[],[f635,f568]) ).
fof(f568,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/tmp/tmp.pvtQNMiioK/Vampire---4.8_32304',rdn_positive_less23) ).
fof(f635,plain,
~ rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(resolution,[],[f607,f577]) ).
fof(f577,plain,
rdn_translate(n31,rdn_pos(rdn(rdnn(n1),rdnn(n2)))),
inference(definition_unfolding,[],[f548,f540]) ).
fof(f540,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/sandbox2/tmp/tmp.pvtQNMiioK/Vampire---4.8_32304',n31_not_n12) ).
fof(f548,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/sandbox2/tmp/tmp.pvtQNMiioK/Vampire---4.8_32304',rdn21) ).
fof(f607,plain,
! [X0,X1] :
( ~ rdn_translate(n31,rdn_pos(rdn(rdnn(X0),X1)))
| ~ rdn_positive_less(X1,rdnn(n3)) ),
inference(resolution,[],[f593,f549]) ).
fof(f549,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/sandbox2/tmp/tmp.pvtQNMiioK/Vampire---4.8_32304',rdn31) ).
fof(f593,plain,
! [X2,X3,X0,X1,X4] :
( ~ rdn_translate(X0,rdn_pos(rdn(rdnn(X1),X2)))
| ~ rdn_translate(X0,rdn_pos(rdn(rdnn(X3),X4)))
| ~ rdn_positive_less(X4,X2) ),
inference(resolution,[],[f582,f560]) ).
fof(f560,plain,
! [X2,X3,X0,X1] :
( rdn_positive_less(rdn(rdnn(X0),X1),rdn(rdnn(X2),X3))
| ~ rdn_positive_less(X1,X3) ),
inference(cnf_transformation,[],[f535]) ).
fof(f535,plain,
! [X0,X1,X2,X3] :
( rdn_positive_less(rdn(rdnn(X0),X1),rdn(rdnn(X2),X3))
| ~ rdn_positive_less(X1,X3) ),
inference(ennf_transformation,[],[f413]) ).
fof(f413,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/sandbox2/tmp/tmp.pvtQNMiioK/Vampire---4.8_32304',rdn_positive_less_multi_digit_high) ).
fof(f582,plain,
! [X2,X0,X1] :
( ~ rdn_positive_less(X0,X1)
| ~ rdn_translate(X2,rdn_pos(X1))
| ~ rdn_translate(X2,rdn_pos(X0)) ),
inference(resolution,[],[f555,f578]) ).
fof(f578,plain,
! [X1] : ~ less(X1,X1),
inference(equality_resolution,[],[f546]) ).
fof(f546,plain,
! [X0,X1] :
( X0 != X1
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f539]) ).
fof(f539,plain,
! [X0,X1] :
( ( less(X0,X1)
| X0 = X1
| less(X1,X0) )
& ( ( X0 != X1
& ~ less(X1,X0) )
| ~ less(X0,X1) ) ),
inference(flattening,[],[f538]) ).
fof(f538,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/tmp/tmp.pvtQNMiioK/Vampire---4.8_32304',less_property) ).
fof(f555,plain,
! [X2,X3,X0,X1] :
( less(X0,X1)
| ~ rdn_positive_less(X2,X3)
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_pos(X2)) ),
inference(cnf_transformation,[],[f534]) ).
fof(f534,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,[],[f533]) ).
fof(f533,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,[],[f412]) ).
fof(f412,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/sandbox2/tmp/tmp.pvtQNMiioK/Vampire---4.8_32304',less_entry_point_pos_pos) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM303+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.32 % Computer : n015.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Tue Apr 30 17:15:48 EDT 2024
% 0.13/0.32 % CPUTime :
% 0.13/0.32 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.33 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.pvtQNMiioK/Vampire---4.8_32304
% 0.64/0.82 % (32418)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.64/0.82 % (32415)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.64/0.82 % (32419)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.64/0.82 % (32420)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.64/0.82 % (32417)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.64/0.82 % (32422)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.64/0.82 % (32421)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.64/0.82 % (32416)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.64/0.82 % (32418)Refutation not found, incomplete strategy% (32418)------------------------------
% 0.64/0.82 % (32418)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.64/0.82 % (32418)Termination reason: Refutation not found, incomplete strategy
% 0.64/0.82
% 0.64/0.82 % (32418)Memory used [KB]: 1261
% 0.64/0.82 % (32418)Time elapsed: 0.004 s
% 0.64/0.82 % (32418)Instructions burned: 3 (million)
% 0.64/0.82 % (32418)------------------------------
% 0.64/0.82 % (32418)------------------------------
% 0.64/0.82 % (32415)Refutation not found, incomplete strategy% (32415)------------------------------
% 0.64/0.82 % (32415)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.64/0.82 % (32415)Termination reason: Refutation not found, incomplete strategy
% 0.64/0.82
% 0.64/0.82 % (32415)Memory used [KB]: 1273
% 0.64/0.82 % (32415)Time elapsed: 0.003 s
% 0.64/0.82 % (32415)Instructions burned: 4 (million)
% 0.64/0.82 % (32415)------------------------------
% 0.64/0.82 % (32415)------------------------------
% 0.64/0.82 % (32422)Refutation not found, incomplete strategy% (32422)------------------------------
% 0.64/0.82 % (32422)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.64/0.82 % (32422)Termination reason: Refutation not found, incomplete strategy
% 0.64/0.82
% 0.64/0.82 % (32422)Memory used [KB]: 1262
% 0.64/0.82 % (32422)Time elapsed: 0.004 s
% 0.64/0.82 % (32422)Instructions burned: 4 (million)
% 0.64/0.82 % (32422)------------------------------
% 0.64/0.82 % (32422)------------------------------
% 0.64/0.83 % (32423)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2995ds/55Mi)
% 0.64/0.83 % (32424)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2995ds/50Mi)
% 0.64/0.83 % (32417)First to succeed.
% 0.64/0.83 % (32425)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/208Mi)
% 0.64/0.83 % (32423)Refutation not found, incomplete strategy% (32423)------------------------------
% 0.64/0.83 % (32423)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.64/0.83 % (32423)Termination reason: Refutation not found, incomplete strategy
% 0.64/0.83
% 0.64/0.83 % (32423)Memory used [KB]: 1258
% 0.64/0.83 % (32423)Time elapsed: 0.003 s
% 0.64/0.83 % (32423)Instructions burned: 3 (million)
% 0.64/0.83 % (32423)------------------------------
% 0.64/0.83 % (32423)------------------------------
% 0.64/0.83 % (32417)Refutation found. Thanks to Tanya!
% 0.64/0.83 % SZS status Theorem for Vampire---4
% 0.64/0.83 % SZS output start Proof for Vampire---4
% See solution above
% 0.64/0.83 % (32417)------------------------------
% 0.64/0.83 % (32417)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.64/0.83 % (32417)Termination reason: Refutation
% 0.64/0.83
% 0.64/0.83 % (32417)Memory used [KB]: 1363
% 0.64/0.83 % (32417)Time elapsed: 0.009 s
% 0.64/0.83 % (32417)Instructions burned: 13 (million)
% 0.64/0.83 % (32417)------------------------------
% 0.64/0.83 % (32417)------------------------------
% 0.64/0.83 % (32414)Success in time 0.497 s
% 0.64/0.83 % Vampire---4.8 exiting
%------------------------------------------------------------------------------