TSTP Solution File: MGT006+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : MGT006+1 : TPTP v8.1.2. Released v2.0.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 : n017.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 : Wed May 1 03:21:45 EDT 2024
% Result : Theorem 0.60s 0.81s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 49 ( 15 unt; 0 def)
% Number of atoms : 250 ( 0 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 297 ( 96 ~; 89 |; 96 &)
% ( 6 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 3 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 160 ( 136 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f85,plain,
$false,
inference(avatar_sat_refutation,[],[f44,f52,f84]) ).
fof(f84,plain,
spl8_2,
inference(avatar_contradiction_clause,[],[f83]) ).
fof(f83,plain,
( $false
| spl8_2 ),
inference(subsumption_resolution,[],[f56,f43]) ).
fof(f43,plain,
( ~ greater(sK4,sK3)
| spl8_2 ),
inference(avatar_component_clause,[],[f41]) ).
fof(f41,plain,
( spl8_2
<=> greater(sK4,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_2])]) ).
fof(f56,plain,
greater(sK4,sK3),
inference(unit_resulting_resolution,[],[f26,f27,f29,f30,f31,f32,f45,f46,f48,f23]) ).
fof(f23,plain,
! [X2,X3,X0,X1,X8,X6,X9,X7,X4,X5] :
( greater(X7,X6)
| ~ greater(X9,X8)
| ~ reproducibility(X1,X9,X3)
| ~ reproducibility(X0,X8,X2)
| ~ accountability(X1,X7,X3)
| ~ accountability(X0,X6,X2)
| ~ reliability(X1,X5,X3)
| ~ reliability(X0,X4,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
( ( ( greater(X9,X8)
| ~ greater(X7,X6)
| ~ greater(X5,X4) )
& ( ( greater(X7,X6)
& greater(X5,X4) )
| ~ greater(X9,X8) ) )
| ~ reproducibility(X1,X9,X3)
| ~ reproducibility(X0,X8,X2)
| ~ accountability(X1,X7,X3)
| ~ accountability(X0,X6,X2)
| ~ reliability(X1,X5,X3)
| ~ reliability(X0,X4,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2) ),
inference(flattening,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
( ( ( greater(X9,X8)
| ~ greater(X7,X6)
| ~ greater(X5,X4) )
& ( ( greater(X7,X6)
& greater(X5,X4) )
| ~ greater(X9,X8) ) )
| ~ reproducibility(X1,X9,X3)
| ~ reproducibility(X0,X8,X2)
| ~ accountability(X1,X7,X3)
| ~ accountability(X0,X6,X2)
| ~ reliability(X1,X5,X3)
| ~ reliability(X0,X4,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
( ( greater(X9,X8)
<=> ( greater(X7,X6)
& greater(X5,X4) ) )
| ~ reproducibility(X1,X9,X3)
| ~ reproducibility(X0,X8,X2)
| ~ accountability(X1,X7,X3)
| ~ accountability(X0,X6,X2)
| ~ reliability(X1,X5,X3)
| ~ reliability(X0,X4,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2) ),
inference(flattening,[],[f9]) ).
fof(f9,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
( ( greater(X9,X8)
<=> ( greater(X7,X6)
& greater(X5,X4) ) )
| ~ reproducibility(X1,X9,X3)
| ~ reproducibility(X0,X8,X2)
| ~ accountability(X1,X7,X3)
| ~ accountability(X0,X6,X2)
| ~ reliability(X1,X5,X3)
| ~ reliability(X0,X4,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
( ( reproducibility(X1,X9,X3)
& reproducibility(X0,X8,X2)
& accountability(X1,X7,X3)
& accountability(X0,X6,X2)
& reliability(X1,X5,X3)
& reliability(X0,X4,X2)
& organization(X1,X3)
& organization(X0,X2) )
=> ( greater(X9,X8)
<=> ( greater(X7,X6)
& greater(X5,X4) ) ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X0,X3,X4,X5,X6,X7,X8,X9,X10,X11] :
( ( reproducibility(X3,X11,X5)
& reproducibility(X0,X10,X4)
& accountability(X3,X9,X5)
& accountability(X0,X8,X4)
& reliability(X3,X7,X5)
& reliability(X0,X6,X4)
& organization(X3,X5)
& organization(X0,X4) )
=> ( greater(X11,X10)
<=> ( greater(X9,X8)
& greater(X7,X6) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fTIgyCdL6k/Vampire---4.8_29861',a2_FOL) ).
fof(f48,plain,
greater(sK7(sK0,sK6),sK7(sK0,sK5)),
inference(unit_resulting_resolution,[],[f26,f27,f33,f45,f28,f46,f25]) ).
fof(f25,plain,
! [X2,X3,X0,X1,X4] :
( greater(X2,X1)
| ~ greater(X4,X3)
| ~ reproducibility(X0,X2,X4)
| ~ reproducibility(X0,X1,X3)
| ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3) ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1,X2,X3,X4] :
( greater(X2,X1)
| ~ greater(X4,X3)
| ~ reproducibility(X0,X2,X4)
| ~ reproducibility(X0,X1,X3)
| ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3) ),
inference(flattening,[],[f11]) ).
fof(f11,plain,
! [X0,X1,X2,X3,X4] :
( greater(X2,X1)
| ~ greater(X4,X3)
| ~ reproducibility(X0,X2,X4)
| ~ reproducibility(X0,X1,X3)
| ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
! [X0,X1,X2,X3,X4] :
( ( greater(X4,X3)
& reproducibility(X0,X2,X4)
& reproducibility(X0,X1,X3)
& reorganization_free(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3) )
=> greater(X2,X1) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X0,X10,X11,X4,X5] :
( ( greater(X5,X4)
& reproducibility(X0,X11,X5)
& reproducibility(X0,X10,X4)
& reorganization_free(X0,X4,X5)
& organization(X0,X5)
& organization(X0,X4) )
=> greater(X11,X10) ),
file('/export/starexec/sandbox/tmp/tmp.fTIgyCdL6k/Vampire---4.8_29861',a4_FOL) ).
fof(f28,plain,
reorganization_free(sK0,sK5,sK6),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
( ( ~ greater(sK4,sK3)
| ~ greater(sK2,sK1) )
& greater(sK6,sK5)
& accountability(sK0,sK4,sK6)
& accountability(sK0,sK3,sK5)
& reliability(sK0,sK2,sK6)
& reliability(sK0,sK1,sK5)
& reorganization_free(sK0,sK5,sK6)
& organization(sK0,sK6)
& organization(sK0,sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6])],[f14,f18]) ).
fof(f18,plain,
( ? [X0,X1,X2,X3,X4,X5,X6] :
( ( ~ greater(X4,X3)
| ~ greater(X2,X1) )
& greater(X6,X5)
& accountability(X0,X4,X6)
& accountability(X0,X3,X5)
& reliability(X0,X2,X6)
& reliability(X0,X1,X5)
& reorganization_free(X0,X5,X6)
& organization(X0,X6)
& organization(X0,X5) )
=> ( ( ~ greater(sK4,sK3)
| ~ greater(sK2,sK1) )
& greater(sK6,sK5)
& accountability(sK0,sK4,sK6)
& accountability(sK0,sK3,sK5)
& reliability(sK0,sK2,sK6)
& reliability(sK0,sK1,sK5)
& reorganization_free(sK0,sK5,sK6)
& organization(sK0,sK6)
& organization(sK0,sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
? [X0,X1,X2,X3,X4,X5,X6] :
( ( ~ greater(X4,X3)
| ~ greater(X2,X1) )
& greater(X6,X5)
& accountability(X0,X4,X6)
& accountability(X0,X3,X5)
& reliability(X0,X2,X6)
& reliability(X0,X1,X5)
& reorganization_free(X0,X5,X6)
& organization(X0,X6)
& organization(X0,X5) ),
inference(flattening,[],[f13]) ).
fof(f13,plain,
? [X0,X1,X2,X3,X4,X5,X6] :
( ( ~ greater(X4,X3)
| ~ greater(X2,X1) )
& greater(X6,X5)
& accountability(X0,X4,X6)
& accountability(X0,X3,X5)
& reliability(X0,X2,X6)
& reliability(X0,X1,X5)
& reorganization_free(X0,X5,X6)
& organization(X0,X6)
& organization(X0,X5) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
~ ! [X0,X1,X2,X3,X4,X5,X6] :
( ( greater(X6,X5)
& accountability(X0,X4,X6)
& accountability(X0,X3,X5)
& reliability(X0,X2,X6)
& reliability(X0,X1,X5)
& reorganization_free(X0,X5,X6)
& organization(X0,X6)
& organization(X0,X5) )
=> ( greater(X4,X3)
& greater(X2,X1) ) ),
inference(rectify,[],[f5]) ).
fof(f5,negated_conjecture,
~ ! [X0,X6,X7,X8,X9,X4,X5] :
( ( greater(X5,X4)
& accountability(X0,X9,X5)
& accountability(X0,X8,X4)
& reliability(X0,X7,X5)
& reliability(X0,X6,X4)
& reorganization_free(X0,X4,X5)
& organization(X0,X5)
& organization(X0,X4) )
=> ( greater(X9,X8)
& greater(X7,X6) ) ),
inference(negated_conjecture,[],[f4]) ).
fof(f4,conjecture,
! [X0,X6,X7,X8,X9,X4,X5] :
( ( greater(X5,X4)
& accountability(X0,X9,X5)
& accountability(X0,X8,X4)
& reliability(X0,X7,X5)
& reliability(X0,X6,X4)
& reorganization_free(X0,X4,X5)
& organization(X0,X5)
& organization(X0,X4) )
=> ( greater(X9,X8)
& greater(X7,X6) ) ),
file('/export/starexec/sandbox/tmp/tmp.fTIgyCdL6k/Vampire---4.8_29861',t6_FOL) ).
fof(f33,plain,
greater(sK6,sK5),
inference(cnf_transformation,[],[f19]) ).
fof(f46,plain,
reproducibility(sK0,sK7(sK0,sK6),sK6),
inference(unit_resulting_resolution,[],[f27,f35]) ).
fof(f35,plain,
! [X0,X1] :
( reproducibility(X0,sK7(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( reproducibility(X0,sK7(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f15,f20]) ).
fof(f20,plain,
! [X0,X1] :
( ? [X2] : reproducibility(X0,X2,X1)
=> reproducibility(X0,sK7(X0,X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0,X1] :
( ? [X2] : reproducibility(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : reproducibility(X0,X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.fTIgyCdL6k/Vampire---4.8_29861',mp3) ).
fof(f45,plain,
reproducibility(sK0,sK7(sK0,sK5),sK5),
inference(unit_resulting_resolution,[],[f26,f35]) ).
fof(f32,plain,
accountability(sK0,sK4,sK6),
inference(cnf_transformation,[],[f19]) ).
fof(f31,plain,
accountability(sK0,sK3,sK5),
inference(cnf_transformation,[],[f19]) ).
fof(f30,plain,
reliability(sK0,sK2,sK6),
inference(cnf_transformation,[],[f19]) ).
fof(f29,plain,
reliability(sK0,sK1,sK5),
inference(cnf_transformation,[],[f19]) ).
fof(f27,plain,
organization(sK0,sK6),
inference(cnf_transformation,[],[f19]) ).
fof(f26,plain,
organization(sK0,sK5),
inference(cnf_transformation,[],[f19]) ).
fof(f52,plain,
spl8_1,
inference(avatar_contradiction_clause,[],[f51]) ).
fof(f51,plain,
( $false
| spl8_1 ),
inference(subsumption_resolution,[],[f49,f48]) ).
fof(f49,plain,
( ~ greater(sK7(sK0,sK6),sK7(sK0,sK5))
| spl8_1 ),
inference(unit_resulting_resolution,[],[f26,f31,f45,f29,f27,f32,f46,f30,f39,f22]) ).
fof(f22,plain,
! [X2,X3,X0,X1,X8,X6,X9,X7,X4,X5] :
( greater(X5,X4)
| ~ greater(X9,X8)
| ~ reproducibility(X1,X9,X3)
| ~ reproducibility(X0,X8,X2)
| ~ accountability(X1,X7,X3)
| ~ accountability(X0,X6,X2)
| ~ reliability(X1,X5,X3)
| ~ reliability(X0,X4,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f39,plain,
( ~ greater(sK2,sK1)
| spl8_1 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f37,plain,
( spl8_1
<=> greater(sK2,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).
fof(f44,plain,
( ~ spl8_1
| ~ spl8_2 ),
inference(avatar_split_clause,[],[f34,f41,f37]) ).
fof(f34,plain,
( ~ greater(sK4,sK3)
| ~ greater(sK2,sK1) ),
inference(cnf_transformation,[],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : MGT006+1 : TPTP v8.1.2. Released v2.0.0.
% 0.09/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 : n017.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 : Tue Apr 30 17:40:49 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a FOF_THM_RFO_NEQ problem
% 0.11/0.32 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/tmp/tmp.fTIgyCdL6k/Vampire---4.8_29861
% 0.60/0.81 % (29979)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.60/0.81 % (29978)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 Vampire---4 for (2995ds/34Mi)
% 0.60/0.81 % (29976)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.60/0.81 % (29977)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.60/0.81 % (29974)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 Vampire---4 for (2995ds/34Mi)
% 0.60/0.81 % (29980)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 Vampire---4 for (2995ds/83Mi)
% 0.60/0.81 % (29975)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 Vampire---4 for (2995ds/51Mi)
% 0.60/0.81 % (29981)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.60/0.81 % (29977)First to succeed.
% 0.60/0.81 % (29976)Also succeeded, but the first one will report.
% 0.60/0.81 % (29977)Refutation found. Thanks to Tanya!
% 0.60/0.81 % SZS status Theorem for Vampire---4
% 0.60/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.81 % (29977)------------------------------
% 0.60/0.81 % (29977)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.81 % (29977)Termination reason: Refutation
% 0.60/0.81
% 0.60/0.81 % (29977)Memory used [KB]: 1072
% 0.60/0.81 % (29977)Time elapsed: 0.006 s
% 0.60/0.81 % (29977)Instructions burned: 7 (million)
% 0.60/0.81 % (29977)------------------------------
% 0.60/0.81 % (29977)------------------------------
% 0.60/0.81 % (29971)Success in time 0.486 s
% 0.60/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------