TSTP Solution File: ARI090_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ARI090_1 : TPTP v8.1.2. Released v5.0.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 : n027.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:08:09 EDT 2024
% Result : Theorem 0.60s 0.80s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 4 unt; 1 typ; 0 def)
% Number of atoms : 18 ( 17 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 15 ( 7 ~; 0 |; 4 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 44 ( 0 atm; 14 fun; 25 num; 5 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 1 usr; 4 con; 0-2 aty)
% Number of variables : 5 ( 3 !; 2 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_8,type,
sK0: $int ).
tff(f22,plain,
$false,
inference(subsumption_resolution,[],[f21,f20]) ).
tff(f20,plain,
2 != sK0,
inference(cnf_transformation,[],[f18]) ).
tff(f18,plain,
( ( 2 != sK0 )
& ( $sum(5,$uminus(3)) = sK0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f16,f17]) ).
tff(f17,plain,
( ? [X0: $int] :
( ( 2 != X0 )
& ( $sum(5,$uminus(3)) = X0 ) )
=> ( ( 2 != sK0 )
& ( $sum(5,$uminus(3)) = sK0 ) ) ),
introduced(choice_axiom,[]) ).
tff(f16,plain,
? [X0: $int] :
( ( 2 != X0 )
& ( $sum(5,$uminus(3)) = X0 ) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,plain,
~ ! [X0: $int] :
( ( $sum(5,$uminus(3)) = X0 )
=> ( 2 = X0 ) ),
inference(theory_normalization,[],[f2]) ).
tff(f2,negated_conjecture,
~ ! [X0: $int] :
( ( $difference(5,3) = X0 )
=> ( 2 = X0 ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
! [X0: $int] :
( ( $difference(5,3) = X0 )
=> ( 2 = X0 ) ),
file('/export/starexec/sandbox2/tmp/tmp.w8J8LDsTqN/Vampire---4.8_32392',diff_5_3_only_2) ).
tff(f21,plain,
2 = sK0,
inference(evaluation,[],[f19]) ).
tff(f19,plain,
$sum(5,$uminus(3)) = sK0,
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : ARI090_1 : TPTP v8.1.2. Released v5.0.0.
% 0.08/0.14 % 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.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 19:18:33 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TF0_THM_EQU_ARI problem
% 0.14/0.35 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.w8J8LDsTqN/Vampire---4.8_32392
% 0.60/0.80 % (32596)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.60/0.80 % (32594)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.60/0.80 % (32597)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.60/0.80 % (32600)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.60/0.80 % (32595)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.60/0.80 % (32598)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.60/0.80 % (32599)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.60/0.80 % (32601)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.60/0.80 % (32596)First to succeed.
% 0.60/0.80 % (32597)Also succeeded, but the first one will report.
% 0.60/0.80 % (32594)Also succeeded, but the first one will report.
% 0.60/0.80 % (32596)Refutation found. Thanks to Tanya!
% 0.60/0.80 % SZS status Theorem for Vampire---4
% 0.60/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.80 % (32596)------------------------------
% 0.60/0.80 % (32596)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.80 % (32596)Termination reason: Refutation
% 0.60/0.80
% 0.60/0.80 % (32596)Memory used [KB]: 957
% 0.60/0.80 % (32596)Time elapsed: 0.003 s
% 0.60/0.80 % (32596)Instructions burned: 2 (million)
% 0.60/0.80 % (32596)------------------------------
% 0.60/0.80 % (32596)------------------------------
% 0.60/0.80 % (32561)Success in time 0.436 s
% 0.60/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------