TSTP Solution File: NUM430+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM430+1 : TPTP v8.2.0. 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 : n020.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 : Tue May 21 01:42:04 EDT 2024
% Result : Theorem 0.52s 0.74s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 57 ( 9 unt; 0 def)
% Number of atoms : 197 ( 35 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 237 ( 97 ~; 91 |; 36 &)
% ( 8 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 70 ( 62 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f510,plain,
$false,
inference(avatar_sat_refutation,[],[f147,f254,f509]) ).
fof(f509,plain,
spl2_2,
inference(avatar_contradiction_clause,[],[f508]) ).
fof(f508,plain,
( $false
| spl2_2 ),
inference(subsumption_resolution,[],[f507,f96]) ).
fof(f96,plain,
aInteger0(xb),
inference(cnf_transformation,[],[f22]) ).
fof(f22,axiom,
( aInteger0(xc)
& sz00 != xq
& aInteger0(xq)
& aInteger0(xb)
& aInteger0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__818) ).
fof(f507,plain,
( ~ aInteger0(xb)
| spl2_2 ),
inference(subsumption_resolution,[],[f506,f99]) ).
fof(f99,plain,
aInteger0(xc),
inference(cnf_transformation,[],[f22]) ).
fof(f506,plain,
( ~ aInteger0(xc)
| ~ aInteger0(xb)
| spl2_2 ),
inference(subsumption_resolution,[],[f499,f101]) ).
fof(f101,plain,
sdteqdtlpzmzozddtrp0(xb,xc,xq),
inference(cnf_transformation,[],[f23]) ).
fof(f23,axiom,
( sdteqdtlpzmzozddtrp0(xb,xc,xq)
& sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__853) ).
fof(f499,plain,
( ~ sdteqdtlpzmzozddtrp0(xb,xc,xq)
| ~ aInteger0(xc)
| ~ aInteger0(xb)
| spl2_2 ),
inference(resolution,[],[f467,f146]) ).
fof(f146,plain,
( ~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
| spl2_2 ),
inference(avatar_component_clause,[],[f144]) ).
fof(f144,plain,
( spl2_2
<=> aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f467,plain,
! [X0,X1] :
( aDivisorOf0(xq,sdtpldt0(X0,smndt0(X1)))
| ~ sdteqdtlpzmzozddtrp0(X0,X1,xq)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(subsumption_resolution,[],[f461,f97]) ).
fof(f97,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f22]) ).
fof(f461,plain,
! [X0,X1] :
( aDivisorOf0(xq,sdtpldt0(X0,smndt0(X1)))
| ~ sdteqdtlpzmzozddtrp0(X0,X1,xq)
| ~ aInteger0(xq)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(resolution,[],[f131,f128]) ).
fof(f128,plain,
! [X2,X0,X1] :
( aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
| ~ sdteqdtlpzmzozddtrp0(X0,X1,X2)
| sQ1_eqProxy(sz00,X2)
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(equality_proxy_replacement,[],[f91,f107]) ).
fof(f107,plain,
! [X0,X1] :
( sQ1_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ1_eqProxy])]) ).
fof(f91,plain,
! [X2,X0,X1] :
( aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
| ~ sdteqdtlpzmzozddtrp0(X0,X1,X2)
| sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f63,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,[],[f52]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) )
| sz00 = X2
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(flattening,[],[f51]) ).
fof(f51,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/benchmark/theBenchmark.p',mEquMod) ).
fof(f131,plain,
~ sQ1_eqProxy(sz00,xq),
inference(equality_proxy_replacement,[],[f98,f107]) ).
fof(f98,plain,
sz00 != xq,
inference(cnf_transformation,[],[f22]) ).
fof(f254,plain,
spl2_1,
inference(avatar_contradiction_clause,[],[f253]) ).
fof(f253,plain,
( $false
| spl2_1 ),
inference(subsumption_resolution,[],[f251,f99]) ).
fof(f251,plain,
( ~ aInteger0(xc)
| spl2_1 ),
inference(resolution,[],[f200,f66]) ).
fof(f66,plain,
! [X0] :
( aInteger0(smndt0(X0))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0] :
( aInteger0(smndt0(X0))
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( aInteger0(X0)
=> aInteger0(smndt0(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntNeg) ).
fof(f200,plain,
( ~ aInteger0(smndt0(xc))
| spl2_1 ),
inference(subsumption_resolution,[],[f198,f96]) ).
fof(f198,plain,
( ~ aInteger0(smndt0(xc))
| ~ aInteger0(xb)
| spl2_1 ),
inference(resolution,[],[f142,f67]) ).
fof(f67,plain,
! [X0,X1] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(flattening,[],[f29]) ).
fof(f29,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/benchmark/theBenchmark.p',mIntPlus) ).
fof(f142,plain,
( ~ aInteger0(sdtpldt0(xb,smndt0(xc)))
| spl2_1 ),
inference(avatar_component_clause,[],[f140]) ).
fof(f140,plain,
( spl2_1
<=> aInteger0(sdtpldt0(xb,smndt0(xc))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f147,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f138,f144,f140]) ).
fof(f138,plain,
( ~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
| ~ aInteger0(sdtpldt0(xb,smndt0(xc))) ),
inference(subsumption_resolution,[],[f136,f88]) ).
fof(f88,plain,
! [X0,X1] :
( aInteger0(sK0(X0,X1))
| ~ aDivisorOf0(X1,X0)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f62,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])],[f60,f61]) ).
fof(f61,plain,
! [X0,X1] :
( ? [X3] :
( sdtasdt0(X1,X3) = X0
& aInteger0(X3) )
=> ( sdtasdt0(X1,sK0(X0,X1)) = X0
& aInteger0(sK0(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f60,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,[],[f59]) ).
fof(f59,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,[],[f58]) ).
fof(f58,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,[],[f50]) ).
fof(f50,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/benchmark/theBenchmark.p',mDivisor) ).
fof(f136,plain,
( ~ aInteger0(sK0(sdtpldt0(xb,smndt0(xc)),xq))
| ~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
| ~ aInteger0(sdtpldt0(xb,smndt0(xc))) ),
inference(resolution,[],[f133,f126]) ).
fof(f126,plain,
! [X0,X1] :
( sQ1_eqProxy(sdtasdt0(X1,sK0(X0,X1)),X0)
| ~ aDivisorOf0(X1,X0)
| ~ aInteger0(X0) ),
inference(equality_proxy_replacement,[],[f89,f107]) ).
fof(f89,plain,
! [X0,X1] :
( sdtasdt0(X1,sK0(X0,X1)) = X0
| ~ aDivisorOf0(X1,X0)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f133,plain,
! [X0] :
( ~ sQ1_eqProxy(sdtasdt0(xq,X0),sdtpldt0(xb,smndt0(xc)))
| ~ aInteger0(X0) ),
inference(equality_proxy_replacement,[],[f104,f107]) ).
fof(f104,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xc))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f57,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xc))
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,negated_conjecture,
~ ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc))
& aInteger0(X0) ),
inference(negated_conjecture,[],[f25]) ).
fof(f25,conjecture,
? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc))
& aInteger0(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM430+1 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % 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.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % 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 : Mon May 20 07:03:53 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.52/0.73 % (26073)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 theBenchmark for (2996ds/83Mi)
% 0.52/0.73 % (26067)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 theBenchmark for (2996ds/34Mi)
% 0.52/0.73 % (26070)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.52/0.73 % (26068)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 theBenchmark for (2996ds/51Mi)
% 0.52/0.73 % (26069)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.52/0.73 % (26071)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 theBenchmark for (2996ds/34Mi)
% 0.52/0.73 % (26072)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.52/0.74 % (26067)Refutation not found, incomplete strategy% (26067)------------------------------
% 0.52/0.74 % (26067)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.74 % (26067)Termination reason: Refutation not found, incomplete strategy
% 0.52/0.74
% 0.52/0.74 % (26067)Memory used [KB]: 1049
% 0.52/0.74 % (26067)Time elapsed: 0.004 s
% 0.52/0.74 % (26067)Instructions burned: 5 (million)
% 0.52/0.74 % (26067)------------------------------
% 0.52/0.74 % (26067)------------------------------
% 0.52/0.74 % (26071)First to succeed.
% 0.52/0.74 % (26071)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-26066"
% 0.52/0.74 % (26071)Refutation found. Thanks to Tanya!
% 0.52/0.74 % SZS status Theorem for theBenchmark
% 0.52/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.52/0.74 % (26071)------------------------------
% 0.52/0.74 % (26071)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.74 % (26071)Termination reason: Refutation
% 0.52/0.74
% 0.52/0.74 % (26071)Memory used [KB]: 1091
% 0.52/0.74 % (26071)Time elapsed: 0.006 s
% 0.52/0.74 % (26071)Instructions burned: 8 (million)
% 0.52/0.74 % (26066)Success in time 0.378 s
% 0.52/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------