TSTP Solution File: MGT005-2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : MGT005-2 : TPTP v8.2.0. Released v2.4.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 : n002.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 00:42:02 EDT 2024
% Result : Unsatisfiable 0.55s 0.73s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 27
% Syntax : Number of formulae : 43 ( 26 unt; 0 def)
% Number of atoms : 95 ( 3 equ)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 102 ( 50 ~; 49 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 4 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 13 con; 0-0 aty)
% Number of variables : 28 ( 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f195,plain,
$false,
inference(avatar_sat_refutation,[],[f51,f94,f180,f194]) ).
fof(f194,plain,
( spl0_2
| ~ spl0_3
| ~ spl0_5 ),
inference(avatar_contradiction_clause,[],[f193]) ).
fof(f193,plain,
( $false
| spl0_2
| ~ spl0_3
| ~ spl0_5 ),
inference(subsumption_resolution,[],[f192,f188]) ).
fof(f188,plain,
( organization(sk6,sk14)
| ~ spl0_5 ),
inference(unit_resulting_resolution,[],[f18,f20,f58,f88,f6]) ).
fof(f6,axiom,
! [X2,X3,X0,X1] :
( organization(X0,X3)
| ~ greater(X2,X3)
| ~ greater(X3,X1)
| ~ organization(X0,X2)
| ~ organization(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp13_31) ).
fof(f88,plain,
( greater(sk17,sk14)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f87]) ).
fof(f87,plain,
( spl0_5
<=> greater(sk17,sk14) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
fof(f58,plain,
greater(sk14,sk15),
inference(unit_resulting_resolution,[],[f39,f7]) ).
fof(f7,axiom,
! [X2,X0,X1] :
( ~ reorganization(X0,X1,X2)
| greater(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp7_32) ).
fof(f39,plain,
reorganization(sk5,sk15,sk14),
inference(definition_unfolding,[],[f25,f36]) ).
fof(f36,axiom,
sk16 = sk14,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_61) ).
fof(f25,axiom,
reorganization(sk5,sk15,sk16),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_50) ).
fof(f20,axiom,
organization(sk6,sk17),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_45) ).
fof(f18,axiom,
organization(sk6,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_43) ).
fof(f192,plain,
( ~ organization(sk6,sk14)
| spl0_2
| ~ spl0_3 ),
inference(unit_resulting_resolution,[],[f17,f18,f81,f21,f22,f23,f24,f34,f32,f26,f27,f28,f33,f39,f30,f31,f48,f38,f11]) ).
fof(f11,axiom,
! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
( X8 = X9
| greater(X8,X9)
| ~ greater(X11,X10)
| ~ complexity(X2,X11,X1)
| ~ complexity(X0,X10,X1)
| ~ survival_chance(X2,X9,X3)
| ~ survival_chance(X0,X8,X3)
| ~ reorganization_type(X2,X7,X1)
| ~ reorganization_type(X0,X7,X1)
| ~ reorganization(X2,X1,X6)
| ~ reorganization(X0,X1,X3)
| ~ survival_chance(X2,X5,X1)
| ~ survival_chance(X0,X5,X1)
| ~ class(X2,X4,X1)
| ~ class(X0,X4,X1)
| ~ organization(X2,X3)
| ~ organization(X0,X3)
| ~ organization(X2,X1)
| ~ organization(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a11_FOL_36) ).
fof(f38,axiom,
sk10 != sk11,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_63) ).
fof(f48,plain,
( ~ greater(sk10,sk11)
| spl0_2 ),
inference(avatar_component_clause,[],[f47]) ).
fof(f47,plain,
( spl0_2
<=> greater(sk10,sk11) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f31,axiom,
survival_chance(sk6,sk11,sk14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_56) ).
fof(f30,axiom,
survival_chance(sk5,sk10,sk14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_55) ).
fof(f33,axiom,
complexity(sk6,sk13,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_58) ).
fof(f28,axiom,
reorganization_type(sk6,sk7,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_53) ).
fof(f27,axiom,
reorganization_type(sk5,sk7,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_52) ).
fof(f26,axiom,
reorganization(sk6,sk15,sk17),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_51) ).
fof(f32,axiom,
complexity(sk5,sk12,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_57) ).
fof(f34,axiom,
greater(sk13,sk12),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_59) ).
fof(f24,axiom,
survival_chance(sk6,sk9,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_49) ).
fof(f23,axiom,
survival_chance(sk5,sk9,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_48) ).
fof(f22,axiom,
class(sk6,sk8,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_47) ).
fof(f21,axiom,
class(sk5,sk8,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_46) ).
fof(f81,plain,
( organization(sk5,sk14)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f80,plain,
( spl0_3
<=> organization(sk5,sk14) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
fof(f17,axiom,
organization(sk5,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_42) ).
fof(f180,plain,
spl0_5,
inference(avatar_split_clause,[],[f140,f87]) ).
fof(f140,plain,
greater(sk17,sk14),
inference(unit_resulting_resolution,[],[f17,f18,f20,f21,f22,f39,f26,f34,f32,f27,f28,f33,f10]) ).
fof(f10,axiom,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ complexity(X2,X8,X1)
| ~ greater(X8,X7)
| greater(X3,X5)
| ~ complexity(X0,X7,X1)
| ~ reorganization_type(X2,X6,X1)
| ~ reorganization_type(X0,X6,X1)
| ~ reorganization(X2,X1,X3)
| ~ reorganization(X0,X1,X5)
| ~ class(X2,X4,X1)
| ~ class(X0,X4,X1)
| ~ organization(X2,X3)
| ~ organization(X2,X1)
| ~ organization(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a10_FOL_35) ).
fof(f94,plain,
( ~ spl0_5
| spl0_3 ),
inference(avatar_split_clause,[],[f92,f80,f87]) ).
fof(f92,plain,
( ~ greater(sk17,sk14)
| spl0_3 ),
inference(unit_resulting_resolution,[],[f19,f17,f58,f82,f6]) ).
fof(f82,plain,
( ~ organization(sk5,sk14)
| spl0_3 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f19,axiom,
organization(sk5,sk17),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_44) ).
fof(f51,plain,
~ spl0_2,
inference(avatar_split_clause,[],[f37,f47]) ).
fof(f37,axiom,
~ greater(sk10,sk11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_62) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : MGT005-2 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.12 % 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.11/0.32 % Computer : n002.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 00:06:07 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.11/0.33 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.50/0.70 % (10748)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.50/0.70 % (10750)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.50/0.70 % (10753)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.50/0.70 % (10751)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.50/0.70 % (10752)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.55/0.71 % (10750)Instruction limit reached!
% 0.55/0.71 % (10750)------------------------------
% 0.55/0.71 % (10750)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.71 % (10750)Termination reason: Unknown
% 0.55/0.71 % (10750)Termination phase: Saturation
% 0.55/0.71
% 0.55/0.71 % (10750)Memory used [KB]: 1324
% 0.55/0.71 % (10750)Time elapsed: 0.011 s
% 0.55/0.71 % (10750)Instructions burned: 35 (million)
% 0.55/0.71 % (10750)------------------------------
% 0.55/0.71 % (10750)------------------------------
% 0.55/0.71 % (10746)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.55/0.71 % (10747)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.55/0.72 % (10749)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.55/0.72 % (10746)Instruction limit reached!
% 0.55/0.72 % (10746)------------------------------
% 0.55/0.72 % (10746)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.72 % (10746)Termination reason: Unknown
% 0.55/0.72 % (10746)Termination phase: Saturation
% 0.55/0.72
% 0.55/0.72 % (10746)Memory used [KB]: 1350
% 0.55/0.72 % (10746)Time elapsed: 0.013 s
% 0.55/0.72 % (10746)Instructions burned: 36 (million)
% 0.55/0.72 % (10746)------------------------------
% 0.55/0.72 % (10746)------------------------------
% 0.55/0.73 % (10751)Instruction limit reached!
% 0.55/0.73 % (10751)------------------------------
% 0.55/0.73 % (10751)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (10751)Termination reason: Unknown
% 0.55/0.73 % (10751)Termination phase: Saturation
% 0.55/0.73
% 0.55/0.73 % (10751)Memory used [KB]: 1294
% 0.55/0.73 % (10751)Time elapsed: 0.013 s
% 0.55/0.73 % (10751)Instructions burned: 45 (million)
% 0.55/0.73 % (10751)------------------------------
% 0.55/0.73 % (10751)------------------------------
% 0.55/0.73 % (10749)First to succeed.
% 0.55/0.73 % (10749)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-10745"
% 0.55/0.73 % (10749)Refutation found. Thanks to Tanya!
% 0.55/0.73 % SZS status Unsatisfiable for theBenchmark
% 0.55/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.73 % (10749)------------------------------
% 0.55/0.73 % (10749)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (10749)Termination reason: Refutation
% 0.55/0.73
% 0.55/0.73 % (10749)Memory used [KB]: 1139
% 0.55/0.73 % (10749)Time elapsed: 0.012 s
% 0.55/0.73 % (10749)Instructions burned: 17 (million)
% 0.55/0.73 % (10745)Success in time 0.395 s
% 0.55/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------