TSTP Solution File: ARI602_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ARI602_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 : n016.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 02:09:29 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 ( 3 unt; 2 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 20 ( 9 ~; 3 |; 5 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 45 ( 19 atm; 0 fun; 14 num; 12 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-3 aty)
% Number of functors : 3 ( 1 usr; 2 con; 0-1 aty)
% Number of variables : 13 ( 9 !; 3 ?; 13 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
f: $int > $int ).
tff(pred_def_3,type,
sQ0_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f25,plain,
$false,
inference(evaluation,[],[f24]) ).
tff(f24,plain,
~ $less(4,5),
inference(resolution,[],[f19,f18]) ).
tff(f18,plain,
! [X1: $int] : $less(X1,f(X1)),
inference(cnf_transformation,[],[f17]) ).
tff(f17,plain,
( ! [X0: $int] :
( ~ $less(X0,f(5))
| ~ $less(4,X0) )
& ! [X1: $int] : $less(X1,f(X1)) ),
inference(rectify,[],[f16]) ).
tff(f16,plain,
( ! [X1: $int] :
( ~ $less(X1,f(5))
| ~ $less(4,X1) )
& ! [X0: $int] : $less(X0,f(X0)) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,plain,
~ ( ! [X0: $int] : $less(X0,f(X0))
=> ? [X1: $int] :
( $less(X1,f(5))
& $less(4,X1) ) ),
inference(theory_normalization,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ! [X0: $int] : $greater(f(X0),X0)
=> ? [X1: $int] :
( $less(X1,f(5))
& $less(4,X1) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ! [X0: $int] : $greater(f(X0),X0)
=> ? [X1: $int] :
( $less(X1,f(5))
& $less(4,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ORfoJeJSq0/Vampire---4.8_19578',fX_gt_X_implies_exist_ineq) ).
tff(f19,plain,
! [X0: $int] :
( ~ $less(X0,f(5))
| ~ $less(4,X0) ),
inference(cnf_transformation,[],[f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : ARI602_1 : TPTP v8.1.2. Released v5.1.0.
% 0.10/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.10/0.30 % Computer : n016.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % 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 19:25:56 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a TF0_THM_NEQ_ARI problem
% 0.10/0.31 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.ORfoJeJSq0/Vampire---4.8_19578
% 0.46/0.66 % (19686)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.66 % (19689)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.66 % (19688)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.66 % (19690)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.66 % (19686)First to succeed.
% 0.46/0.66 % (19691)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.66 % (19692)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.66 % (19693)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.66 % (19689)Also succeeded, but the first one will report.
% 0.46/0.66 % (19686)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 % (19686)------------------------------
% 0.46/0.66 % (19686)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.46/0.66 % (19686)Termination reason: Refutation
% 0.46/0.66
% 0.46/0.66 % (19686)Memory used [KB]: 960
% 0.46/0.66 % (19686)Time elapsed: 0.002 s
% 0.46/0.66 % (19686)Instructions burned: 2 (million)
% 0.46/0.66 % (19686)------------------------------
% 0.46/0.66 % (19686)------------------------------
% 0.46/0.66 % (19685)Success in time 0.348 s
% 0.46/0.66 % Vampire---4.8 exiting
%------------------------------------------------------------------------------