TSTP Solution File: MGT013-1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : MGT013-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n029.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 Aug 31 17:50:52 EDT 2022
% Result : Unsatisfiable 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of formulae : 44 ( 20 unt; 0 def)
% Number of atoms : 114 ( 13 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 152 ( 82 ~; 70 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 43 ( 43 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f94,plain,
$false,
inference(subsumption_resolution,[],[f93,f19]) ).
fof(f19,plain,
! [X1] : ~ greater(X1,X1),
inference(equality_resolution,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( X0 != X1
| ~ greater(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp6_1_18) ).
fof(f93,plain,
greater(sk2,sk2),
inference(backward_demodulation,[],[f16,f85]) ).
fof(f85,plain,
sk2 = sk3,
inference(resolution,[],[f74,f40]) ).
fof(f40,plain,
! [X0] :
( ~ complexity(sk1,X0,sk6)
| sk2 = X0 ),
inference(subsumption_resolution,[],[f38,f9]) ).
fof(f9,axiom,
organization(sk1,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_26) ).
fof(f38,plain,
! [X0] :
( ~ organization(sk1,sk6)
| ~ complexity(sk1,X0,sk6)
| sk2 = X0 ),
inference(resolution,[],[f20,f12]) ).
fof(f12,axiom,
complexity(sk1,sk2,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_29) ).
fof(f20,plain,
! [X2,X3,X0,X4] :
( ~ complexity(X0,X4,X2)
| ~ organization(X0,X2)
| ~ complexity(X0,X3,X2)
| X3 = X4 ),
inference(duplicate_literal_removal,[],[f18]) ).
fof(f18,plain,
! [X2,X3,X0,X4] :
( ~ organization(X0,X2)
| ~ complexity(X0,X4,X2)
| ~ complexity(X0,X3,X2)
| X3 = X4
| ~ organization(X0,X2) ),
inference(equality_resolution,[],[f6]) ).
fof(f6,axiom,
! [X2,X3,X0,X1,X4] :
( X3 = X4
| ~ complexity(X0,X4,X2)
| X1 != X2
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ complexity(X0,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp18_23) ).
fof(f74,plain,
complexity(sk1,sk3,sk6),
inference(backward_demodulation,[],[f13,f71]) ).
fof(f71,plain,
sk6 = sk7,
inference(subsumption_resolution,[],[f70,f22]) ).
fof(f22,plain,
time(sk7),
inference(resolution,[],[f3,f10]) ).
fof(f10,axiom,
organization(sk1,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_27) ).
fof(f3,axiom,
! [X0,X1] :
( ~ organization(X0,X1)
| time(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp15_20) ).
fof(f70,plain,
( ~ time(sk7)
| sk6 = sk7 ),
inference(subsumption_resolution,[],[f69,f64]) ).
fof(f64,plain,
~ greater(sk6,sk7),
inference(subsumption_resolution,[],[f63,f16]) ).
fof(f63,plain,
( ~ greater(sk6,sk7)
| ~ greater(sk3,sk2) ),
inference(subsumption_resolution,[],[f62,f25]) ).
fof(f25,plain,
reorganization_free(sk1,sk7,sk6),
inference(resolution,[],[f5,f11]) ).
fof(f11,axiom,
reorganization_free(sk1,sk6,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_28) ).
fof(f5,axiom,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp17_22) ).
fof(f62,plain,
( ~ reorganization_free(sk1,sk7,sk6)
| ~ greater(sk3,sk2)
| ~ greater(sk6,sk7) ),
inference(subsumption_resolution,[],[f61,f10]) ).
fof(f61,plain,
( ~ organization(sk1,sk7)
| ~ greater(sk3,sk2)
| ~ reorganization_free(sk1,sk7,sk6)
| ~ greater(sk6,sk7) ),
inference(resolution,[],[f53,f13]) ).
fof(f53,plain,
! [X0,X1] :
( ~ complexity(sk1,X1,X0)
| ~ organization(sk1,X0)
| ~ reorganization_free(sk1,X0,sk6)
| ~ greater(X1,sk2)
| ~ greater(sk6,X0) ),
inference(subsumption_resolution,[],[f51,f9]) ).
fof(f51,plain,
! [X0,X1] :
( ~ organization(sk1,sk6)
| ~ greater(X1,sk2)
| ~ reorganization_free(sk1,X0,sk6)
| ~ greater(sk6,X0)
| ~ complexity(sk1,X1,X0)
| ~ organization(sk1,X0) ),
inference(resolution,[],[f8,f12]) ).
fof(f8,axiom,
! [X2,X3,X0,X1,X4] :
( ~ complexity(X0,X4,X2)
| ~ organization(X0,X1)
| ~ greater(X3,X4)
| ~ greater(X2,X1)
| ~ reorganization_free(X0,X1,X2)
| ~ complexity(X0,X3,X1)
| ~ organization(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_25) ).
fof(f69,plain,
( sk6 = sk7
| greater(sk6,sk7)
| ~ time(sk7) ),
inference(subsumption_resolution,[],[f67,f21]) ).
fof(f21,plain,
time(sk6),
inference(resolution,[],[f3,f9]) ).
fof(f67,plain,
( ~ time(sk6)
| sk6 = sk7
| ~ time(sk7)
| greater(sk6,sk7) ),
inference(resolution,[],[f59,f4]) ).
fof(f4,axiom,
! [X0,X1] :
( greater(X1,X0)
| greater(X0,X1)
| X0 = X1
| ~ time(X1)
| ~ time(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp16_21) ).
fof(f59,plain,
~ greater(sk7,sk6),
inference(subsumption_resolution,[],[f58,f17]) ).
fof(f17,axiom,
greater(sk4,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_34) ).
fof(f58,plain,
( ~ greater(sk4,sk5)
| ~ greater(sk7,sk6) ),
inference(subsumption_resolution,[],[f57,f9]) ).
fof(f57,plain,
( ~ organization(sk1,sk6)
| ~ greater(sk7,sk6)
| ~ greater(sk4,sk5) ),
inference(subsumption_resolution,[],[f55,f11]) ).
fof(f55,plain,
( ~ greater(sk7,sk6)
| ~ reorganization_free(sk1,sk6,sk7)
| ~ greater(sk4,sk5)
| ~ organization(sk1,sk6) ),
inference(resolution,[],[f46,f14]) ).
fof(f14,axiom,
size(sk1,sk4,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_31) ).
fof(f46,plain,
! [X2,X3] :
( ~ size(sk1,X2,X3)
| ~ organization(sk1,X3)
| ~ greater(X2,sk5)
| ~ greater(sk7,X3)
| ~ reorganization_free(sk1,X3,sk7) ),
inference(subsumption_resolution,[],[f44,f10]) ).
fof(f44,plain,
! [X2,X3] :
( ~ organization(sk1,sk7)
| ~ organization(sk1,X3)
| ~ greater(sk7,X3)
| ~ greater(X2,sk5)
| ~ reorganization_free(sk1,X3,sk7)
| ~ size(sk1,X2,X3) ),
inference(resolution,[],[f7,f15]) ).
fof(f15,axiom,
size(sk1,sk5,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_32) ).
fof(f7,axiom,
! [X2,X3,X0,X1,X4] :
( ~ size(X0,X4,X2)
| ~ greater(X3,X4)
| ~ organization(X0,X2)
| ~ size(X0,X3,X1)
| ~ reorganization_free(X0,X1,X2)
| ~ organization(X0,X1)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_24) ).
fof(f13,axiom,
complexity(sk1,sk3,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_30) ).
fof(f16,axiom,
greater(sk3,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_33) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : MGT013-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35 % Computer : n029.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 : Tue Aug 30 03:21:42 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.53 % (31026)lrs+10_1:1_kws=precedence:lwlo=on:tgt=ground:i=99966:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99966Mi)
% 0.20/0.54 % (31053)lrs+10_1:1_av=off:sd=2:sos=on:sp=reverse_arity:ss=axioms:to=lpo:i=73:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/73Mi)
% 0.20/0.54 % (31029)lrs+10_1:1_bd=off:drc=off:lcm=reverse:nwc=5.0:sd=1:sgt=16:spb=goal_then_units:ss=axioms:to=lpo:i=43:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/43Mi)
% 0.20/0.54 % (31037)dis+4_1:1_bd=off:cond=fast:fde=unused:lcm=reverse:lma=on:nicw=on:nwc=2.0:s2a=on:s2agt=16:sac=on:sp=frequency:i=23:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/23Mi)
% 0.20/0.54 % (31027)dis+21_1:1_av=off:fd=off:lcm=predicate:sos=on:spb=goal:urr=ec_only:i=42:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/42Mi)
% 0.20/0.55 % (31045)lrs+1011_1:1_afp=100000:afr=on:amm=sco:bd=preordered:cond=fast:newcnf=on:nm=4:sos=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.55 % (31053)Refutation not found, incomplete strategy% (31053)------------------------------
% 0.20/0.55 % (31053)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (31026)First to succeed.
% 0.20/0.55 % (31053)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (31053)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.55
% 0.20/0.55 % (31053)Memory used [KB]: 1407
% 0.20/0.55 % (31053)Time elapsed: 0.115 s
% 0.20/0.55 % (31053)Instructions burned: 1 (million)
% 0.20/0.55 % (31053)------------------------------
% 0.20/0.55 % (31053)------------------------------
% 0.20/0.55 % (31030)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=34:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/34Mi)
% 0.20/0.55 % (31037)Also succeeded, but the first one will report.
% 0.20/0.55 % (31026)Refutation found. Thanks to Tanya!
% 0.20/0.55 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.55 % (31026)------------------------------
% 0.20/0.55 % (31026)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (31026)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (31026)Termination reason: Refutation
% 0.20/0.55
% 0.20/0.55 % (31026)Memory used [KB]: 5884
% 0.20/0.55 % (31026)Time elapsed: 0.120 s
% 0.20/0.55 % (31026)Instructions burned: 3 (million)
% 0.20/0.55 % (31026)------------------------------
% 0.20/0.55 % (31026)------------------------------
% 0.20/0.55 % (31025)Success in time 0.187 s
%------------------------------------------------------------------------------