TSTP Solution File: MGT013-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : MGT013-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n014.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 Apr 30 13:54:04 EDT 2024
% Result : Unsatisfiable 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% 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 : 149 ( 79 ~; 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 : 44 ( 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f89,plain,
$false,
inference(subsumption_resolution,[],[f88,f18]) ).
fof(f18,plain,
! [X1] : ~ greater(X1,X1),
inference(equality_resolution,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( X0 != X1
| ~ greater(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp6_1_18) ).
fof(f88,plain,
greater(sk2,sk2),
inference(backward_demodulation,[],[f16,f80]) ).
fof(f80,plain,
sk2 = sk3,
inference(resolution,[],[f67,f38]) ).
fof(f38,plain,
! [X0] :
( ~ complexity(sk1,X0,sk6)
| sk2 = X0 ),
inference(subsumption_resolution,[],[f36,f9]) ).
fof(f9,axiom,
organization(sk1,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_FOL_26) ).
fof(f36,plain,
! [X0] :
( sk2 = X0
| ~ organization(sk1,sk6)
| ~ complexity(sk1,X0,sk6) ),
inference(resolution,[],[f20,f12]) ).
fof(f12,axiom,
complexity(sk1,sk2,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_FOL_29) ).
fof(f20,plain,
! [X2,X3,X0,X4] :
( ~ complexity(X0,X4,X2)
| X3 = X4
| ~ organization(X0,X2)
| ~ complexity(X0,X3,X2) ),
inference(duplicate_literal_removal,[],[f19]) ).
fof(f19,plain,
! [X2,X3,X0,X4] :
( ~ organization(X0,X2)
| ~ organization(X0,X2)
| X3 = X4
| ~ complexity(X0,X4,X2)
| ~ complexity(X0,X3,X2) ),
inference(equality_resolution,[],[f6]) ).
fof(f6,axiom,
! [X2,X3,X0,X1,X4] :
( X1 != X2
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| X3 = X4
| ~ complexity(X0,X4,X2)
| ~ complexity(X0,X3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp18_23) ).
fof(f67,plain,
complexity(sk1,sk3,sk6),
inference(backward_demodulation,[],[f13,f64]) ).
fof(f64,plain,
sk6 = sk7,
inference(resolution,[],[f63,f53]) ).
fof(f53,plain,
( greater(sk6,sk7)
| sk6 = sk7 ),
inference(resolution,[],[f52,f30]) ).
fof(f30,plain,
( greater(sk7,sk6)
| greater(sk6,sk7)
| sk6 = sk7 ),
inference(resolution,[],[f27,f22]) ).
fof(f22,plain,
time(sk7),
inference(resolution,[],[f3,f10]) ).
fof(f10,axiom,
organization(sk1,sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_FOL_27) ).
fof(f3,axiom,
! [X0,X1] :
( ~ organization(X0,X1)
| time(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp15_20) ).
fof(f27,plain,
! [X0] :
( ~ time(X0)
| sk6 = X0
| greater(sk6,X0)
| greater(X0,sk6) ),
inference(resolution,[],[f4,f21]) ).
fof(f21,plain,
time(sk6),
inference(resolution,[],[f3,f9]) ).
fof(f4,axiom,
! [X0,X1] :
( ~ time(X1)
| ~ time(X0)
| X0 = X1
| greater(X1,X0)
| greater(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp16_21) ).
fof(f52,plain,
~ greater(sk7,sk6),
inference(subsumption_resolution,[],[f51,f11]) ).
fof(f11,axiom,
reorganization_free(sk1,sk6,sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_FOL_28) ).
fof(f51,plain,
( ~ greater(sk7,sk6)
| ~ reorganization_free(sk1,sk6,sk7) ),
inference(subsumption_resolution,[],[f50,f9]) ).
fof(f50,plain,
( ~ greater(sk7,sk6)
| ~ organization(sk1,sk6)
| ~ reorganization_free(sk1,sk6,sk7) ),
inference(subsumption_resolution,[],[f48,f17]) ).
fof(f17,axiom,
greater(sk4,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_FOL_34) ).
fof(f48,plain,
( ~ greater(sk4,sk5)
| ~ greater(sk7,sk6)
| ~ organization(sk1,sk6)
| ~ reorganization_free(sk1,sk6,sk7) ),
inference(resolution,[],[f45,f14]) ).
fof(f14,axiom,
size(sk1,sk4,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_FOL_31) ).
fof(f45,plain,
! [X0,X1] :
( ~ size(sk1,X1,X0)
| ~ greater(X1,sk5)
| ~ greater(sk7,X0)
| ~ organization(sk1,X0)
| ~ reorganization_free(sk1,X0,sk7) ),
inference(subsumption_resolution,[],[f43,f10]) ).
fof(f43,plain,
! [X0,X1] :
( ~ organization(sk1,X0)
| ~ greater(X1,sk5)
| ~ greater(sk7,X0)
| ~ organization(sk1,sk7)
| ~ size(sk1,X1,X0)
| ~ reorganization_free(sk1,X0,sk7) ),
inference(resolution,[],[f7,f15]) ).
fof(f15,axiom,
size(sk1,sk5,sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_FOL_32) ).
fof(f7,axiom,
! [X2,X3,X0,X1,X4] :
( ~ size(X0,X4,X2)
| ~ organization(X0,X1)
| ~ greater(X3,X4)
| ~ greater(X2,X1)
| ~ organization(X0,X2)
| ~ size(X0,X3,X1)
| ~ reorganization_free(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t11_FOL_24) ).
fof(f63,plain,
~ greater(sk6,sk7),
inference(subsumption_resolution,[],[f62,f10]) ).
fof(f62,plain,
( ~ organization(sk1,sk7)
| ~ greater(sk6,sk7) ),
inference(subsumption_resolution,[],[f61,f25]) ).
fof(f25,plain,
reorganization_free(sk1,sk7,sk6),
inference(resolution,[],[f5,f11]) ).
fof(f5,axiom,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp17_22) ).
fof(f61,plain,
( ~ reorganization_free(sk1,sk7,sk6)
| ~ organization(sk1,sk7)
| ~ greater(sk6,sk7) ),
inference(subsumption_resolution,[],[f60,f16]) ).
fof(f60,plain,
( ~ greater(sk3,sk2)
| ~ reorganization_free(sk1,sk7,sk6)
| ~ organization(sk1,sk7)
| ~ greater(sk6,sk7) ),
inference(resolution,[],[f57,f13]) ).
fof(f57,plain,
! [X0,X1] :
( ~ complexity(sk1,X1,X0)
| ~ greater(X1,sk2)
| ~ reorganization_free(sk1,X0,sk6)
| ~ organization(sk1,X0)
| ~ greater(sk6,X0) ),
inference(subsumption_resolution,[],[f55,f9]) ).
fof(f55,plain,
! [X0,X1] :
( ~ organization(sk1,sk6)
| ~ greater(sk6,X0)
| ~ greater(X1,sk2)
| ~ reorganization_free(sk1,X0,sk6)
| ~ organization(sk1,X0)
| ~ complexity(sk1,X1,X0) ),
inference(resolution,[],[f8,f12]) ).
fof(f8,axiom,
! [X2,X3,X0,X1,X4] :
( ~ complexity(X0,X4,X2)
| ~ organization(X0,X2)
| ~ greater(X2,X1)
| ~ greater(X3,X4)
| ~ reorganization_free(X0,X1,X2)
| ~ organization(X0,X1)
| ~ complexity(X0,X3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_FOL_25) ).
fof(f13,axiom,
complexity(sk1,sk3,sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_FOL_30) ).
fof(f16,axiom,
greater(sk3,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_FOL_33) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : MGT013-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n014.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 03:30:49 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.37 % (14025)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (14030)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.38 % (14026)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.38 % (14027)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38 % (14028)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.15/0.38 % (14029)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.15/0.38 % (14031)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.38 % (14032)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.38 Detected minimum model sizes of [1]
% 0.15/0.38 Detected maximum model sizes of [7]
% 0.15/0.38 TRYING [1]
% 0.15/0.38 Detected minimum model sizes of [1]
% 0.15/0.38 Detected maximum model sizes of [7]
% 0.15/0.38 TRYING [1]
% 0.15/0.38 Detected minimum model sizes of [1,1]
% 0.15/0.38 Detected maximum model sizes of [1,6]
% 0.15/0.38 Detected minimum model sizes of [1,1]
% 0.15/0.38 Detected maximum model sizes of [1,6]
% 0.15/0.38 TRYING [1,1]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [1,1]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [1,2]
% 0.15/0.38 TRYING [1,2]
% 0.15/0.38 TRYING [3]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [1,3]
% 0.15/0.39 TRYING [1,3]
% 0.15/0.39 % (14030)First to succeed.
% 0.15/0.39 TRYING [4]
% 0.15/0.39 TRYING [1,4]
% 0.15/0.39 TRYING [4]
% 0.15/0.39 TRYING [1,4]
% 0.15/0.39 % (14028)Also succeeded, but the first one will report.
% 0.15/0.39 % (14030)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39 % (14030)------------------------------
% 0.15/0.39 % (14030)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.39 % (14030)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (14030)Memory used [KB]: 771
% 0.15/0.39 % (14030)Time elapsed: 0.005 s
% 0.15/0.39 % (14030)Instructions burned: 6 (million)
% 0.15/0.39 % (14030)------------------------------
% 0.15/0.39 % (14030)------------------------------
% 0.15/0.39 % (14025)Success in time 0.021 s
%------------------------------------------------------------------------------