TSTP Solution File: NUN067+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUN067+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 : n025.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:10 EDT 2024
% Result : Theorem 0.57s 0.75s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 10 unt; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 86 ( 42 ~; 24 |; 18 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 57 ( 49 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f117,plain,
$false,
inference(resolution,[],[f114,f109]) ).
fof(f109,plain,
! [X0] : r2(X0,sK4(X0)),
inference(resolution,[],[f75,f71]) ).
fof(f71,plain,
! [X0] : id(X0,X0),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0] : id(X0,X0),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X13] : id(X13,X13),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f75,plain,
! [X2,X0] :
( ~ id(X2,sK4(X0))
| r2(X0,X2) ),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0,X2] :
( ( ~ id(X2,sK4(X0))
& ~ r2(X0,X2) )
| ( r2(X0,X2)
& id(X2,sK4(X0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f30,f41]) ).
fof(f41,plain,
! [X0] :
( ? [X1] :
! [X2] :
( ( ~ id(X2,X1)
& ~ r2(X0,X2) )
| ( r2(X0,X2)
& id(X2,X1) ) )
=> ! [X2] :
( ( ~ id(X2,sK4(X0))
& ~ r2(X0,X2) )
| ( r2(X0,X2)
& id(X2,sK4(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
! [X0] :
? [X1] :
! [X2] :
( ( ~ id(X2,X1)
& ~ r2(X0,X2) )
| ( r2(X0,X2)
& id(X2,X1) ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X2] :
? [X3] :
! [X4] :
( ( ~ id(X4,X3)
& ~ r2(X2,X4) )
| ( r2(X2,X4)
& id(X4,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f114,plain,
! [X0,X1] : ~ r2(X1,X0),
inference(forward_literal_rewriting,[],[f113,f72]) ).
fof(f72,plain,
! [X2,X0] :
( id(X2,sK4(X0))
| ~ r2(X0,X2) ),
inference(cnf_transformation,[],[f42]) ).
fof(f113,plain,
! [X0,X1] : ~ id(X0,sK4(X1)),
inference(resolution,[],[f109,f112]) ).
fof(f112,plain,
! [X2,X0,X1] :
( ~ r2(X0,X1)
| ~ id(X2,X1) ),
inference(subsumption_resolution,[],[f55,f96]) ).
fof(f96,plain,
! [X0] : r1(X0),
inference(subsumption_resolution,[],[f91,f54]) ).
fof(f54,plain,
! [X0] : r1(sK0(X0)),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0] :
( r1(sK0(X0))
& id(X0,sK0(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f35,f36]) ).
fof(f36,plain,
! [X0] :
( ? [X1] :
( r1(X1)
& id(X0,X1) )
=> ( r1(sK0(X0))
& id(X0,sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f35,plain,
! [X0] :
? [X1] :
( r1(X1)
& id(X0,X1) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
~ ? [X0] :
! [X1] :
( ~ r1(X1)
| ~ id(X0,X1) ),
inference(rectify,[],[f20]) ).
fof(f20,negated_conjecture,
~ ? [X62] :
! [X45] :
( ~ r1(X45)
| ~ id(X62,X45) ),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
? [X62] :
! [X45] :
( ~ r1(X45)
| ~ id(X62,X45) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonzerosexistid) ).
fof(f91,plain,
! [X0] :
( ~ r1(sK0(X0))
| r1(X0) ),
inference(resolution,[],[f66,f53]) ).
fof(f53,plain,
! [X0] : id(X0,sK0(X0)),
inference(cnf_transformation,[],[f37]) ).
fof(f66,plain,
! [X0,X1] :
( ~ id(X0,X1)
| ~ r1(X1)
| r1(X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( ( r1(X1)
& r1(X0) )
| ( ~ r1(X1)
& ~ r1(X0) )
| ~ id(X0,X1) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X19,X20] :
( ( r1(X20)
& r1(X19) )
| ( ~ r1(X20)
& ~ r1(X19) )
| ~ id(X19,X20) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(f55,plain,
! [X2,X0,X1] :
( ~ r2(X0,X1)
| ~ r1(X2)
| ~ id(X2,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ~ r2(X0,X1)
| ! [X2] :
( ~ r1(X2)
| ~ id(X2,X1) ) ),
inference(rectify,[],[f18]) ).
fof(f18,axiom,
! [X64,X65] :
( ~ r2(X64,X65)
| ! [X66] :
( ~ r1(X66)
| ~ id(X66,X65) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7a) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUN067+1 : TPTP v8.2.0. Released v7.3.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.36 % Computer : n025.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat May 18 16:07:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_NEQ problem
% 0.14/0.36 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.57/0.74 % (5676)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.57/0.74 % (5676)Refutation not found, incomplete strategy% (5676)------------------------------
% 0.57/0.74 % (5676)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.74 % (5676)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.74
% 0.57/0.74 % (5676)Memory used [KB]: 1053
% 0.57/0.74 % (5676)Time elapsed: 0.002 s
% 0.57/0.74 % (5676)Instructions burned: 2 (million)
% 0.57/0.74 % (5671)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.57/0.74 % (5673)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.57/0.74 % (5674)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.57/0.74 % (5676)------------------------------
% 0.57/0.74 % (5676)------------------------------
% 0.57/0.74 % (5672)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.57/0.74 % (5678)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.57/0.75 % (5671)First to succeed.
% 0.57/0.75 % (5678)Also succeeded, but the first one will report.
% 0.57/0.75 % (5674)Refutation not found, incomplete strategy% (5674)------------------------------
% 0.57/0.75 % (5674)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (5674)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75
% 0.57/0.75 % (5674)Memory used [KB]: 1055
% 0.57/0.75 % (5674)Time elapsed: 0.004 s
% 0.57/0.75 % (5677)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.57/0.75 % (5674)Instructions burned: 5 (million)
% 0.57/0.75 % (5671)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5670"
% 0.57/0.75 % (5674)------------------------------
% 0.57/0.75 % (5674)------------------------------
% 0.57/0.75 % (5672)Also succeeded, but the first one will report.
% 0.57/0.75 % (5679)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 theBenchmark for (2996ds/55Mi)
% 0.57/0.75 % (5671)Refutation found. Thanks to Tanya!
% 0.57/0.75 % SZS status Theorem for theBenchmark
% 0.57/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 0.57/0.75 % (5671)------------------------------
% 0.57/0.75 % (5671)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (5671)Termination reason: Refutation
% 0.57/0.75
% 0.57/0.75 % (5671)Memory used [KB]: 1082
% 0.57/0.75 % (5671)Time elapsed: 0.004 s
% 0.57/0.75 % (5671)Instructions burned: 4 (million)
% 0.57/0.75 % (5670)Success in time 0.376 s
% 0.57/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------