TSTP Solution File: NUN081+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUN081+2 : TPTP v8.2.0. Released v7.3.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 : n032.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 02:17:18 EDT 2024
% Result : Theorem 0.55s 0.76s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 6 unt; 0 def)
% Number of atoms : 95 ( 22 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 113 ( 44 ~; 29 |; 37 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 0 con; 1-1 aty)
% Number of variables : 86 ( 54 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f98,plain,
$false,
inference(resolution,[],[f94,f55]) ).
fof(f55,plain,
! [X0] : r1(sK6(X0)),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0] :
( sK5(X0) = X0
& r3(X0,sK6(X0),sK5(X0))
& r1(sK6(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f19,f31,f30]) ).
fof(f30,plain,
! [X0] :
( ? [X1] :
( X0 = X1
& ? [X2] :
( r3(X0,X2,X1)
& r1(X2) ) )
=> ( sK5(X0) = X0
& ? [X2] :
( r3(X0,X2,sK5(X0))
& r1(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
! [X0] :
( ? [X2] :
( r3(X0,X2,sK5(X0))
& r1(X2) )
=> ( r3(X0,sK6(X0),sK5(X0))
& r1(sK6(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
! [X0] :
? [X1] :
( X0 = X1
& ? [X2] :
( r3(X0,X2,X1)
& r1(X2) ) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X29] :
? [X30] :
( X29 = X30
& ? [X31] :
( r3(X29,X31,X30)
& r1(X31) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4a) ).
fof(f94,plain,
! [X0] : ~ r1(X0),
inference(resolution,[],[f89,f74]) ).
fof(f74,plain,
! [X0] : r2(X0,sK4(X0)),
inference(equality_resolution,[],[f52]) ).
fof(f52,plain,
! [X2,X0] :
( r2(X0,X2)
| sK4(X0) != X2 ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X2] :
( ( sK4(X0) = X2
& r2(X0,X2) )
| ( sK4(X0) != X2
& ~ r2(X0,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f18,f28]) ).
fof(f28,plain,
! [X0] :
( ? [X1] :
! [X2] :
( ( X1 = X2
& r2(X0,X2) )
| ( X1 != X2
& ~ r2(X0,X2) ) )
=> ! [X2] :
( ( sK4(X0) = X2
& r2(X0,X2) )
| ( sK4(X0) != X2
& ~ r2(X0,X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
! [X0] :
? [X1] :
! [X2] :
( ( X1 = X2
& r2(X0,X2) )
| ( X1 != X2
& ~ r2(X0,X2) ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X2] :
? [X3] :
! [X4] :
( ( X3 = X4
& r2(X2,X4) )
| ( X3 != X4
& ~ r2(X2,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f89,plain,
! [X0,X1] :
( ~ r2(X0,X1)
| ~ r1(X0) ),
inference(resolution,[],[f84,f74]) ).
fof(f84,plain,
! [X2,X0,X1] :
( ~ r2(X1,X2)
| ~ r1(X0)
| ~ r2(X0,X1) ),
inference(resolution,[],[f81,f74]) ).
fof(f81,plain,
! [X2,X3,X0,X1] :
( ~ r2(X2,X3)
| ~ r1(X0)
| ~ r2(X1,X2)
| ~ r2(X0,X1) ),
inference(forward_demodulation,[],[f77,f57]) ).
fof(f57,plain,
! [X0] : sK5(X0) = X0,
inference(cnf_transformation,[],[f32]) ).
fof(f77,plain,
! [X2,X3,X0,X1] :
( ~ r1(X0)
| ~ r2(X1,X2)
| ~ r2(X2,sK5(X3))
| ~ r2(X0,X1) ),
inference(resolution,[],[f68,f56]) ).
fof(f56,plain,
! [X0] : r3(X0,sK6(X0),sK5(X0)),
inference(cnf_transformation,[],[f32]) ).
fof(f68,plain,
! [X3,X0,X1,X6,X4,X5] :
( ~ r3(X0,X1,X3)
| ~ r1(X6)
| ~ r2(X5,X4)
| ~ r2(X4,X3)
| ~ r2(X6,X5) ),
inference(equality_resolution,[],[f40]) ).
fof(f40,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ r2(X6,X5)
| ~ r1(X6)
| ~ r2(X5,X4)
| ~ r2(X4,X3)
| X2 != X3
| ~ r3(X0,X1,X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ r2(X6,X5)
| ~ r1(X6) )
| ~ r2(X5,X4) )
| ~ r2(X4,X3) )
| X2 != X3 )
| ~ r3(X0,X1,X2) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ? [X0,X1,X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( r2(X6,X5)
& r1(X6) )
& r2(X5,X4) )
& r2(X4,X3) )
& X2 = X3 )
& r3(X0,X1,X2) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ? [X38,X21,X22] :
( ? [X15] :
( ? [X16] :
( ? [X24] :
( ? [X18] :
( r2(X18,X24)
& r1(X18) )
& r2(X24,X16) )
& r2(X16,X15) )
& X15 = X22 )
& r3(X38,X21,X22) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
? [X38,X21,X22] :
( ? [X15] :
( ? [X16] :
( ? [X24] :
( ? [X18] :
( r2(X18,X24)
& r1(X18) )
& r2(X24,X16) )
& r2(X16,X15) )
& X15 = X22 )
& r3(X38,X21,X22) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xplusyeqthree) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : NUN081+2 : TPTP v8.2.0. Released v7.3.0.
% 0.00/0.09 % 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.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Sat May 18 15:11:37 EDT 2024
% 0.12/0.28 % CPUTime :
% 0.12/0.28 This is a FOF_THM_RFO_SEQ problem
% 0.12/0.28 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.55/0.76 % (5664)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 (2995ds/34Mi)
% 0.55/0.76 % (5666)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.55/0.76 % (5667)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.55/0.76 % (5668)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 (2995ds/34Mi)
% 0.55/0.76 % (5665)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 (2995ds/51Mi)
% 0.55/0.76 % (5670)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 (2995ds/83Mi)
% 0.55/0.76 % (5671)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.55/0.76 % (5669)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.55/0.76 % (5668)Refutation not found, incomplete strategy% (5668)------------------------------
% 0.55/0.76 % (5668)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76 % (5668)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.76
% 0.55/0.76 % (5668)Memory used [KB]: 1067
% 0.55/0.76 % (5668)Time elapsed: 0.003 s
% 0.55/0.76 % (5668)Instructions burned: 4 (million)
% 0.55/0.76 % (5668)------------------------------
% 0.55/0.76 % (5668)------------------------------
% 0.55/0.76 % (5670)Also succeeded, but the first one will report.
% 0.55/0.76 % (5669)First to succeed.
% 0.55/0.76 % (5667)Also succeeded, but the first one will report.
% 0.55/0.76 % (5665)Also succeeded, but the first one will report.
% 0.55/0.76 % (5666)Also succeeded, but the first one will report.
% 0.55/0.76 % (5664)Refutation not found, incomplete strategy% (5664)------------------------------
% 0.55/0.76 % (5664)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76 % (5664)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.76
% 0.55/0.76 % (5664)Memory used [KB]: 1067
% 0.55/0.76 % (5664)Time elapsed: 0.004 s
% 0.55/0.76 % (5664)Instructions burned: 5 (million)
% 0.55/0.76 % (5664)------------------------------
% 0.55/0.76 % (5664)------------------------------
% 0.55/0.76 % (5669)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-5598"
% 0.55/0.76 % (5669)Refutation found. Thanks to Tanya!
% 0.55/0.76 % SZS status Theorem for theBenchmark
% 0.55/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.76 % (5669)------------------------------
% 0.55/0.76 % (5669)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76 % (5669)Termination reason: Refutation
% 0.55/0.76
% 0.55/0.76 % (5669)Memory used [KB]: 1068
% 0.55/0.76 % (5669)Time elapsed: 0.004 s
% 0.55/0.76 % (5669)Instructions burned: 4 (million)
% 0.55/0.76 % (5598)Success in time 0.472 s
% 0.55/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------