TSTP Solution File: NUN070+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUN070+1 : 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/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 : Tue May 21 02:17:11 EDT 2024
% Result : Theorem 0.56s 0.73s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 29 ( 6 unt; 0 def)
% Number of atoms : 110 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 118 ( 37 ~; 27 |; 48 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 0 con; 1-2 aty)
% Number of variables : 102 ( 52 !; 50 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f174,plain,
$false,
inference(resolution,[],[f162,f97]) ).
fof(f97,plain,
! [X0] : r1(sK9(X0)),
inference(cnf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0] :
( r3(X0,sK9(X0),sK8(X0))
& r1(sK9(X0))
& id(sK8(X0),X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9])],[f32,f53,f52]) ).
fof(f52,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( r3(X0,X2,X1)
& r1(X2) )
& id(X1,X0) )
=> ( ? [X2] :
( r3(X0,X2,sK8(X0))
& r1(X2) )
& id(sK8(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f53,plain,
! [X0] :
( ? [X2] :
( r3(X0,X2,sK8(X0))
& r1(X2) )
=> ( r3(X0,sK9(X0),sK8(X0))
& r1(sK9(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
! [X0] :
? [X1] :
( ? [X2] :
( r3(X0,X2,X1)
& r1(X2) )
& id(X1,X0) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X53] :
? [X54] :
( ? [X55] :
( r3(X53,X55,X54)
& r1(X55) )
& id(X54,X53) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4a) ).
fof(f162,plain,
! [X0] : ~ r1(X0),
inference(resolution,[],[f159,f100]) ).
fof(f100,plain,
! [X1] : r2(X1,sK13(X1)),
inference(cnf_transformation,[],[f59]) ).
fof(f59,plain,
! [X0,X1] :
( r3(sK11(X0,X1),X0,sK10(X0,X1))
& r2(X1,sK13(X1))
& id(sK12(X0,X1),sK10(X0,X1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11,sK12,sK13])],[f38,f58,f57,f56,f55]) ).
fof(f55,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] : r3(X3,X0,X2)
& ? [X4] :
( ? [X5] : r2(X1,X5)
& id(X4,X2) ) )
=> ( ? [X3] : r3(X3,X0,sK10(X0,X1))
& ? [X4] :
( ? [X5] : r2(X1,X5)
& id(X4,sK10(X0,X1)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f56,plain,
! [X0,X1] :
( ? [X3] : r3(X3,X0,sK10(X0,X1))
=> r3(sK11(X0,X1),X0,sK10(X0,X1)) ),
introduced(choice_axiom,[]) ).
fof(f57,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] : r2(X1,X5)
& id(X4,sK10(X0,X1)) )
=> ( ? [X5] : r2(X1,X5)
& id(sK12(X0,X1),sK10(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f58,plain,
! [X1] :
( ? [X5] : r2(X1,X5)
=> r2(X1,sK13(X1)) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
! [X0,X1] :
? [X2] :
( ? [X3] : r3(X3,X0,X2)
& ? [X4] :
( ? [X5] : r2(X1,X5)
& id(X4,X2) ) ),
inference(pure_predicate_removal,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
? [X2] :
( ? [X3] :
( r4(X0,X1,X3)
& r3(X3,X0,X2) )
& ? [X4] :
( ? [X5] :
( r4(X0,X5,X4)
& r2(X1,X5) )
& id(X4,X2) ) ),
inference(rectify,[],[f13]) ).
fof(f13,axiom,
! [X43,X44] :
? [X45] :
( ? [X48] :
( r4(X43,X44,X48)
& r3(X48,X43,X45) )
& ? [X46] :
( ? [X47] :
( r4(X43,X47,X46)
& r2(X44,X47) )
& id(X46,X45) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2a) ).
fof(f159,plain,
! [X0,X1] :
( ~ r2(X0,X1)
| ~ r1(X0) ),
inference(duplicate_literal_removal,[],[f158]) ).
fof(f158,plain,
! [X0,X1] :
( ~ r2(X0,X1)
| ~ r1(X0)
| ~ r1(X0) ),
inference(factoring,[],[f122]) ).
fof(f122,plain,
! [X2,X0,X1] :
( ~ r2(X1,X2)
| ~ r1(X0)
| ~ r1(X1)
| ~ r2(X0,X2) ),
inference(resolution,[],[f120,f96]) ).
fof(f96,plain,
! [X0] : id(sK8(X0),X0),
inference(cnf_transformation,[],[f54]) ).
fof(f120,plain,
! [X2,X3,X0,X1] :
( ~ id(sK8(X1),X2)
| ~ r1(X0)
| ~ r2(X3,X1)
| ~ r1(X3)
| ~ r2(X0,X2) ),
inference(subsumption_resolution,[],[f119,f97]) ).
fof(f119,plain,
! [X2,X3,X0,X1] :
( ~ r1(X0)
| ~ id(sK8(X1),X2)
| ~ r2(X3,X1)
| ~ r1(X3)
| ~ r2(X0,X2)
| ~ r1(sK9(X1)) ),
inference(resolution,[],[f98,f67]) ).
fof(f67,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ r3(X3,X5,X0)
| ~ r1(X2)
| ~ id(X0,X1)
| ~ r2(X4,X3)
| ~ r1(X4)
| ~ r2(X2,X1)
| ~ r1(X5) ),
inference(cnf_transformation,[],[f39]) ).
fof(f39,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ~ r2(X2,X1)
| ~ r1(X2) )
| ~ id(X0,X1) )
| ! [X3] :
( ! [X4] :
( ~ r2(X4,X3)
| ~ r1(X4) )
| ! [X5] :
( ~ r3(X3,X5,X0)
| ~ r1(X5) ) ) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
~ ? [X0] :
( ? [X1] :
( ? [X2] :
( r2(X2,X1)
& r1(X2) )
& id(X0,X1) )
& ? [X3] :
( ? [X4] :
( r2(X4,X3)
& r1(X4) )
& ? [X5] :
( r3(X3,X5,X0)
& r1(X5) ) ) ),
inference(rectify,[],[f20]) ).
fof(f20,negated_conjecture,
~ ? [X62] :
( ? [X46] :
( ? [X48] :
( r2(X48,X46)
& r1(X48) )
& id(X62,X46) )
& ? [X45] :
( ? [X40] :
( r2(X40,X45)
& r1(X40) )
& ? [X39] :
( r3(X45,X39,X62)
& r1(X39) ) ) ),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
? [X62] :
( ? [X46] :
( ? [X48] :
( r2(X48,X46)
& r1(X48) )
& id(X62,X46) )
& ? [X45] :
( ? [X40] :
( r2(X40,X45)
& r1(X40) )
& ? [X39] :
( r3(X45,X39,X62)
& r1(X39) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',onepluszeroidone) ).
fof(f98,plain,
! [X0] : r3(X0,sK9(X0),sK8(X0)),
inference(cnf_transformation,[],[f54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUN070+1 : TPTP v8.2.0. Released v7.3.0.
% 0.11/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.15/0.35 % Computer : n022.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat May 18 15:08:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a FOF_THM_RFO_NEQ problem
% 0.15/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/benchmark/theBenchmark.p
% 0.56/0.73 % (26375)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 (2996ds/56Mi)
% 0.56/0.73 % (26368)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.56/0.73 % (26370)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.56/0.73 % (26369)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.56/0.73 % (26371)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.56/0.73 % (26372)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.56/0.73 % (26369)Also succeeded, but the first one will report.
% 0.56/0.73 % (26368)First to succeed.
% 0.56/0.73 % (26374)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.56/0.73 % (26375)Also succeeded, but the first one will report.
% 0.56/0.73 % (26370)Also succeeded, but the first one will report.
% 0.56/0.73 % (26368)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-26367"
% 0.56/0.73 % (26368)Refutation found. Thanks to Tanya!
% 0.56/0.73 % SZS status Theorem for theBenchmark
% 0.56/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.73 % (26368)------------------------------
% 0.56/0.73 % (26368)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (26368)Termination reason: Refutation
% 0.56/0.73
% 0.56/0.73 % (26368)Memory used [KB]: 1112
% 0.56/0.73 % (26368)Time elapsed: 0.005 s
% 0.56/0.73 % (26368)Instructions burned: 6 (million)
% 0.56/0.73 % (26367)Success in time 0.377 s
% 0.56/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------