TSTP Solution File: NUM434+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM434+3 : TPTP v8.1.2. Released v4.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 : n002.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 03:31:06 EDT 2024
% Result : Theorem 0.55s 0.76s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 5 unt; 1 typ; 0 def)
% Number of atoms : 171 ( 12 equ)
% Maximal formula atoms : 5 ( 10 avg)
% Number of connectives : 32 ( 13 ~; 5 |; 12 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 136 ( 136 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 15 ( 13 usr; 7 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 15 ( 10 !; 4 ?; 10 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_4,type,
sQ2_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f164,plain,
$false,
inference(subsumption_resolution,[],[f163,f74]) ).
tff(f74,plain,
aInteger0(sK0),
inference(cnf_transformation,[],[f60]) ).
tff(f60,plain,
( sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& ( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xp,xq),sK0) )
& aInteger0(sK0)
& ( sz00 != sdtasdt0(xp,xq) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f24,f59]) ).
tff(f59,plain,
( ? [X0] :
( ( sdtasdt0(sdtasdt0(xp,xq),X0) = sdtpldt0(xa,smndt0(xb)) )
& aInteger0(X0) )
=> ( ( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xp,xq),sK0) )
& aInteger0(sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f24,axiom,
( sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& ? [X0] :
( ( sdtasdt0(sdtasdt0(xp,xq),X0) = sdtpldt0(xa,smndt0(xb)) )
& aInteger0(X0) )
& ( sz00 != sdtasdt0(xp,xq) ) ),
file('/export/starexec/sandbox/tmp/tmp.U6bUOUWl3I/Vampire---4.8_11882',m__1003) ).
tff(f163,plain,
~ aInteger0(sK0),
inference(resolution,[],[f113,f155]) ).
tff(f155,plain,
! [X0: $i] :
( ~ sQ2_eqProxy($i,sdtpldt0(xa,smndt0(xb)),sdtasdt0(sdtasdt0(xp,xq),X0))
| ~ aInteger0(X0) ),
inference(resolution,[],[f139,f115]) ).
tff(f115,plain,
! [X0: $i] :
( ~ sQ2_eqProxy($i,sdtasdt0(sdtasdt0(xp,xq),X0),sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(X0) ),
inference(equality_proxy_replacement,[],[f78,f110]) ).
tff(f110,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ2_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ2_eqProxy])]) ).
tff(f78,plain,
! [X0: $i] :
( ( sdtasdt0(sdtasdt0(xp,xq),X0) != sdtpldt0(xa,smndt0(xb)) )
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f28]) ).
tff(f28,plain,
! [X0] :
( ( sdtasdt0(sdtasdt0(xp,xq),X0) != sdtpldt0(xa,smndt0(xb)) )
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f26]) ).
tff(f26,negated_conjecture,
~ ? [X0] :
( ( sdtasdt0(sdtasdt0(xp,xq),X0) = sdtpldt0(xa,smndt0(xb)) )
& aInteger0(X0) ),
inference(negated_conjecture,[],[f25]) ).
tff(f25,conjecture,
? [X0] :
( ( sdtasdt0(sdtasdt0(xp,xq),X0) = sdtpldt0(xa,smndt0(xb)) )
& aInteger0(X0) ),
file('/export/starexec/sandbox/tmp/tmp.U6bUOUWl3I/Vampire---4.8_11882',m__) ).
tff(f139,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ2_eqProxy(X0,X2,X1)
| ~ sQ2_eqProxy(X0,X1,X2) ),
inference(equality_proxy_axiom,[],[f110]) ).
tff(f113,plain,
sQ2_eqProxy($i,sdtpldt0(xa,smndt0(xb)),sdtasdt0(sdtasdt0(xp,xq),sK0)),
inference(equality_proxy_replacement,[],[f75,f110]) ).
tff(f75,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xp,xq),sK0),
inference(cnf_transformation,[],[f60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM434+3 : TPTP v8.1.2. Released v4.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n002.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 17:08:40 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37 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.U6bUOUWl3I/Vampire---4.8_11882
% 0.55/0.76 % (12150)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.76 % (12143)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.76 % (12145)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.76 % (12144)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.76 % (12146)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.76 % (12147)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.76 % (12148)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.76 % (12143)First to succeed.
% 0.55/0.76 % (12151)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.76 % (12147)Also succeeded, but the first one will report.
% 0.55/0.76 % (12143)Refutation found. Thanks to Tanya!
% 0.55/0.76 % SZS status Theorem for Vampire---4
% 0.55/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.76 % (12143)------------------------------
% 0.55/0.76 % (12143)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.76 % (12143)Termination reason: Refutation
% 0.55/0.76
% 0.55/0.76 % (12143)Memory used [KB]: 1068
% 0.55/0.76 % (12143)Time elapsed: 0.005 s
% 0.55/0.76 % (12143)Instructions burned: 5 (million)
% 0.55/0.76 % (12143)------------------------------
% 0.55/0.76 % (12143)------------------------------
% 0.55/0.76 % (12139)Success in time 0.383 s
% 0.55/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------