TSTP Solution File: ARI463_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ARI463_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 : n005.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:03 EDT 2024
% Result : Theorem 0.55s 0.74s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 10 unt; 1 typ; 0 def)
% Number of atoms : 12 ( 6 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 5 ~; 0 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number arithmetic : 31 ( 0 atm; 14 fun; 12 num; 5 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 0 usr; 1 con; 0-1 aty)
% Number of variables : 5 ( 5 !; 0 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_2,type,
sQ0_eqProxy: ( $real * $real ) > $o ).
tff(f25,plain,
$false,
inference(subsumption_resolution,[],[f24,f23]) ).
tff(f23,plain,
! [X0: $real] : sQ0_eqProxy(X0,X0),
inference(evaluation,[],[f19]) ).
tff(f19,plain,
! [X0: $real] : sQ0_eqProxy($uminus($uminus(X0)),X0),
inference(equality_proxy_replacement,[],[f13,f16]) ).
tff(f16,plain,
! [X0: $real,X1: $real] :
( sQ0_eqProxy(X0,X1)
<=> ( X0 = X1 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ0_eqProxy])]) ).
tff(f13,plain,
! [X0: $real] : ( $uminus($uminus(X0)) = X0 ),
introduced(theory_axiom_148,[]) ).
tff(f24,plain,
~ sQ0_eqProxy(0.75,0.75),
inference(evaluation,[],[f17]) ).
tff(f17,plain,
~ sQ0_eqProxy(0.75,$uminus($uminus(0.75))),
inference(equality_proxy_replacement,[],[f15,f16]) ).
tff(f15,plain,
0.75 != $uminus($uminus(0.75)),
inference(cnf_transformation,[],[f14]) ).
tff(f14,plain,
0.75 != $uminus($uminus(0.75)),
inference(flattening,[],[f2]) ).
tff(f2,negated_conjecture,
( ~ 0.75 = $uminus($uminus(0.75)) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
0.75 = $uminus($uminus(0.75)),
file('/export/starexec/sandbox2/tmp/tmp.5FNiIQIufa/Vampire---4.8_17421',real_uminus_problem_5) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ARI463_1 : TPTP v8.1.2. Released v5.0.0.
% 0.07/0.15 % 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.15/0.36 % Computer : n005.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 : Tue Apr 30 18:49:26 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TF0_THM_EQU_ARI problem
% 0.15/0.36 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.5FNiIQIufa/Vampire---4.8_17421
% 0.55/0.74 % (17626)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.55/0.74 % (17625)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.55/0.74 % (17626)First to succeed.
% 0.55/0.74 % (17625)Also succeeded, but the first one will report.
% 0.55/0.74 % (17619)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.55/0.74 % (17621)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.55/0.74 % (17620)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.55/0.74 % (17623)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.55/0.74 % (17622)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.55/0.74 % (17624)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.55/0.74 % (17626)Refutation found. Thanks to Tanya!
% 0.55/0.74 % SZS status Theorem for Vampire---4
% 0.55/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.74 % (17626)------------------------------
% 0.55/0.74 % (17626)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.74 % (17626)Termination reason: Refutation
% 0.55/0.74
% 0.55/0.74 % (17626)Memory used [KB]: 956
% 0.55/0.74 % (17626)Time elapsed: 0.002 s
% 0.55/0.74 % (17626)Instructions burned: 2 (million)
% 0.55/0.74 % (17626)------------------------------
% 0.55/0.74 % (17626)------------------------------
% 0.55/0.74 % (17589)Success in time 0.375 s
% 0.55/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------