TSTP Solution File: MGT044-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : MGT044-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 : n004.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:23 EDT 2024
% Result : Unsatisfiable 0.55s 0.74s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 15 ( 9 unt; 0 def)
% Number of atoms : 25 ( 3 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 25 ( 15 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f111,plain,
$false,
inference(resolution,[],[f74,f20]) ).
fof(f20,plain,
! [X1] : smaller_or_equal(X1,X1),
inference(equality_resolution,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( smaller_or_equal(X0,X1)
| X0 != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_smaller_or_equal_3) ).
fof(f74,plain,
! [X0] : ~ smaller_or_equal(internal_friction(sk1,X0),internal_friction(sk1,sk2)),
inference(superposition,[],[f38,f21]) ).
fof(f21,plain,
! [X0,X1] : internal_friction(sk1,X0) = internal_friction(sk1,X1),
inference(unit_resulting_resolution,[],[f17,f16]) ).
fof(f16,axiom,
! [X2,X0,X1] :
( ~ organization(X0)
| internal_friction(X0,X1) = internal_friction(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_9_36) ).
fof(f17,axiom,
organization(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_3_37) ).
fof(f38,plain,
~ smaller_or_equal(internal_friction(sk1,sk3),internal_friction(sk1,sk2)),
inference(subsumption_resolution,[],[f37,f17]) ).
fof(f37,plain,
( ~ smaller_or_equal(internal_friction(sk1,sk3),internal_friction(sk1,sk2))
| ~ organization(sk1) ),
inference(subsumption_resolution,[],[f34,f25]) ).
fof(f25,plain,
greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)),
inference(unit_resulting_resolution,[],[f17,f18,f15]) ).
fof(f15,axiom,
! [X2,X0,X1] :
( ~ greater(age(X0,X1),age(X0,X2))
| greater(stock_of_knowledge(X0,X1),stock_of_knowledge(X0,X2))
| ~ organization(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_7_35) ).
fof(f18,axiom,
greater(age(sk1,sk3),age(sk1,sk2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_3_38) ).
fof(f34,plain,
( ~ smaller_or_equal(internal_friction(sk1,sk3),internal_friction(sk1,sk2))
| ~ greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2))
| ~ organization(sk1) ),
inference(resolution,[],[f19,f12]) ).
fof(f12,axiom,
! [X2,X0,X1] :
( greater(capability(X0,X1),capability(X0,X2))
| ~ smaller_or_equal(internal_friction(X0,X1),internal_friction(X0,X2))
| ~ greater(stock_of_knowledge(X0,X1),stock_of_knowledge(X0,X2))
| ~ organization(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_5_32) ).
fof(f19,axiom,
~ greater(capability(sk1,sk3),capability(sk1,sk2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_3_39) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT044-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/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.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 00:06:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.13/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.55/0.74 % (22812)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.74 % (22808)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.74 % (22806)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.74 % (22809)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.74 % (22810)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.55/0.74 % (22811)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.55/0.74 % (22807)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.74 % (22812)First to succeed.
% 0.55/0.74 % (22812)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-22805"
% 0.55/0.74 % (22809)Refutation not found, incomplete strategy% (22809)------------------------------
% 0.55/0.74 % (22809)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (22809)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.74
% 0.55/0.74 % (22809)Memory used [KB]: 985
% 0.55/0.74 % (22809)Time elapsed: 0.003 s
% 0.55/0.74 % (22809)Instructions burned: 3 (million)
% 0.55/0.74 % (22812)Refutation found. Thanks to Tanya!
% 0.55/0.74 % SZS status Unsatisfiable for theBenchmark
% 0.55/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.74 % (22812)------------------------------
% 0.55/0.74 % (22812)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (22812)Termination reason: Refutation
% 0.55/0.74
% 0.55/0.74 % (22812)Memory used [KB]: 1070
% 0.55/0.74 % (22812)Time elapsed: 0.003 s
% 0.55/0.74 % (22812)Instructions burned: 6 (million)
% 0.55/0.74 % (22805)Success in time 0.373 s
% 0.55/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------