TSTP Solution File: NUM432+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM432+1 : 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n019.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:04 EDT 2024
% Result : Theorem 0.61s 0.81s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 11
% Syntax : Number of formulae : 57 ( 15 unt; 0 def)
% Number of atoms : 202 ( 41 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 245 ( 100 ~; 98 |; 36 &)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 62 ( 56 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f622,plain,
$false,
inference(avatar_sat_refutation,[],[f206,f617]) ).
fof(f617,plain,
~ spl1_7,
inference(avatar_contradiction_clause,[],[f616]) ).
fof(f616,plain,
( $false
| ~ spl1_7 ),
inference(subsumption_resolution,[],[f615,f66]) ).
fof(f66,plain,
aInteger0(xa),
inference(cnf_transformation,[],[f22]) ).
fof(f22,axiom,
( aInteger0(xc)
& sz00 != xq
& aInteger0(xq)
& aInteger0(xb)
& aInteger0(xa) ),
file('/export/starexec/sandbox2/tmp/tmp.z8UXnTJoqe/Vampire---4.8_30475',m__818) ).
fof(f615,plain,
( ~ aInteger0(xa)
| ~ spl1_7 ),
inference(subsumption_resolution,[],[f614,f70]) ).
fof(f70,plain,
aInteger0(xc),
inference(cnf_transformation,[],[f22]) ).
fof(f614,plain,
( ~ aInteger0(xc)
| ~ aInteger0(xa)
| ~ spl1_7 ),
inference(subsumption_resolution,[],[f613,f68]) ).
fof(f68,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f22]) ).
fof(f613,plain,
( ~ aInteger0(xq)
| ~ aInteger0(xc)
| ~ aInteger0(xa)
| ~ spl1_7 ),
inference(subsumption_resolution,[],[f612,f69]) ).
fof(f69,plain,
sz00 != xq,
inference(cnf_transformation,[],[f22]) ).
fof(f612,plain,
( sz00 = xq
| ~ aInteger0(xq)
| ~ aInteger0(xc)
| ~ aInteger0(xa)
| ~ spl1_7 ),
inference(subsumption_resolution,[],[f608,f297]) ).
fof(f297,plain,
( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| ~ spl1_7 ),
inference(subsumption_resolution,[],[f296,f68]) ).
fof(f296,plain,
( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| ~ aInteger0(xq)
| ~ spl1_7 ),
inference(subsumption_resolution,[],[f295,f69]) ).
fof(f295,plain,
( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| sz00 = xq
| ~ aInteger0(xq)
| ~ spl1_7 ),
inference(subsumption_resolution,[],[f261,f195]) ).
fof(f195,plain,
( aInteger0(sdtpldt0(xn,xm))
| ~ spl1_7 ),
inference(avatar_component_clause,[],[f194]) ).
fof(f194,plain,
( spl1_7
<=> aInteger0(sdtpldt0(xn,xm)) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_7])]) ).
fof(f261,plain,
( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| ~ aInteger0(sdtpldt0(xn,xm))
| sz00 = xq
| ~ aInteger0(xq) ),
inference(superposition,[],[f112,f77]) ).
fof(f77,plain,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
inference(cnf_transformation,[],[f26]) ).
fof(f26,axiom,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
file('/export/starexec/sandbox2/tmp/tmp.z8UXnTJoqe/Vampire---4.8_30475',m__924) ).
fof(f112,plain,
! [X2,X1] :
( aDivisorOf0(X1,sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| sz00 = X1
| ~ aInteger0(X1) ),
inference(subsumption_resolution,[],[f110,f101]) ).
fof(f101,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f57,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(flattening,[],[f56]) ).
fof(f56,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> aInteger0(sdtasdt0(X0,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.z8UXnTJoqe/Vampire---4.8_30475',mIntMult) ).
fof(f110,plain,
! [X2,X1] :
( aDivisorOf0(X1,sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| sz00 = X1
| ~ aInteger0(X1)
| ~ aInteger0(sdtasdt0(X1,X2)) ),
inference(equality_resolution,[],[f106]) ).
fof(f106,plain,
! [X2,X0,X1] :
( aDivisorOf0(X1,X0)
| sdtasdt0(X1,X2) != X0
| ~ aInteger0(X2)
| sz00 = X1
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f65]) ).
fof(f65,plain,
! [X0] :
( ! [X1] :
( ( aDivisorOf0(X1,X0)
| ! [X2] :
( sdtasdt0(X1,X2) != X0
| ~ aInteger0(X2) )
| sz00 = X1
| ~ aInteger0(X1) )
& ( ( sdtasdt0(X1,sK0(X0,X1)) = X0
& aInteger0(sK0(X0,X1))
& sz00 != X1
& aInteger0(X1) )
| ~ aDivisorOf0(X1,X0) ) )
| ~ aInteger0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f63,f64]) ).
fof(f64,plain,
! [X0,X1] :
( ? [X3] :
( sdtasdt0(X1,X3) = X0
& aInteger0(X3) )
=> ( sdtasdt0(X1,sK0(X0,X1)) = X0
& aInteger0(sK0(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f63,plain,
! [X0] :
( ! [X1] :
( ( aDivisorOf0(X1,X0)
| ! [X2] :
( sdtasdt0(X1,X2) != X0
| ~ aInteger0(X2) )
| sz00 = X1
| ~ aInteger0(X1) )
& ( ( ? [X3] :
( sdtasdt0(X1,X3) = X0
& aInteger0(X3) )
& sz00 != X1
& aInteger0(X1) )
| ~ aDivisorOf0(X1,X0) ) )
| ~ aInteger0(X0) ),
inference(rectify,[],[f62]) ).
fof(f62,plain,
! [X0] :
( ! [X1] :
( ( aDivisorOf0(X1,X0)
| ! [X2] :
( sdtasdt0(X1,X2) != X0
| ~ aInteger0(X2) )
| sz00 = X1
| ~ aInteger0(X1) )
& ( ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& sz00 != X1
& aInteger0(X1) )
| ~ aDivisorOf0(X1,X0) ) )
| ~ aInteger0(X0) ),
inference(flattening,[],[f61]) ).
fof(f61,plain,
! [X0] :
( ! [X1] :
( ( aDivisorOf0(X1,X0)
| ! [X2] :
( sdtasdt0(X1,X2) != X0
| ~ aInteger0(X2) )
| sz00 = X1
| ~ aInteger0(X1) )
& ( ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& sz00 != X1
& aInteger0(X1) )
| ~ aDivisorOf0(X1,X0) ) )
| ~ aInteger0(X0) ),
inference(nnf_transformation,[],[f58]) ).
fof(f58,plain,
! [X0] :
( ! [X1] :
( aDivisorOf0(X1,X0)
<=> ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& sz00 != X1
& aInteger0(X1) ) )
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X0] :
( aInteger0(X0)
=> ! [X1] :
( aDivisorOf0(X1,X0)
<=> ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& sz00 != X1
& aInteger0(X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.z8UXnTJoqe/Vampire---4.8_30475',mDivisor) ).
fof(f608,plain,
( ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| sz00 = xq
| ~ aInteger0(xq)
| ~ aInteger0(xc)
| ~ aInteger0(xa) ),
inference(resolution,[],[f88,f78]) ).
fof(f78,plain,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(flattening,[],[f28]) ).
fof(f28,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(negated_conjecture,[],[f27]) ).
fof(f27,conjecture,
sdteqdtlpzmzozddtrp0(xa,xc,xq),
file('/export/starexec/sandbox2/tmp/tmp.z8UXnTJoqe/Vampire---4.8_30475',m__) ).
fof(f88,plain,
! [X2,X0,X1] :
( sdteqdtlpzmzozddtrp0(X0,X1,X2)
| ~ aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
| sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ( ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
| ~ aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) )
& ( aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
| ~ sdteqdtlpzmzozddtrp0(X0,X1,X2) ) )
| sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(nnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) )
| sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(flattening,[],[f39]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) )
| sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,axiom,
! [X0,X1,X2] :
( ( sz00 != X2
& aInteger0(X2)
& aInteger0(X1)
& aInteger0(X0) )
=> ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) ) ),
file('/export/starexec/sandbox2/tmp/tmp.z8UXnTJoqe/Vampire---4.8_30475',mEquMod) ).
fof(f206,plain,
spl1_7,
inference(avatar_contradiction_clause,[],[f205]) ).
fof(f205,plain,
( $false
| spl1_7 ),
inference(subsumption_resolution,[],[f204,f73]) ).
fof(f73,plain,
aInteger0(xn),
inference(cnf_transformation,[],[f24]) ).
fof(f24,axiom,
( sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb))
& aInteger0(xn) ),
file('/export/starexec/sandbox2/tmp/tmp.z8UXnTJoqe/Vampire---4.8_30475',m__876) ).
fof(f204,plain,
( ~ aInteger0(xn)
| spl1_7 ),
inference(subsumption_resolution,[],[f202,f75]) ).
fof(f75,plain,
aInteger0(xm),
inference(cnf_transformation,[],[f25]) ).
fof(f25,axiom,
( sdtasdt0(xq,xm) = sdtpldt0(xb,smndt0(xc))
& aInteger0(xm) ),
file('/export/starexec/sandbox2/tmp/tmp.z8UXnTJoqe/Vampire---4.8_30475',m__899) ).
fof(f202,plain,
( ~ aInteger0(xm)
| ~ aInteger0(xn)
| spl1_7 ),
inference(resolution,[],[f196,f98]) ).
fof(f98,plain,
! [X0,X1] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f51]) ).
fof(f51,plain,
! [X0,X1] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(flattening,[],[f50]) ).
fof(f50,plain,
! [X0,X1] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> aInteger0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.z8UXnTJoqe/Vampire---4.8_30475',mIntPlus) ).
fof(f196,plain,
( ~ aInteger0(sdtpldt0(xn,xm))
| spl1_7 ),
inference(avatar_component_clause,[],[f194]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM432+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.11 % 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.11/0.32 % Computer : n019.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Apr 30 16:59:14 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.32 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.z8UXnTJoqe/Vampire---4.8_30475
% 0.61/0.80 % (30586)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.61/0.80 % (30587)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.61/0.80 % (30584)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.61/0.80 % (30588)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.61/0.80 % (30585)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.61/0.80 % (30589)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.61/0.80 % (30591)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.61/0.80 % (30590)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.61/0.80 % (30591)Refutation not found, incomplete strategy% (30591)------------------------------
% 0.61/0.80 % (30591)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80 % (30591)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.80
% 0.61/0.80 % (30591)Memory used [KB]: 1029
% 0.61/0.80 % (30591)Time elapsed: 0.003 s
% 0.61/0.80 % (30591)Instructions burned: 3 (million)
% 0.61/0.80 % (30591)------------------------------
% 0.61/0.80 % (30591)------------------------------
% 0.61/0.80 % (30584)Refutation not found, incomplete strategy% (30584)------------------------------
% 0.61/0.80 % (30584)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80 % (30584)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.80
% 0.61/0.80 % (30584)Memory used [KB]: 1052
% 0.61/0.80 % (30584)Time elapsed: 0.004 s
% 0.61/0.80 % (30584)Instructions burned: 5 (million)
% 0.61/0.80 % (30584)------------------------------
% 0.61/0.80 % (30584)------------------------------
% 0.61/0.80 % (30588)Refutation not found, incomplete strategy% (30588)------------------------------
% 0.61/0.80 % (30588)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80 % (30588)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.80
% 0.61/0.80 % (30588)Memory used [KB]: 1072
% 0.61/0.80 % (30588)Time elapsed: 0.005 s
% 0.61/0.80 % (30588)Instructions burned: 6 (million)
% 0.61/0.80 % (30588)------------------------------
% 0.61/0.80 % (30588)------------------------------
% 0.61/0.80 % (30592)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2995ds/55Mi)
% 0.61/0.80 % (30593)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2995ds/50Mi)
% 0.61/0.80 % (30594)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/208Mi)
% 0.61/0.81 % (30586)First to succeed.
% 0.61/0.81 % (30586)Refutation found. Thanks to Tanya!
% 0.61/0.81 % SZS status Theorem for Vampire---4
% 0.61/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.81 % (30586)------------------------------
% 0.61/0.81 % (30586)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.81 % (30586)Termination reason: Refutation
% 0.61/0.81
% 0.61/0.81 % (30586)Memory used [KB]: 1208
% 0.61/0.81 % (30586)Time elapsed: 0.014 s
% 0.61/0.81 % (30586)Instructions burned: 25 (million)
% 0.61/0.81 % (30586)------------------------------
% 0.61/0.81 % (30586)------------------------------
% 0.61/0.81 % (30583)Success in time 0.482 s
% 0.61/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------