TSTP Solution File: NUN068+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUN068+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 : n009.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.74s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 7
% Syntax : Number of formulae : 62 ( 5 unt; 0 def)
% Number of atoms : 153 ( 73 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 149 ( 58 ~; 77 |; 12 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 86 ( 77 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f715,plain,
$false,
inference(avatar_sat_refutation,[],[f419,f591,f714]) ).
fof(f714,plain,
~ spl23_8,
inference(avatar_contradiction_clause,[],[f706]) ).
fof(f706,plain,
( $false
| ~ spl23_8 ),
inference(unit_resulting_resolution,[],[f69,f593,f66]) ).
fof(f66,plain,
! [X2,X0] :
( ~ r2(X0,X2)
| ~ r1(X2) ),
inference(equality_resolution,[],[f32]) ).
fof(f32,plain,
! [X2,X0,X1] :
( ~ r1(X2)
| X1 != X2
| ~ r2(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ~ r2(X0,X1)
| ! [X2] :
( X1 != X2
| ~ r1(X2) ) ),
inference(rectify,[],[f11]) ).
fof(f11,axiom,
! [X40,X41] :
( ~ r2(X40,X41)
| ! [X42] :
( X41 != X42
| ~ r1(X42) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7a) ).
fof(f593,plain,
( ! [X0] : r1(X0)
| ~ spl23_8 ),
inference(superposition,[],[f67,f414]) ).
fof(f414,plain,
( ! [X0] : sK8 = X0
| ~ spl23_8 ),
inference(avatar_component_clause,[],[f413]) ).
fof(f413,plain,
( spl23_8
<=> ! [X0] : sK8 = X0 ),
introduced(avatar_definition,[new_symbols(naming,[spl23_8])]) ).
fof(f67,plain,
r1(sK8),
inference(equality_resolution,[],[f40]) ).
fof(f40,plain,
! [X1] :
( sK8 != X1
| r1(X1) ),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
? [X0] :
! [X1] :
( ( X0 = X1
& r1(X1) )
| ( X0 != X1
& ~ r1(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
fof(f69,plain,
! [X0] : r2(X0,sK9(X0)),
inference(equality_resolution,[],[f43]) ).
fof(f43,plain,
! [X2,X0] :
( sK9(X0) != X2
| r2(X0,X2) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,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(f591,plain,
spl23_9,
inference(avatar_contradiction_clause,[],[f590]) ).
fof(f590,plain,
( $false
| spl23_9 ),
inference(subsumption_resolution,[],[f582,f67]) ).
fof(f582,plain,
( ~ r1(sK8)
| spl23_9 ),
inference(resolution,[],[f540,f66]) ).
fof(f540,plain,
( r2(sK9(sK8),sK8)
| spl23_9 ),
inference(superposition,[],[f69,f506]) ).
fof(f506,plain,
( sK8 = sK9(sK9(sK8))
| spl23_9 ),
inference(unit_resulting_resolution,[],[f450,f320]) ).
fof(f320,plain,
! [X0] :
( r2(sK8,X0)
| sK8 = X0 ),
inference(duplicate_literal_removal,[],[f318]) ).
fof(f318,plain,
! [X0] :
( r2(sK8,X0)
| sK8 = X0
| sK8 = X0 ),
inference(superposition,[],[f299,f87]) ).
fof(f87,plain,
! [X0] :
( sK0(X0) = X0
| sK8 = X0 ),
inference(resolution,[],[f83,f41]) ).
fof(f41,plain,
! [X1] :
( ~ r1(X1)
| sK8 = X1 ),
inference(cnf_transformation,[],[f1]) ).
fof(f83,plain,
! [X0] :
( r1(X0)
| sK0(X0) = X0 ),
inference(duplicate_literal_removal,[],[f82]) ).
fof(f82,plain,
! [X0] :
( r1(X0)
| sK0(X0) = X0
| sK0(X0) = X0 ),
inference(superposition,[],[f30,f31]) ).
fof(f31,plain,
! [X0] :
( sK1(X0) = X0
| sK0(X0) = X0 ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0] :
( ? [X1] :
( X0 = X1
& r1(X1) )
| ? [X2] :
( X0 = X2
& ? [X3] :
( r2(X3,X2)
& r1(X3) ) ) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ? [X0] :
( ! [X1] :
( X0 != X1
| ~ r1(X1) )
& ! [X2] :
( X0 != X2
| ! [X3] :
( ~ r2(X3,X2)
| ~ r1(X3) ) ) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ? [X38] :
( ! [X15] :
( X15 != X38
| ~ r1(X15) )
& ! [X21] :
( X21 != X38
| ! [X22] :
( ~ r2(X22,X21)
| ~ r1(X22) ) ) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
? [X38] :
( ! [X15] :
( X15 != X38
| ~ r1(X15) )
& ! [X21] :
( X21 != X38
| ! [X22] :
( ~ r2(X22,X21)
| ~ r1(X22) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nonzerosnononesexist) ).
fof(f30,plain,
! [X0] :
( r1(sK1(X0))
| sK0(X0) = X0 ),
inference(cnf_transformation,[],[f25]) ).
fof(f299,plain,
! [X0] :
( r2(sK8,sK0(X0))
| sK8 = X0 ),
inference(superposition,[],[f69,f263]) ).
fof(f263,plain,
! [X0] :
( sK0(X0) = sK9(sK8)
| sK8 = X0 ),
inference(duplicate_literal_removal,[],[f229]) ).
fof(f229,plain,
! [X0] :
( sK8 = X0
| sK0(X0) = sK9(sK8)
| sK0(X0) = sK9(sK8) ),
inference(superposition,[],[f117,f113]) ).
fof(f113,plain,
! [X0] :
( sK1(X0) = X0
| sK0(X0) = sK9(sK8) ),
inference(resolution,[],[f94,f44]) ).
fof(f44,plain,
! [X2,X0] :
( ~ r2(X0,X2)
| sK9(X0) = X2 ),
inference(cnf_transformation,[],[f19]) ).
fof(f94,plain,
! [X0] :
( r2(sK8,sK0(X0))
| sK1(X0) = X0 ),
inference(duplicate_literal_removal,[],[f89]) ).
fof(f89,plain,
! [X0] :
( r2(sK8,sK0(X0))
| sK1(X0) = X0
| sK1(X0) = X0 ),
inference(superposition,[],[f27,f73]) ).
fof(f73,plain,
! [X0] :
( sK2(X0) = sK8
| sK1(X0) = X0 ),
inference(resolution,[],[f26,f41]) ).
fof(f26,plain,
! [X0] :
( r1(sK2(X0))
| sK1(X0) = X0 ),
inference(cnf_transformation,[],[f25]) ).
fof(f27,plain,
! [X0] :
( r2(sK2(X0),sK0(X0))
| sK1(X0) = X0 ),
inference(cnf_transformation,[],[f25]) ).
fof(f117,plain,
! [X0] :
( sK1(X0) = sK8
| sK0(X0) = sK9(sK8) ),
inference(resolution,[],[f112,f44]) ).
fof(f112,plain,
! [X0] :
( r2(sK8,sK0(X0))
| sK1(X0) = sK8 ),
inference(subsumption_resolution,[],[f109,f41]) ).
fof(f109,plain,
! [X0] :
( r2(sK8,sK0(X0))
| r1(sK1(X0))
| sK1(X0) = sK8 ),
inference(superposition,[],[f29,f75]) ).
fof(f75,plain,
! [X0] :
( sK2(X0) = sK8
| sK1(X0) = sK8 ),
inference(resolution,[],[f72,f41]) ).
fof(f72,plain,
! [X0] :
( r1(sK1(X0))
| sK2(X0) = sK8 ),
inference(resolution,[],[f28,f41]) ).
fof(f28,plain,
! [X0] :
( r1(sK2(X0))
| r1(sK1(X0)) ),
inference(cnf_transformation,[],[f25]) ).
fof(f29,plain,
! [X0] :
( r2(sK2(X0),sK0(X0))
| r1(sK1(X0)) ),
inference(cnf_transformation,[],[f25]) ).
fof(f450,plain,
( ~ r2(sK8,sK9(sK9(sK8)))
| spl23_9 ),
inference(unit_resulting_resolution,[],[f69,f418,f68]) ).
fof(f68,plain,
! [X3,X0,X1] :
( ~ r2(X1,X3)
| ~ r2(X0,X3)
| X0 = X1 ),
inference(equality_resolution,[],[f42]) ).
fof(f42,plain,
! [X2,X3,X0,X1] :
( ~ r2(X0,X3)
| X2 != X3
| ~ r2(X1,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( X0 = X1
| ! [X2] :
( ~ r2(X1,X2)
| ! [X3] :
( X2 != X3
| ~ r2(X0,X3) ) ) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X25,X26] :
( X25 = X26
| ! [X27] :
( ~ r2(X26,X27)
| ! [X28] :
( X27 != X28
| ~ r2(X25,X28) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3a) ).
fof(f418,plain,
( sK8 != sK9(sK8)
| spl23_9 ),
inference(avatar_component_clause,[],[f416]) ).
fof(f416,plain,
( spl23_9
<=> sK8 = sK9(sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl23_9])]) ).
fof(f419,plain,
( spl23_8
| ~ spl23_9 ),
inference(avatar_split_clause,[],[f406,f416,f413]) ).
fof(f406,plain,
! [X0] :
( sK8 != sK9(sK8)
| sK8 = X0 ),
inference(equality_factoring,[],[f301]) ).
fof(f301,plain,
! [X0] :
( sK9(sK8) = X0
| sK8 = X0 ),
inference(duplicate_literal_removal,[],[f277]) ).
fof(f277,plain,
! [X0] :
( sK9(sK8) = X0
| sK8 = X0
| sK8 = X0 ),
inference(superposition,[],[f263,f87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUN068+2 : TPTP v8.2.0. Released v7.3.0.
% 0.06/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.35 % Computer : n009.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 : Sat May 18 15:07:23 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.56/0.73 % (671)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 % (650)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 % (652)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 % (669)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 % (670)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.56/0.73 % (650)Refutation not found, incomplete strategy% (650)------------------------------
% 0.56/0.73 % (650)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (669)Refutation not found, incomplete strategy% (669)------------------------------
% 0.56/0.73 % (669)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (669)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.73
% 0.56/0.73 % (669)Memory used [KB]: 1067
% 0.56/0.73 % (669)Time elapsed: 0.003 s
% 0.56/0.73 % (669)Instructions burned: 4 (million)
% 0.56/0.73 % (650)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.73
% 0.56/0.73 % (650)Memory used [KB]: 1065
% 0.56/0.73 % (650)Time elapsed: 0.004 s
% 0.56/0.73 % (650)Instructions burned: 4 (million)
% 0.56/0.73 % (669)------------------------------
% 0.56/0.73 % (669)------------------------------
% 0.56/0.73 % (650)------------------------------
% 0.56/0.73 % (650)------------------------------
% 0.56/0.73 % (675)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2996ds/50Mi)
% 0.56/0.73 % (668)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.74 % (672)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.74 % (653)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.74 % (672)Refutation not found, incomplete strategy% (672)------------------------------
% 0.56/0.74 % (672)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.74 % (672)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.74
% 0.56/0.74 % (672)Memory used [KB]: 1054
% 0.56/0.74 % (672)Time elapsed: 0.003 s
% 0.56/0.74 % (672)Instructions burned: 3 (million)
% 0.56/0.74 % (672)------------------------------
% 0.56/0.74 % (672)------------------------------
% 0.56/0.74 % (671)First to succeed.
% 0.56/0.74 % (668)Refutation not found, incomplete strategy% (668)------------------------------
% 0.56/0.74 % (668)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.74 % (668)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.74
% 0.56/0.74 % (668)Memory used [KB]: 1054
% 0.56/0.74 % (668)Time elapsed: 0.004 s
% 0.56/0.74 % (668)Instructions burned: 3 (million)
% 0.56/0.74 % (668)------------------------------
% 0.56/0.74 % (668)------------------------------
% 0.56/0.74 % (671)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-649"
% 0.56/0.74 % (671)Refutation found. Thanks to Tanya!
% 0.56/0.74 % SZS status Theorem for theBenchmark
% 0.56/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.74 % (671)------------------------------
% 0.56/0.74 % (671)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.74 % (671)Termination reason: Refutation
% 0.56/0.74
% 0.56/0.74 % (671)Memory used [KB]: 1198
% 0.56/0.74 % (671)Time elapsed: 0.011 s
% 0.56/0.74 % (671)Instructions burned: 28 (million)
% 0.56/0.74 % (649)Success in time 0.381 s
% 0.56/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------