TSTP Solution File: ARI606_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ARI606_1 : TPTP v8.1.2. Released v5.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 : n032.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 04:34:12 EDT 2024
% Result : Theorem 0.46s 0.66s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 4 unt; 2 typ; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 16 ( 7 ~; 2 |; 1 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number arithmetic : 41 ( 17 atm; 0 fun; 14 num; 10 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 4 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 1 usr; 2 con; 0-1 aty)
% Number of variables : 10 ( 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
f: $int > $int ).
tff(pred_def_3,type,
sQ0_eqProxy: ( $int * $int ) > $o ).
tff(f45,plain,
$false,
inference(evaluation,[],[f40]) ).
tff(f40,plain,
$less(5,2),
inference(resolution,[],[f35,f17]) ).
tff(f17,plain,
! [X0: $int,X1: $int] :
( ~ $less(f(X1),f(X0))
| $less(X1,X0) ),
inference(cnf_transformation,[],[f16]) ).
tff(f16,plain,
( $less(f(f(5)),f(f(2)))
& ! [X0: $int,X1: $int] :
( ~ $less(f(X1),f(X0))
| $less(X1,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,plain,
~ ( ! [X0: $int,X1: $int] :
( ~ $less(X1,X0)
=> ~ $less(f(X1),f(X0)) )
=> ~ $less(f(f(5)),f(f(2))) ),
inference(theory_normalization,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ! [X0: $int,X1: $int] :
( $lesseq(X0,X1)
=> $lesseq(f(X0),f(X1)) )
=> $lesseq(f(f(2)),f(f(5))) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ! [X0: $int,X1: $int] :
( $lesseq(X0,X1)
=> $lesseq(f(X0),f(X1)) )
=> $lesseq(f(f(2)),f(f(5))) ),
file('/export/starexec/sandbox2/tmp/tmp.WqCdRAd7cH/Vampire---4.8_17220',f_mon_implies_ff2_gt_ff5) ).
tff(f35,plain,
$less(f(5),f(2)),
inference(resolution,[],[f17,f18]) ).
tff(f18,plain,
$less(f(f(5)),f(f(2))),
inference(cnf_transformation,[],[f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : ARI606_1 : TPTP v8.1.2. Released v5.1.0.
% 0.09/0.11 % 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.11/0.29 % Computer : n032.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8042.1875MB
% 0.11/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 300
% 0.11/0.29 % DateTime : Fri May 3 21:42:08 EDT 2024
% 0.11/0.30 % CPUTime :
% 0.11/0.30 This is a TF0_THM_NEQ_ARI problem
% 0.11/0.30 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.WqCdRAd7cH/Vampire---4.8_17220
% 0.46/0.65 % (17513)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.46/0.65 % (17516)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.46/0.65 % (17515)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.46/0.65 % (17514)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.46/0.65 % (17509)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.46/0.65 % (17516)Also succeeded, but the first one will report.
% 0.46/0.65 % (17513)First to succeed.
% 0.46/0.65 % (17511)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.46/0.65 % (17510)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.46/0.65 % (17512)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.46/0.65 % (17513)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-17328"
% 0.46/0.66 % (17515)Also succeeded, but the first one will report.
% 0.46/0.66 % (17513)Refutation found. Thanks to Tanya!
% 0.46/0.66 % SZS status Theorem for Vampire---4
% 0.46/0.66 % SZS output start Proof for Vampire---4
% See solution above
% 0.46/0.66 % (17513)------------------------------
% 0.46/0.66 % (17513)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.46/0.66 % (17513)Termination reason: Refutation
% 0.46/0.66
% 0.46/0.66 % (17513)Memory used [KB]: 979
% 0.46/0.66 % (17513)Time elapsed: 0.002 s
% 0.46/0.66 % (17513)Instructions burned: 3 (million)
% 0.46/0.66 % (17328)Success in time 0.352 s
% 0.46/0.66 % Vampire---4.8 exiting
%------------------------------------------------------------------------------