TSTP Solution File: NUN076+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUN076+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 : n005.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:15 EDT 2024
% Result : Theorem 0.61s 0.83s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 58 ( 20 unt; 0 def)
% Number of atoms : 178 ( 49 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 187 ( 67 ~; 44 |; 67 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 138 ( 88 !; 50 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f146,plain,
$false,
inference(avatar_sat_refutation,[],[f141,f143,f145]) ).
fof(f145,plain,
~ spl20_1,
inference(avatar_contradiction_clause,[],[f144]) ).
fof(f144,plain,
( $false
| ~ spl20_1 ),
inference(resolution,[],[f137,f133]) ).
fof(f133,plain,
! [X0] : r3(X0,sK8,X0),
inference(backward_demodulation,[],[f109,f120]) ).
fof(f120,plain,
! [X0] : sK7(X0) = sK8,
inference(resolution,[],[f69,f64]) ).
fof(f64,plain,
! [X0] : r1(sK7(X0)),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0] :
( sK6(X0) = X0
& r3(X0,sK7(X0),sK6(X0))
& r1(sK7(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f18,f34,f33]) ).
fof(f33,plain,
! [X0] :
( ? [X1] :
( X0 = X1
& ? [X2] :
( r3(X0,X2,X1)
& r1(X2) ) )
=> ( sK6(X0) = X0
& ? [X2] :
( r3(X0,X2,sK6(X0))
& r1(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
! [X0] :
( ? [X2] :
( r3(X0,X2,sK6(X0))
& r1(X2) )
=> ( r3(X0,sK7(X0),sK6(X0))
& r1(sK7(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f18,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(f69,plain,
! [X1] :
( ~ r1(X1)
| sK8 = X1 ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X1] :
( ( sK8 = X1
& r1(X1) )
| ( sK8 != X1
& ~ r1(X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f1,f36]) ).
fof(f36,plain,
( ? [X0] :
! [X1] :
( ( X0 = X1
& r1(X1) )
| ( X0 != X1
& ~ r1(X1) ) )
=> ! [X1] :
( ( sK8 = X1
& r1(X1) )
| ( sK8 != X1
& ~ r1(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f1,axiom,
? [X0] :
! [X1] :
( ( X0 = X1
& r1(X1) )
| ( X0 != X1
& ~ r1(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
fof(f109,plain,
! [X0] : r3(X0,sK7(X0),X0),
inference(forward_demodulation,[],[f65,f66]) ).
fof(f66,plain,
! [X0] : sK6(X0) = X0,
inference(cnf_transformation,[],[f35]) ).
fof(f65,plain,
! [X0] : r3(X0,sK7(X0),sK6(X0)),
inference(cnf_transformation,[],[f35]) ).
fof(f137,plain,
( ! [X1] : ~ r3(sK8,X1,sK8)
| ~ spl20_1 ),
inference(avatar_component_clause,[],[f136]) ).
fof(f136,plain,
( spl20_1
<=> ! [X1] : ~ r3(sK8,X1,sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl20_1])]) ).
fof(f143,plain,
~ spl20_2,
inference(avatar_contradiction_clause,[],[f142]) ).
fof(f142,plain,
( $false
| ~ spl20_2 ),
inference(resolution,[],[f140,f104]) ).
fof(f104,plain,
! [X0] : r2(X0,sK17(X0)),
inference(equality_resolution,[],[f83]) ).
fof(f83,plain,
! [X2,X0] :
( r2(X0,X2)
| sK17(X0) != X2 ),
inference(cnf_transformation,[],[f49]) ).
fof(f49,plain,
! [X0,X2] :
( ( sK17(X0) = X2
& r2(X0,X2) )
| ( sK17(X0) != X2
& ~ r2(X0,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK17])],[f22,f48]) ).
fof(f48,plain,
! [X0] :
( ? [X1] :
! [X2] :
( ( X1 = X2
& r2(X0,X2) )
| ( X1 != X2
& ~ r2(X0,X2) ) )
=> ! [X2] :
( ( sK17(X0) = X2
& r2(X0,X2) )
| ( sK17(X0) != X2
& ~ r2(X0,X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f22,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(f140,plain,
( ! [X0] : ~ r2(sK17(sK8),X0)
| ~ spl20_2 ),
inference(avatar_component_clause,[],[f139]) ).
fof(f139,plain,
( spl20_2
<=> ! [X0] : ~ r2(sK17(sK8),X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl20_2])]) ).
fof(f141,plain,
( spl20_1
| spl20_2 ),
inference(avatar_split_clause,[],[f134,f139,f136]) ).
fof(f134,plain,
! [X0,X1] :
( ~ r2(sK17(sK8),X0)
| ~ r3(sK8,X1,sK8) ),
inference(resolution,[],[f126,f117]) ).
fof(f117,plain,
! [X2,X3,X0,X1] :
( ~ r4(X3,X0,X2)
| ~ r2(sK17(sK8),X3)
| ~ r3(X0,X1,X2) ),
inference(resolution,[],[f104,f110]) ).
fof(f110,plain,
! [X2,X3,X0,X1,X4] :
( ~ r2(sK8,X0)
| ~ r3(X1,X2,X3)
| ~ r2(X0,X4)
| ~ r4(X4,X1,X3) ),
inference(resolution,[],[f101,f98]) ).
fof(f98,plain,
! [X2,X1,X6,X7,X4,X5] :
( ~ r1(X7)
| ~ r2(X7,X6)
| ~ r3(X1,X2,X4)
| ~ r2(X6,X5)
| ~ r4(X5,X1,X4) ),
inference(equality_resolution,[],[f97]) ).
fof(f97,plain,
! [X2,X3,X1,X6,X7,X4,X5] :
( ~ r3(X1,X2,X3)
| ~ r2(X7,X6)
| ~ r1(X7)
| ~ r2(X6,X5)
| ~ r4(X5,X1,X4)
| X3 != X4 ),
inference(equality_resolution,[],[f54]) ).
fof(f54,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( X0 != X3
| ~ r3(X1,X2,X3)
| ~ r2(X7,X6)
| ~ r1(X7)
| ~ r2(X6,X5)
| ~ r4(X5,X1,X4)
| X0 != X4 ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ! [X3] :
( X0 != X3
| ~ r3(X1,X2,X3) )
| ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ~ r2(X7,X6)
| ~ r1(X7) )
| ~ r2(X6,X5) )
| ~ r4(X5,X1,X4) )
| X0 != X4 ) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ? [X0,X1,X2] :
( ? [X3] :
( X0 = X3
& r3(X1,X2,X3) )
& ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( r2(X7,X6)
& r1(X7) )
& r2(X6,X5) )
& r4(X5,X1,X4) )
& X0 = X4 ) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ? [X38,X21,X22] :
( ? [X16] :
( X16 = X38
& r3(X21,X22,X16) )
& ? [X15] :
( ? [X24] :
( ? [X18] :
( ? [X33] :
( r2(X33,X18)
& r1(X33) )
& r2(X18,X24) )
& r4(X24,X21,X15) )
& X15 = X38 ) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
? [X38,X21,X22] :
( ? [X16] :
( X16 = X38
& r3(X21,X22,X16) )
& ? [X15] :
( ? [X24] :
( ? [X18] :
( ? [X33] :
( r2(X33,X18)
& r1(X33) )
& r2(X18,X24) )
& r4(X24,X21,X15) )
& X15 = X38 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thereexistsanevennumber) ).
fof(f101,plain,
r1(sK8),
inference(equality_resolution,[],[f68]) ).
fof(f68,plain,
! [X1] :
( r1(X1)
| sK8 != X1 ),
inference(cnf_transformation,[],[f37]) ).
fof(f126,plain,
! [X0] : r4(X0,sK8,sK8),
inference(backward_demodulation,[],[f124,f119]) ).
fof(f119,plain,
! [X0] : sK5(X0) = sK8,
inference(resolution,[],[f69,f60]) ).
fof(f60,plain,
! [X0] : r1(sK5(X0)),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0] :
( sK3(X0) = sK4(X0)
& r1(sK4(X0))
& r4(X0,sK5(X0),sK3(X0))
& r1(sK5(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f17,f31,f30,f29]) ).
fof(f29,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( X1 = X2
& r1(X2) )
& ? [X3] :
( r4(X0,X3,X1)
& r1(X3) ) )
=> ( ? [X2] :
( sK3(X0) = X2
& r1(X2) )
& ? [X3] :
( r4(X0,X3,sK3(X0))
& r1(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
! [X0] :
( ? [X2] :
( sK3(X0) = X2
& r1(X2) )
=> ( sK3(X0) = sK4(X0)
& r1(sK4(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
! [X0] :
( ? [X3] :
( r4(X0,X3,sK3(X0))
& r1(X3) )
=> ( r4(X0,sK5(X0),sK3(X0))
& r1(sK5(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
! [X0] :
? [X1] :
( ? [X2] :
( X1 = X2
& r1(X2) )
& ? [X3] :
( r4(X0,X3,X1)
& r1(X3) ) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X32] :
? [X33] :
( ? [X35] :
( X33 = X35
& r1(X35) )
& ? [X34] :
( r4(X32,X34,X33)
& r1(X34) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5a) ).
fof(f124,plain,
! [X0] : r4(X0,sK5(X0),sK8),
inference(backward_demodulation,[],[f94,f118]) ).
fof(f118,plain,
! [X0] : sK4(X0) = sK8,
inference(resolution,[],[f69,f62]) ).
fof(f62,plain,
! [X0] : r1(sK4(X0)),
inference(cnf_transformation,[],[f32]) ).
fof(f94,plain,
! [X0] : r4(X0,sK5(X0),sK4(X0)),
inference(definition_unfolding,[],[f61,f63]) ).
fof(f63,plain,
! [X0] : sK3(X0) = sK4(X0),
inference(cnf_transformation,[],[f32]) ).
fof(f61,plain,
! [X0] : r4(X0,sK5(X0),sK3(X0)),
inference(cnf_transformation,[],[f32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUN076+2 : TPTP v8.2.0. Released v7.3.0.
% 0.12/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.36 % Computer : n005.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 15:13:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36 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.61/0.82 % (1960)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.61/0.83 % (1953)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.61/0.83 % (1955)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.61/0.83 % (1954)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.61/0.83 % (1956)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.61/0.83 % (1957)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.61/0.83 % (1960)Refutation not found, incomplete strategy% (1960)------------------------------
% 0.61/0.83 % (1960)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.83 % (1958)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.61/0.83 % (1960)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.83
% 0.61/0.83 % (1960)Memory used [KB]: 1065
% 0.61/0.83 % (1960)Time elapsed: 0.002 s
% 0.61/0.83 % (1960)Instructions burned: 4 (million)
% 0.61/0.83 % (1959)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.61/0.83 % (1960)------------------------------
% 0.61/0.83 % (1960)------------------------------
% 0.61/0.83 % (1957)Refutation not found, incomplete strategy% (1957)------------------------------
% 0.61/0.83 % (1957)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.83 % (1957)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.83
% 0.61/0.83 % (1957)Memory used [KB]: 1067
% 0.61/0.83 % (1957)Time elapsed: 0.004 s
% 0.61/0.83 % (1957)Instructions burned: 4 (million)
% 0.61/0.83 % (1958)Refutation not found, incomplete strategy% (1958)------------------------------
% 0.61/0.83 % (1958)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.83 % (1958)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.83
% 0.61/0.83 % (1958)Memory used [KB]: 1065
% 0.61/0.83 % (1958)Time elapsed: 0.004 s
% 0.61/0.83 % (1958)Instructions burned: 4 (million)
% 0.61/0.83 % (1953)Refutation not found, incomplete strategy% (1953)------------------------------
% 0.61/0.83 % (1953)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.83 % (1953)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.83
% 0.61/0.83 % (1953)Memory used [KB]: 1067
% 0.61/0.83 % (1953)Time elapsed: 0.004 s
% 0.61/0.83 % (1953)Instructions burned: 5 (million)
% 0.61/0.83 % (1958)------------------------------
% 0.61/0.83 % (1958)------------------------------
% 0.61/0.83 % (1957)------------------------------
% 0.61/0.83 % (1957)------------------------------
% 0.61/0.83 % (1953)------------------------------
% 0.61/0.83 % (1953)------------------------------
% 0.61/0.83 % (1963)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 (2995ds/55Mi)
% 0.61/0.83 % (1955)First to succeed.
% 0.61/0.83 % (1956)Also succeeded, but the first one will report.
% 0.61/0.83 % (1955)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1767"
% 0.61/0.83 % (1955)Refutation found. Thanks to Tanya!
% 0.61/0.83 % SZS status Theorem for theBenchmark
% 0.61/0.83 % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.83 % (1955)------------------------------
% 0.61/0.83 % (1955)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.83 % (1955)Termination reason: Refutation
% 0.61/0.83
% 0.61/0.83 % (1955)Memory used [KB]: 1085
% 0.61/0.83 % (1955)Time elapsed: 0.006 s
% 0.61/0.83 % (1955)Instructions burned: 6 (million)
% 0.61/0.83 % (1767)Success in time 0.461 s
% 0.61/0.83 % Vampire---4.8 exiting
%------------------------------------------------------------------------------