TSTP Solution File: NUM854+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM854+1 : TPTP v8.1.2. Released v4.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n004.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:16:00 EDT 2024
% Result : Theorem 0.59s 0.76s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 8 unt; 1 typ; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 2 ( 4 avg)
% Number of connectives : 10 ( 6 ~; 2 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 38 ( 38 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 4 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 13 ( 12 !; 0 ?; 4 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_5,type,
sQ1_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f181,plain,
$false,
inference(subsumption_resolution,[],[f178,f107]) ).
tff(f107,plain,
greater(vd508,vd509),
inference(cnf_transformation,[],[f4]) ).
tff(f4,axiom,
greater(vd508,vd509),
file('/export/starexec/sandbox/tmp/tmp.dmDbIzU4qT/Vampire---4.8_4723','holds(conjunct1(314), 510, 0)') ).
tff(f178,plain,
~ greater(vd508,vd509),
inference(resolution,[],[f125,f106]) ).
tff(f106,plain,
~ greater(vmul(vd508,vd511),vmul(vd509,vd511)),
inference(cnf_transformation,[],[f61]) ).
tff(f61,plain,
~ greater(vmul(vd508,vd511),vmul(vd509,vd511)),
inference(flattening,[],[f2]) ).
tff(f2,negated_conjecture,
~ greater(vmul(vd508,vd511),vmul(vd509,vd511)),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
greater(vmul(vd508,vd511),vmul(vd509,vd511)),
file('/export/starexec/sandbox/tmp/tmp.dmDbIzU4qT/Vampire---4.8_4723','holds(conjunct1(315), 514, 0)') ).
tff(f125,plain,
! [X2: $i,X0: $i,X1: $i] :
( greater(vmul(X1,X0),vmul(X2,X0))
| ~ greater(X1,X2) ),
inference(cnf_transformation,[],[f94]) ).
tff(f94,plain,
! [X0,X1,X2] :
( greater(vmul(X1,X0),vmul(X2,X0))
| ~ greater(X1,X2) ),
inference(ennf_transformation,[],[f75]) ).
tff(f75,plain,
! [X0,X1,X2] :
( greater(X1,X2)
=> greater(vmul(X1,X0),vmul(X2,X0)) ),
inference(rectify,[],[f10]) ).
tff(f10,axiom,
! [X9,X14,X15] :
( greater(X14,X15)
=> greater(vmul(X14,X9),vmul(X15,X9)) ),
file('/export/starexec/sandbox/tmp/tmp.dmDbIzU4qT/Vampire---4.8_4723','ass(cond(299, 0), 2)') ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM854+1 : TPTP v8.1.2. Released v4.1.0.
% 0.12/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n004.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 15:05:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.dmDbIzU4qT/Vampire---4.8_4723
% 0.59/0.75 % (4991)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 (2996ds/34Mi)
% 0.59/0.76 % (4993)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.59/0.76 % (4994)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.59/0.76 % (4992)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 (2996ds/51Mi)
% 0.59/0.76 % (4996)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.59/0.76 % (4995)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 (2996ds/34Mi)
% 0.59/0.76 % (4997)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 (2996ds/83Mi)
% 0.59/0.76 % (4998)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 (2996ds/56Mi)
% 0.59/0.76 % (4991)First to succeed.
% 0.59/0.76 % (4991)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4980"
% 0.59/0.76 % (4991)Refutation found. Thanks to Tanya!
% 0.59/0.76 % SZS status Theorem for Vampire---4
% 0.59/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.76 % (4991)------------------------------
% 0.59/0.76 % (4991)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76 % (4991)Termination reason: Refutation
% 0.59/0.76
% 0.59/0.76 % (4991)Memory used [KB]: 1077
% 0.59/0.76 % (4991)Time elapsed: 0.003 s
% 0.59/0.76 % (4991)Instructions burned: 4 (million)
% 0.59/0.76 % (4980)Success in time 0.388 s
% 0.59/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------