TSTP Solution File: NUM460+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM460+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 : n022.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:14 EDT 2024
% Result : Theorem 0.56s 0.74s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 8 unt; 0 def)
% Number of atoms : 131 ( 37 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 146 ( 49 ~; 35 |; 55 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 46 ( 29 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f292,plain,
$false,
inference(subsumption_resolution,[],[f291,f53]) ).
fof(f53,plain,
aNaturalNumber0(sK1),
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
( ~ sdtlseqdt0(xm,xl)
& ! [X0] :
( xl != sdtpldt0(xm,X0)
| ~ aNaturalNumber0(X0) )
& sdtlseqdt0(xn,xl)
& xl = sdtpldt0(xn,sK0)
& aNaturalNumber0(sK0)
& sdtlseqdt0(xm,xn)
& xn = sdtpldt0(xm,sK1)
& aNaturalNumber0(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f42,f44,f43]) ).
fof(f43,plain,
( ? [X1] :
( xl = sdtpldt0(xn,X1)
& aNaturalNumber0(X1) )
=> ( xl = sdtpldt0(xn,sK0)
& aNaturalNumber0(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f44,plain,
( ? [X2] :
( xn = sdtpldt0(xm,X2)
& aNaturalNumber0(X2) )
=> ( xn = sdtpldt0(xm,sK1)
& aNaturalNumber0(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f42,plain,
( ~ sdtlseqdt0(xm,xl)
& ! [X0] :
( xl != sdtpldt0(xm,X0)
| ~ aNaturalNumber0(X0) )
& sdtlseqdt0(xn,xl)
& ? [X1] :
( xl = sdtpldt0(xn,X1)
& aNaturalNumber0(X1) )
& sdtlseqdt0(xm,xn)
& ? [X2] :
( xn = sdtpldt0(xm,X2)
& aNaturalNumber0(X2) ) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
( ~ sdtlseqdt0(xm,xl)
& ! [X2] :
( xl != sdtpldt0(xm,X2)
| ~ aNaturalNumber0(X2) )
& sdtlseqdt0(xn,xl)
& ? [X0] :
( xl = sdtpldt0(xn,X0)
& aNaturalNumber0(X0) )
& sdtlseqdt0(xm,xn)
& ? [X1] :
( xn = sdtpldt0(xm,X1)
& aNaturalNumber0(X1) ) ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
( ~ sdtlseqdt0(xm,xl)
& ! [X2] :
( xl != sdtpldt0(xm,X2)
| ~ aNaturalNumber0(X2) )
& sdtlseqdt0(xn,xl)
& ? [X0] :
( xl = sdtpldt0(xn,X0)
& aNaturalNumber0(X0) )
& sdtlseqdt0(xm,xn)
& ? [X1] :
( xn = sdtpldt0(xm,X1)
& aNaturalNumber0(X1) ) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,plain,
~ ( ( sdtlseqdt0(xn,xl)
& ? [X0] :
( xl = sdtpldt0(xn,X0)
& aNaturalNumber0(X0) )
& sdtlseqdt0(xm,xn)
& ? [X1] :
( xn = sdtpldt0(xm,X1)
& aNaturalNumber0(X1) ) )
=> ( sdtlseqdt0(xm,xl)
| ? [X2] :
( xl = sdtpldt0(xm,X2)
& aNaturalNumber0(X2) ) ) ),
inference(rectify,[],[f24]) ).
fof(f24,negated_conjecture,
~ ( ( sdtlseqdt0(xn,xl)
& ? [X0] :
( xl = sdtpldt0(xn,X0)
& aNaturalNumber0(X0) )
& sdtlseqdt0(xm,xn)
& ? [X0] :
( xn = sdtpldt0(xm,X0)
& aNaturalNumber0(X0) ) )
=> ( sdtlseqdt0(xm,xl)
| ? [X0] :
( xl = sdtpldt0(xm,X0)
& aNaturalNumber0(X0) ) ) ),
inference(negated_conjecture,[],[f23]) ).
fof(f23,conjecture,
( ( sdtlseqdt0(xn,xl)
& ? [X0] :
( xl = sdtpldt0(xn,X0)
& aNaturalNumber0(X0) )
& sdtlseqdt0(xm,xn)
& ? [X0] :
( xn = sdtpldt0(xm,X0)
& aNaturalNumber0(X0) ) )
=> ( sdtlseqdt0(xm,xl)
| ? [X0] :
( xl = sdtpldt0(xm,X0)
& aNaturalNumber0(X0) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.qFUIzaFZHZ/Vampire---4.8_10281',m__) ).
fof(f291,plain,
~ aNaturalNumber0(sK1),
inference(subsumption_resolution,[],[f288,f56]) ).
fof(f56,plain,
aNaturalNumber0(sK0),
inference(cnf_transformation,[],[f45]) ).
fof(f288,plain,
( ~ aNaturalNumber0(sK0)
| ~ aNaturalNumber0(sK1) ),
inference(resolution,[],[f285,f70]) ).
fof(f70,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f40]) ).
fof(f40,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> aNaturalNumber0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox/tmp/tmp.qFUIzaFZHZ/Vampire---4.8_10281',mSortsB) ).
fof(f285,plain,
~ aNaturalNumber0(sdtpldt0(sK1,sK0)),
inference(subsumption_resolution,[],[f284,f56]) ).
fof(f284,plain,
( ~ aNaturalNumber0(sdtpldt0(sK1,sK0))
| ~ aNaturalNumber0(sK0) ),
inference(trivial_inequality_removal,[],[f277]) ).
fof(f277,plain,
( xl != xl
| ~ aNaturalNumber0(sdtpldt0(sK1,sK0))
| ~ aNaturalNumber0(sK0) ),
inference(superposition,[],[f203,f57]) ).
fof(f57,plain,
xl = sdtpldt0(xn,sK0),
inference(cnf_transformation,[],[f45]) ).
fof(f203,plain,
! [X0] :
( xl != sdtpldt0(xn,X0)
| ~ aNaturalNumber0(sdtpldt0(sK1,X0))
| ~ aNaturalNumber0(X0) ),
inference(superposition,[],[f59,f108]) ).
fof(f108,plain,
! [X0] :
( sdtpldt0(xn,X0) = sdtpldt0(xm,sdtpldt0(sK1,X0))
| ~ aNaturalNumber0(X0) ),
inference(subsumption_resolution,[],[f107,f50]) ).
fof(f50,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f22]) ).
fof(f22,axiom,
( aNaturalNumber0(xl)
& aNaturalNumber0(xn)
& aNaturalNumber0(xm) ),
file('/export/starexec/sandbox/tmp/tmp.qFUIzaFZHZ/Vampire---4.8_10281',m__773) ).
fof(f107,plain,
! [X0] :
( sdtpldt0(xn,X0) = sdtpldt0(xm,sdtpldt0(sK1,X0))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(xm) ),
inference(subsumption_resolution,[],[f100,f53]) ).
fof(f100,plain,
! [X0] :
( sdtpldt0(xn,X0) = sdtpldt0(xm,sdtpldt0(sK1,X0))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(sK1)
| ~ aNaturalNumber0(xm) ),
inference(superposition,[],[f68,f54]) ).
fof(f54,plain,
xn = sdtpldt0(xm,sK1),
inference(cnf_transformation,[],[f45]) ).
fof(f68,plain,
! [X2,X0,X1] :
( sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0,X1,X2] :
( sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f36]) ).
fof(f36,plain,
! [X0,X1,X2] :
( sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.qFUIzaFZHZ/Vampire---4.8_10281',mAddAsso) ).
fof(f59,plain,
! [X0] :
( xl != sdtpldt0(xm,X0)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM460+2 : TPTP v8.1.2. Released v4.0.0.
% 0.13/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.35 % Computer : n022.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 : Fri May 3 15:11:52 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.qFUIzaFZHZ/Vampire---4.8_10281
% 0.56/0.73 % (10395)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.56/0.73 % (10389)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.56/0.73 % (10390)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.56/0.73 % (10393)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.56/0.73 % (10392)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.56/0.73 % (10394)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.56/0.74 % (10396)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.56/0.74 % (10396)Refutation not found, incomplete strategy% (10396)------------------------------
% 0.56/0.74 % (10396)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.74 % (10396)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.74
% 0.56/0.74 % (10396)Memory used [KB]: 1040
% 0.56/0.74 % (10396)Time elapsed: 0.004 s
% 0.56/0.74 % (10396)Instructions burned: 3 (million)
% 0.56/0.74 % (10393)Refutation not found, incomplete strategy% (10393)------------------------------
% 0.56/0.74 % (10393)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.74 % (10396)------------------------------
% 0.56/0.74 % (10396)------------------------------
% 0.56/0.74 % (10393)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.74
% 0.56/0.74 % (10393)Memory used [KB]: 1062
% 0.56/0.74 % (10393)Time elapsed: 0.005 s
% 0.56/0.74 % (10393)Instructions burned: 6 (million)
% 0.56/0.74 % (10393)------------------------------
% 0.56/0.74 % (10393)------------------------------
% 0.56/0.74 % (10391)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.56/0.74 % (10394)First to succeed.
% 0.56/0.74 % (10394)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-10388"
% 0.56/0.74 % (10394)Refutation found. Thanks to Tanya!
% 0.56/0.74 % SZS status Theorem for Vampire---4
% 0.56/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.74 % (10394)------------------------------
% 0.56/0.74 % (10394)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.74 % (10394)Termination reason: Refutation
% 0.56/0.74
% 0.56/0.74 % (10394)Memory used [KB]: 1084
% 0.56/0.74 % (10394)Time elapsed: 0.008 s
% 0.56/0.74 % (10394)Instructions burned: 12 (million)
% 0.56/0.74 % (10388)Success in time 0.378 s
% 0.56/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------