TSTP Solution File: NUM475+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM475+2 : 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 : n025.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:12:21 EDT 2024
% Result : Theorem 0.53s 0.74s
% Output : Refutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 44 ( 16 unt; 1 typ; 0 def)
% Number of atoms : 256 ( 22 equ)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 113 ( 54 ~; 43 |; 11 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 154 ( 154 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 15 ( 13 usr; 8 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 33 ( 32 !; 0 ?; 18 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_5,type,
sQ5_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f375,plain,
$false,
inference(avatar_sat_refutation,[],[f286,f374]) ).
tff(f374,plain,
~ spl6_1,
inference(avatar_contradiction_clause,[],[f373]) ).
tff(f373,plain,
( $false
| ~ spl6_1 ),
inference(subsumption_resolution,[],[f372,f113]) ).
tff(f113,plain,
aNaturalNumber0(xl),
inference(cnf_transformation,[],[f34]) ).
tff(f34,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox/tmp/tmp.gk25kDMit0/Vampire---4.8_31232',m__1324) ).
tff(f372,plain,
( ~ aNaturalNumber0(xl)
| ~ spl6_1 ),
inference(subsumption_resolution,[],[f371,f123]) ).
tff(f123,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f37]) ).
tff(f37,axiom,
( ( xp = sdtsldt0(xm,xl) )
& ( xm = sdtasdt0(xl,xp) )
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/tmp/tmp.gk25kDMit0/Vampire---4.8_31232',m__1360) ).
tff(f371,plain,
( ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xl)
| ~ spl6_1 ),
inference(resolution,[],[f365,f145]) ).
tff(f145,plain,
! [X0: $i,X1: $i] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f60]) ).
tff(f60,plain,
! [X0,X1] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f59]) ).
tff(f59,plain,
! [X0,X1] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f5]) ).
tff(f5,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> aNaturalNumber0(sdtasdt0(X0,X1)) ),
file('/export/starexec/sandbox/tmp/tmp.gk25kDMit0/Vampire---4.8_31232',mSortsB_02) ).
tff(f365,plain,
( ~ aNaturalNumber0(sdtasdt0(xl,xp))
| ~ spl6_1 ),
inference(resolution,[],[f345,f250]) ).
tff(f250,plain,
sQ5_eqProxy($i,sdtpldt0(sdtasdt0(xl,xp),xn),sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr))),
inference(forward_literal_rewriting,[],[f205,f242]) ).
tff(f242,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ5_eqProxy(X0,X2,X1)
| ~ sQ5_eqProxy(X0,X1,X2) ),
inference(equality_proxy_axiom,[],[f194]) ).
tff(f194,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ5_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ5_eqProxy])]) ).
tff(f205,plain,
sQ5_eqProxy($i,sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)),sdtpldt0(sdtasdt0(xl,xp),xn)),
inference(equality_proxy_replacement,[],[f135,f194]) ).
tff(f135,plain,
sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) = sdtpldt0(sdtasdt0(xl,xp),xn),
inference(cnf_transformation,[],[f41]) ).
tff(f41,axiom,
sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) = sdtpldt0(sdtasdt0(xl,xp),xn),
file('/export/starexec/sandbox/tmp/tmp.gk25kDMit0/Vampire---4.8_31232',m__1459) ).
tff(f345,plain,
( ! [X0: $i] :
( ~ sQ5_eqProxy($i,sdtpldt0(X0,xn),sdtpldt0(X0,sdtasdt0(xl,xr)))
| ~ aNaturalNumber0(X0) )
| ~ spl6_1 ),
inference(subsumption_resolution,[],[f344,f115]) ).
tff(f115,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f34]) ).
tff(f344,plain,
( ! [X0: $i] :
( ~ sQ5_eqProxy($i,sdtpldt0(X0,xn),sdtpldt0(X0,sdtasdt0(xl,xr)))
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(X0) )
| ~ spl6_1 ),
inference(subsumption_resolution,[],[f340,f256]) ).
tff(f256,plain,
( aNaturalNumber0(sdtasdt0(xl,xr))
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f255]) ).
tff(f255,plain,
( spl6_1
<=> aNaturalNumber0(sdtasdt0(xl,xr)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
tff(f340,plain,
! [X0: $i] :
( ~ sQ5_eqProxy($i,sdtpldt0(X0,xn),sdtpldt0(X0,sdtasdt0(xl,xr)))
| ~ aNaturalNumber0(sdtasdt0(xl,xr))
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(X0) ),
inference(resolution,[],[f208,f206]) ).
tff(f206,plain,
~ sQ5_eqProxy($i,xn,sdtasdt0(xl,xr)),
inference(equality_proxy_replacement,[],[f136,f194]) ).
tff(f136,plain,
xn != sdtasdt0(xl,xr),
inference(cnf_transformation,[],[f45]) ).
tff(f45,plain,
xn != sdtasdt0(xl,xr),
inference(flattening,[],[f43]) ).
tff(f43,negated_conjecture,
( ~ xn = sdtasdt0(xl,xr) ),
inference(negated_conjecture,[],[f42]) ).
tff(f42,conjecture,
xn = sdtasdt0(xl,xr),
file('/export/starexec/sandbox/tmp/tmp.gk25kDMit0/Vampire---4.8_31232',m__) ).
tff(f208,plain,
! [X2: $i,X0: $i,X1: $i] :
( sQ5_eqProxy($i,X1,X2)
| ~ sQ5_eqProxy($i,sdtpldt0(X0,X1),sdtpldt0(X0,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(equality_proxy_replacement,[],[f137,f194]) ).
tff(f137,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( X1 = X2 )
| ( sdtpldt0(X0,X1) != sdtpldt0(X0,X2) )
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f48]) ).
tff(f48,plain,
! [X0,X1,X2] :
( ( X1 = X2 )
| ( ( sdtpldt0(X1,X0) != sdtpldt0(X2,X0) )
& ( sdtpldt0(X0,X1) != sdtpldt0(X0,X2) ) )
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f47]) ).
tff(f47,plain,
! [X0,X1,X2] :
( ( X1 = X2 )
| ( ( sdtpldt0(X1,X0) != sdtpldt0(X2,X0) )
& ( sdtpldt0(X0,X1) != sdtpldt0(X0,X2) ) )
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f14]) ).
tff(f14,axiom,
! [X0,X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( ( ( sdtpldt0(X1,X0) = sdtpldt0(X2,X0) )
| ( sdtpldt0(X0,X1) = sdtpldt0(X0,X2) ) )
=> ( X1 = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.gk25kDMit0/Vampire---4.8_31232',mAddCanc) ).
tff(f286,plain,
spl6_1,
inference(avatar_contradiction_clause,[],[f285]) ).
tff(f285,plain,
( $false
| spl6_1 ),
inference(subsumption_resolution,[],[f284,f113]) ).
tff(f284,plain,
( ~ aNaturalNumber0(xl)
| spl6_1 ),
inference(subsumption_resolution,[],[f283,f132]) ).
tff(f132,plain,
aNaturalNumber0(xr),
inference(cnf_transformation,[],[f40]) ).
tff(f40,axiom,
( ( xr = sdtmndt0(xq,xp) )
& ( xq = sdtpldt0(xp,xr) )
& aNaturalNumber0(xr) ),
file('/export/starexec/sandbox/tmp/tmp.gk25kDMit0/Vampire---4.8_31232',m__1422) ).
tff(f283,plain,
( ~ aNaturalNumber0(xr)
| ~ aNaturalNumber0(xl)
| spl6_1 ),
inference(resolution,[],[f257,f145]) ).
tff(f257,plain,
( ~ aNaturalNumber0(sdtasdt0(xl,xr))
| spl6_1 ),
inference(avatar_component_clause,[],[f255]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM475+2 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.14 % 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.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % 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 : Fri May 3 15:08:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 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.gk25kDMit0/Vampire---4.8_31232
% 0.53/0.72 % (31347)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.53/0.73 % (31341)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.53/0.73 % (31344)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.53/0.73 % (31342)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.53/0.73 % (31346)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.53/0.73 % (31348)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.53/0.73 % (31345)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.53/0.73 % (31343)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.53/0.73 % (31341)First to succeed.
% 0.53/0.73 % (31341)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-31340"
% 0.53/0.74 % (31341)Refutation found. Thanks to Tanya!
% 0.53/0.74 % SZS status Theorem for Vampire---4
% 0.53/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.53/0.74 % (31341)------------------------------
% 0.53/0.74 % (31341)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.74 % (31341)Termination reason: Refutation
% 0.53/0.74
% 0.53/0.74 % (31341)Memory used [KB]: 1182
% 0.53/0.74 % (31341)Time elapsed: 0.009 s
% 0.53/0.74 % (31341)Instructions burned: 13 (million)
% 0.53/0.74 % (31340)Success in time 0.377 s
% 0.53/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------