TSTP Solution File: MGT016-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : MGT016-1 : 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n012.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:06 EDT 2024
% Result : Unsatisfiable 0.50s 0.72s
% Output : Refutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 18
% Syntax : Number of formulae : 50 ( 16 unt; 0 def)
% Number of atoms : 213 ( 0 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 353 ( 190 ~; 161 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 3 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 97 ( 97 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f54,plain,
$false,
inference(avatar_sat_refutation,[],[f32,f50,f53]) ).
fof(f53,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f52]) ).
fof(f52,plain,
( $false
| ~ spl0_1 ),
inference(subsumption_resolution,[],[f51,f7]) ).
fof(f7,axiom,
class(sk2,sk5,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_7) ).
fof(f51,plain,
( ~ class(sk2,sk5,sk8)
| ~ spl0_1 ),
inference(resolution,[],[f28,f8]) ).
fof(f8,axiom,
class(sk3,sk5,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_8) ).
fof(f28,plain,
( ! [X2] :
( ~ class(sk3,X2,sk8)
| ~ class(sk2,X2,sk8) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f27]) ).
fof(f27,plain,
( spl0_1
<=> ! [X2] :
( ~ class(sk3,X2,sk8)
| ~ class(sk2,X2,sk8) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f50,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f49]) ).
fof(f49,plain,
( $false
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f48,f15]) ).
fof(f15,axiom,
greater(sk7,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_15) ).
fof(f48,plain,
( ~ greater(sk7,sk6)
| ~ spl0_2 ),
inference(resolution,[],[f47,f14]) ).
fof(f14,axiom,
complexity(sk3,sk7,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_14) ).
fof(f47,plain,
( ! [X0] :
( ~ complexity(sk3,X0,sk8)
| ~ greater(X0,sk6) )
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f46,f5]) ).
fof(f5,axiom,
organization(sk3,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_5) ).
fof(f46,plain,
( ! [X0] :
( ~ complexity(sk3,X0,sk8)
| ~ greater(X0,sk6)
| ~ organization(sk3,sk8) )
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f45,f8]) ).
fof(f45,plain,
( ! [X0] :
( ~ complexity(sk3,X0,sk8)
| ~ class(sk3,sk5,sk8)
| ~ greater(X0,sk6)
| ~ organization(sk3,sk8) )
| ~ spl0_2 ),
inference(duplicate_literal_removal,[],[f44]) ).
fof(f44,plain,
( ! [X0] :
( ~ complexity(sk3,X0,sk8)
| ~ class(sk3,sk5,sk8)
| ~ greater(X0,sk6)
| ~ organization(sk3,sk8)
| ~ organization(sk3,sk8) )
| ~ spl0_2 ),
inference(resolution,[],[f43,f1]) ).
fof(f1,axiom,
! [X0,X1] :
( inertia(X0,sk1(X1,X0),X1)
| ~ organization(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5_1) ).
fof(f43,plain,
( ! [X2,X0,X1] :
( ~ inertia(X0,sk1(sk8,sk3),X2)
| ~ complexity(X0,X1,X2)
| ~ class(X0,sk5,X2)
| ~ greater(X1,sk6)
| ~ organization(X0,X2) )
| ~ spl0_2 ),
inference(resolution,[],[f42,f7]) ).
fof(f42,plain,
( ! [X2,X3,X0,X1] :
( ~ class(sk2,X3,sk8)
| ~ complexity(X1,X0,X2)
| ~ inertia(X1,sk1(sk8,sk3),X2)
| ~ class(X1,X3,X2)
| ~ greater(X0,sk6)
| ~ organization(X1,X2) )
| ~ spl0_2 ),
inference(resolution,[],[f41,f13]) ).
fof(f13,axiom,
complexity(sk2,sk6,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_13) ).
fof(f41,plain,
( ! [X2,X3,X0,X1,X4] :
( ~ complexity(sk2,X3,sk8)
| ~ greater(X2,X3)
| ~ complexity(X0,X2,X1)
| ~ inertia(X0,sk1(sk8,sk3),X1)
| ~ class(X0,X4,X1)
| ~ class(sk2,X4,sk8)
| ~ organization(X0,X1) )
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f40,f4]) ).
fof(f4,axiom,
organization(sk2,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_4) ).
fof(f40,plain,
( ! [X2,X3,X0,X1,X4] :
( ~ inertia(X0,sk1(sk8,sk3),X1)
| ~ greater(X2,X3)
| ~ complexity(X0,X2,X1)
| ~ complexity(sk2,X3,sk8)
| ~ class(X0,X4,X1)
| ~ class(sk2,X4,sk8)
| ~ organization(X0,X1)
| ~ organization(sk2,sk8) )
| ~ spl0_2 ),
inference(duplicate_literal_removal,[],[f39]) ).
fof(f39,plain,
( ! [X2,X3,X0,X1,X4] :
( ~ inertia(X0,sk1(sk8,sk3),X1)
| ~ greater(X2,X3)
| ~ complexity(X0,X2,X1)
| ~ complexity(sk2,X3,sk8)
| ~ class(X0,X4,X1)
| ~ class(sk2,X4,sk8)
| ~ organization(X0,X1)
| ~ organization(sk2,sk8)
| ~ organization(sk2,sk8) )
| ~ spl0_2 ),
inference(resolution,[],[f38,f1]) ).
fof(f38,plain,
( ! [X2,X3,X0,X1,X6,X4,X5] :
( ~ inertia(X4,sk1(sk8,sk2),X5)
| ~ inertia(X2,sk1(sk8,sk3),X3)
| ~ greater(X0,X1)
| ~ complexity(X2,X0,X3)
| ~ complexity(X4,X1,X5)
| ~ class(X2,X6,X3)
| ~ class(X4,X6,X5)
| ~ organization(X2,X3)
| ~ organization(X4,X5) )
| ~ spl0_2 ),
inference(resolution,[],[f36,f2]) ).
fof(f2,axiom,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( greater(X8,X7)
| ~ greater(X6,X5)
| ~ inertia(X2,X8,X3)
| ~ inertia(X0,X7,X1)
| ~ complexity(X2,X6,X3)
| ~ complexity(X0,X5,X1)
| ~ class(X2,X4,X3)
| ~ class(X0,X4,X1)
| ~ organization(X2,X3)
| ~ organization(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a12_FOL_2) ).
fof(f36,plain,
( ~ greater(sk1(sk8,sk3),sk1(sk8,sk2))
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f35,f4]) ).
fof(f35,plain,
( ~ greater(sk1(sk8,sk3),sk1(sk8,sk2))
| ~ organization(sk2,sk8)
| ~ spl0_2 ),
inference(resolution,[],[f34,f1]) ).
fof(f34,plain,
( ! [X0] :
( ~ inertia(sk2,X0,sk8)
| ~ greater(sk1(sk8,sk3),X0) )
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f33,f5]) ).
fof(f33,plain,
( ! [X0] :
( ~ greater(sk1(sk8,sk3),X0)
| ~ inertia(sk2,X0,sk8)
| ~ organization(sk3,sk8) )
| ~ spl0_2 ),
inference(resolution,[],[f31,f1]) ).
fof(f31,plain,
( ! [X0,X1] :
( ~ inertia(sk3,X0,sk8)
| ~ greater(X0,X1)
| ~ inertia(sk2,X1,sk8) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f30]) ).
fof(f30,plain,
( spl0_2
<=> ! [X0,X1] :
( ~ inertia(sk3,X0,sk8)
| ~ greater(X0,X1)
| ~ inertia(sk2,X1,sk8) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f32,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f25,f30,f27]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ inertia(sk3,X0,sk8)
| ~ inertia(sk2,X1,sk8)
| ~ class(sk3,X2,sk8)
| ~ class(sk2,X2,sk8)
| ~ greater(X0,X1) ),
inference(subsumption_resolution,[],[f24,f4]) ).
fof(f24,plain,
! [X2,X0,X1] :
( ~ inertia(sk3,X0,sk8)
| ~ inertia(sk2,X1,sk8)
| ~ class(sk3,X2,sk8)
| ~ class(sk2,X2,sk8)
| ~ greater(X0,X1)
| ~ organization(sk2,sk8) ),
inference(subsumption_resolution,[],[f23,f11]) ).
fof(f11,axiom,
reorganization_type(sk2,sk4,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_11) ).
fof(f23,plain,
! [X2,X0,X1] :
( ~ reorganization_type(sk2,sk4,sk8)
| ~ inertia(sk3,X0,sk8)
| ~ inertia(sk2,X1,sk8)
| ~ class(sk3,X2,sk8)
| ~ class(sk2,X2,sk8)
| ~ greater(X0,X1)
| ~ organization(sk2,sk8) ),
inference(resolution,[],[f22,f9]) ).
fof(f9,axiom,
reorganization(sk2,sk8,sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_9) ).
fof(f22,plain,
! [X2,X3,X0,X1] :
( ~ reorganization(X0,sk8,sk9)
| ~ reorganization_type(X0,sk4,sk8)
| ~ inertia(sk3,X2,sk8)
| ~ inertia(X0,X1,sk8)
| ~ class(sk3,X3,sk8)
| ~ class(X0,X3,sk8)
| ~ greater(X2,X1)
| ~ organization(X0,sk8) ),
inference(resolution,[],[f21,f12]) ).
fof(f12,axiom,
reorganization_type(sk3,sk4,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_12) ).
fof(f21,plain,
! [X2,X3,X0,X1,X4] :
( ~ reorganization_type(sk3,X2,sk8)
| ~ inertia(X0,X1,sk8)
| ~ reorganization_type(X0,X2,sk8)
| ~ inertia(sk3,X3,sk8)
| ~ reorganization(X0,sk8,sk9)
| ~ class(sk3,X4,sk8)
| ~ class(X0,X4,sk8)
| ~ greater(X3,X1)
| ~ organization(X0,sk8) ),
inference(subsumption_resolution,[],[f20,f5]) ).
fof(f20,plain,
! [X2,X3,X0,X1,X4] :
( ~ inertia(X0,X1,sk8)
| ~ reorganization_type(sk3,X2,sk8)
| ~ reorganization_type(X0,X2,sk8)
| ~ inertia(sk3,X3,sk8)
| ~ reorganization(X0,sk8,sk9)
| ~ class(sk3,X4,sk8)
| ~ class(X0,X4,sk8)
| ~ greater(X3,X1)
| ~ organization(sk3,sk8)
| ~ organization(X0,sk8) ),
inference(resolution,[],[f19,f10]) ).
fof(f10,axiom,
reorganization(sk3,sk8,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_10) ).
fof(f19,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ reorganization(sk3,X1,sk10)
| ~ inertia(X2,X3,X1)
| ~ reorganization_type(sk3,X4,X1)
| ~ reorganization_type(X2,X4,X1)
| ~ inertia(sk3,X0,X1)
| ~ reorganization(X2,X1,sk9)
| ~ class(sk3,X5,X1)
| ~ class(X2,X5,X1)
| ~ greater(X0,X3)
| ~ organization(sk3,X1)
| ~ organization(X2,X1) ),
inference(resolution,[],[f18,f6]) ).
fof(f6,axiom,
~ organization(sk3,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_6) ).
fof(f18,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( organization(X2,sk10)
| ~ inertia(X2,X0,X3)
| ~ inertia(X4,X1,X3)
| ~ reorganization_type(X2,X5,X3)
| ~ reorganization_type(X4,X5,X3)
| ~ reorganization(X2,X3,sk10)
| ~ reorganization(X4,X3,sk9)
| ~ class(X2,X6,X3)
| ~ class(X4,X6,X3)
| ~ greater(X0,X1)
| ~ organization(X2,X3)
| ~ organization(X4,X3) ),
inference(resolution,[],[f3,f16]) ).
fof(f16,axiom,
~ greater(sk9,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_16) ).
fof(f3,axiom,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( greater(X5,X3)
| ~ greater(X8,X7)
| ~ inertia(X2,X8,X1)
| ~ inertia(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/sandbox2/benchmark/theBenchmark.p',a14_FOL_3) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT016-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/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 : n012.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 23:56:37 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a CNF_UNS_RFO_NEQ_NHN 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.50/0.72 % (1531)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.50/0.72 % (1531)Refutation not found, incomplete strategy% (1531)------------------------------
% 0.50/0.72 % (1531)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.72 % (1531)Termination reason: Refutation not found, incomplete strategy
% 0.50/0.72
% 0.50/0.72 % (1531)Memory used [KB]: 950
% 0.50/0.72 % (1531)Time elapsed: 0.001 s
% 0.50/0.72 % (1531)Instructions burned: 2 (million)
% 0.50/0.72 % (1532)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.72 % (1531)------------------------------
% 0.50/0.72 % (1531)------------------------------
% 0.50/0.72 % (1527)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.72 % (1528)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.50/0.72 % (1532)Refutation not found, incomplete strategy% (1532)------------------------------
% 0.50/0.72 % (1532)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.72 % (1532)Termination reason: Refutation not found, incomplete strategy
% 0.50/0.72
% 0.50/0.72 % (1532)Memory used [KB]: 950
% 0.50/0.72 % (1532)Time elapsed: 0.002 s
% 0.50/0.72 % (1532)Instructions burned: 2 (million)
% 0.50/0.72 % (1526)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.50/0.72 % (1532)------------------------------
% 0.50/0.72 % (1532)------------------------------
% 0.50/0.72 % (1528)Refutation not found, incomplete strategy% (1528)------------------------------
% 0.50/0.72 % (1528)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.72 % (1528)Termination reason: Refutation not found, incomplete strategy
% 0.50/0.72
% 0.50/0.72 % (1528)Memory used [KB]: 950
% 0.50/0.72 % (1528)Time elapsed: 0.003 s
% 0.50/0.72 % (1528)Instructions burned: 2 (million)
% 0.50/0.72 % (1529)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.72 % (1528)------------------------------
% 0.50/0.72 % (1528)------------------------------
% 0.50/0.72 % (1525)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.50/0.72 % (1530)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.72 % (1527)First to succeed.
% 0.50/0.72 % (1530)Refutation not found, incomplete strategy% (1530)------------------------------
% 0.50/0.72 % (1530)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.72 % (1530)Termination reason: Refutation not found, incomplete strategy
% 0.50/0.72
% 0.50/0.72 % (1530)Memory used [KB]: 950
% 0.50/0.72 % (1530)Time elapsed: 0.004 s
% 0.50/0.72 % (1530)Instructions burned: 2 (million)
% 0.50/0.72 % (1530)------------------------------
% 0.50/0.72 % (1530)------------------------------
% 0.50/0.72 % (1527)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1524"
% 0.50/0.72 % (1534)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.50/0.72 % (1525)Also succeeded, but the first one will report.
% 0.50/0.72 % (1526)Also succeeded, but the first one will report.
% 0.50/0.72 % (1529)Also succeeded, but the first one will report.
% 0.50/0.72 % (1527)Refutation found. Thanks to Tanya!
% 0.50/0.72 % SZS status Unsatisfiable for theBenchmark
% 0.50/0.72 % SZS output start Proof for theBenchmark
% See solution above
% 0.50/0.73 % (1527)------------------------------
% 0.50/0.73 % (1527)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.73 % (1527)Termination reason: Refutation
% 0.50/0.73
% 0.50/0.73 % (1527)Memory used [KB]: 1068
% 0.50/0.73 % (1527)Time elapsed: 0.006 s
% 0.50/0.73 % (1527)Instructions burned: 6 (million)
% 0.50/0.73 % (1524)Success in time 0.369 s
% 0.50/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------