TSTP Solution File: NUM904_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM904_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/sandbox/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 08:16:17 EDT 2024
% Result : Theorem 0.41s 0.61s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 15 ( 10 unt; 2 typ; 0 def)
% Number of atoms : 16 ( 9 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 9 ~; 1 |; 0 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 39 ( 0 atm; 22 fun; 11 num; 6 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-3 aty)
% Number of functors : 4 ( 1 usr; 2 con; 0-2 aty)
% Number of variables : 13 ( 10 !; 2 ?; 13 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_4,type,
sK0: $rat ).
tff(pred_def_2,type,
sQ1_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f32,plain,
$false,
inference(subsumption_resolution,[],[f31,f24]) ).
tff(f24,plain,
! [X0: $rat] : sQ1_eqProxy($rat,$sum(X0,$uminus(X0)),0/1),
inference(equality_proxy_replacement,[],[f7,f18]) ).
tff(f18,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ1_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ1_eqProxy])]) ).
tff(f7,plain,
! [X0: $rat] : ( $sum(X0,$uminus(X0)) = 0/1 ),
introduced(theory_axiom_140,[]) ).
tff(f31,plain,
~ sQ1_eqProxy($rat,$sum(sK0,$uminus(sK0)),0/1),
inference(resolution,[],[f28,f19]) ).
tff(f19,plain,
~ sQ1_eqProxy($rat,0/1,$sum(sK0,$uminus(sK0))),
inference(equality_proxy_replacement,[],[f17,f18]) ).
tff(f17,plain,
0/1 != $sum(sK0,$uminus(sK0)),
inference(cnf_transformation,[],[f16]) ).
tff(f16,plain,
0/1 != $sum(sK0,$uminus(sK0)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f14,f15]) ).
tff(f15,plain,
( ? [X0: $rat] : ( $sum(X0,$uminus(X0)) != 0/1 )
=> ( 0/1 != $sum(sK0,$uminus(sK0)) ) ),
introduced(choice_axiom,[]) ).
tff(f14,plain,
? [X0: $rat] : ( $sum(X0,$uminus(X0)) != 0/1 ),
inference(ennf_transformation,[],[f2]) ).
tff(f2,negated_conjecture,
~ ! [X0: $rat] : ( $sum(X0,$uminus(X0)) = 0/1 ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
! [X0: $rat] : ( $sum(X0,$uminus(X0)) = 0/1 ),
file('/export/starexec/sandbox/tmp/tmp.djMHUtgQLF/Vampire---4.8_11621',rat_uminus_problem_8) ).
tff(f28,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ1_eqProxy(X0,X2,X1)
| ~ sQ1_eqProxy(X0,X1,X2) ),
inference(equality_proxy_axiom,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : NUM904_1 : TPTP v8.1.2. Released v5.0.0.
% 0.05/0.10 % 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.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Fri May 3 15:10:22 EDT 2024
% 0.10/0.29 % CPUTime :
% 0.10/0.29 This is a TF0_THM_EQU_ARI problem
% 0.10/0.29 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.djMHUtgQLF/Vampire---4.8_11621
% 0.41/0.60 % (11872)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.41/0.60 % (11875)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.41/0.60 % (11876)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.41/0.60 % (11874)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.41/0.60 % (11878)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.41/0.60 % (11877)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.41/0.60 % (11873)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.41/0.60 % (11879)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.41/0.60 % (11872)First to succeed.
% 0.41/0.60 % (11872)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-11862"
% 0.41/0.61 % (11875)Also succeeded, but the first one will report.
% 0.41/0.61 % (11878)Also succeeded, but the first one will report.
% 0.41/0.61 % (11879)Refutation not found, incomplete strategy% (11879)------------------------------
% 0.41/0.61 % (11879)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.41/0.61 % (11879)Termination reason: Refutation not found, incomplete strategy
% 0.41/0.61 % (11877)Also succeeded, but the first one will report.
% 0.41/0.61
% 0.41/0.61 % (11879)Memory used [KB]: 952
% 0.41/0.61 % (11879)Time elapsed: 0.003 s
% 0.41/0.61 % (11879)Instructions burned: 2 (million)
% 0.41/0.61 % (11872)Refutation found. Thanks to Tanya!
% 0.41/0.61 % SZS status Theorem for Vampire---4
% 0.41/0.61 % SZS output start Proof for Vampire---4
% See solution above
% 0.41/0.61 % (11872)------------------------------
% 0.41/0.61 % (11872)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.41/0.61 % (11872)Termination reason: Refutation
% 0.41/0.61
% 0.41/0.61 % (11872)Memory used [KB]: 961
% 0.41/0.61 % (11872)Time elapsed: 0.002 s
% 0.41/0.61 % (11872)Instructions burned: 3 (million)
% 0.41/0.61 % (11862)Success in time 0.309 s
% 0.41/0.61 % Vampire---4.8 exiting
%------------------------------------------------------------------------------