TSTP Solution File: MGT013-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : MGT013-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n008.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 : Thu Aug 31 09:07:17 EDT 2023
% Result : Unsatisfiable 0.21s 0.58s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 29
% Syntax : Number of formulae : 62 ( 28 unt; 13 typ; 0 def)
% Number of atoms : 115 ( 14 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 137 ( 71 ~; 66 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 6 >; 8 *; 0 +; 0 <<)
% 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 : 60 ( 2 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
greater: ( $i * $i ) > $o ).
tff(decl_23,type,
organization: ( $i * $i ) > $o ).
tff(decl_24,type,
time: $i > $o ).
tff(decl_25,type,
reorganization_free: ( $i * $i * $i ) > $o ).
tff(decl_26,type,
complexity: ( $i * $i * $i ) > $o ).
tff(decl_27,type,
size: ( $i * $i * $i ) > $o ).
tff(decl_28,type,
sk1: $i ).
tff(decl_29,type,
sk6: $i ).
tff(decl_30,type,
sk7: $i ).
tff(decl_31,type,
sk2: $i ).
tff(decl_32,type,
sk3: $i ).
tff(decl_33,type,
sk4: $i ).
tff(decl_34,type,
sk5: $i ).
cnf(t12_FOL_25,hypothesis,
( ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ complexity(X1,X4,X2)
| ~ complexity(X1,X5,X3)
| ~ greater(X3,X2)
| ~ greater(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_25) ).
cnf(t13_FOL_29,negated_conjecture,
complexity(sk1,sk2,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_29) ).
cnf(t13_FOL_26,negated_conjecture,
organization(sk1,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_26) ).
cnf(mp17_22,axiom,
( reorganization_free(X1,X3,X2)
| ~ reorganization_free(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp17_22) ).
cnf(t13_FOL_28,negated_conjecture,
reorganization_free(sk1,sk6,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_28) ).
cnf(mp15_20,axiom,
( time(X2)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp15_20) ).
cnf(t13_FOL_27,negated_conjecture,
organization(sk1,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_27) ).
cnf(mp16_21,axiom,
( greater(X1,X2)
| X1 = X2
| greater(X2,X1)
| ~ time(X1)
| ~ time(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp16_21) ).
cnf(t13_FOL_30,negated_conjecture,
complexity(sk1,sk3,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_30) ).
cnf(t13_FOL_33,negated_conjecture,
greater(sk3,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_33) ).
cnf(t11_FOL_24,hypothesis,
( ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ size(X1,X4,X2)
| ~ size(X1,X5,X3)
| ~ greater(X3,X2)
| ~ greater(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_24) ).
cnf(t13_FOL_32,negated_conjecture,
size(sk1,sk5,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_32) ).
cnf(t13_FOL_31,negated_conjecture,
size(sk1,sk4,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_31) ).
cnf(t13_FOL_34,negated_conjecture,
greater(sk4,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_34) ).
cnf(mp18_23,axiom,
( X4 = X5
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ complexity(X1,X4,X2)
| ~ complexity(X1,X5,X3)
| X2 != X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp18_23) ).
cnf(mp6_1_18,axiom,
( ~ greater(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp6_1_18) ).
cnf(c_0_16,hypothesis,
( ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ complexity(X1,X4,X2)
| ~ complexity(X1,X5,X3)
| ~ greater(X3,X2)
| ~ greater(X4,X5) ),
t12_FOL_25 ).
cnf(c_0_17,negated_conjecture,
complexity(sk1,sk2,sk6),
t13_FOL_29 ).
cnf(c_0_18,negated_conjecture,
organization(sk1,sk6),
t13_FOL_26 ).
cnf(c_0_19,axiom,
( reorganization_free(X1,X3,X2)
| ~ reorganization_free(X1,X2,X3) ),
mp17_22 ).
cnf(c_0_20,negated_conjecture,
reorganization_free(sk1,sk6,sk7),
t13_FOL_28 ).
cnf(c_0_21,axiom,
( time(X2)
| ~ organization(X1,X2) ),
mp15_20 ).
cnf(c_0_22,negated_conjecture,
organization(sk1,sk7),
t13_FOL_27 ).
cnf(c_0_23,negated_conjecture,
( ~ complexity(sk1,X1,X2)
| ~ reorganization_free(sk1,X2,sk6)
| ~ organization(sk1,X2)
| ~ greater(X1,sk2)
| ~ greater(sk6,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_24,negated_conjecture,
reorganization_free(sk1,sk7,sk6),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,axiom,
( greater(X1,X2)
| X1 = X2
| greater(X2,X1)
| ~ time(X1)
| ~ time(X2) ),
mp16_21 ).
cnf(c_0_26,negated_conjecture,
time(sk7),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( ~ complexity(sk1,X1,sk7)
| ~ greater(sk6,sk7)
| ~ greater(X1,sk2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22])]) ).
cnf(c_0_28,negated_conjecture,
complexity(sk1,sk3,sk7),
t13_FOL_30 ).
cnf(c_0_29,negated_conjecture,
greater(sk3,sk2),
t13_FOL_33 ).
cnf(c_0_30,hypothesis,
( ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ size(X1,X4,X2)
| ~ size(X1,X5,X3)
| ~ greater(X3,X2)
| ~ greater(X4,X5) ),
t11_FOL_24 ).
cnf(c_0_31,negated_conjecture,
size(sk1,sk5,sk7),
t13_FOL_32 ).
cnf(c_0_32,negated_conjecture,
( X1 = sk7
| greater(X1,sk7)
| greater(sk7,X1)
| ~ time(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
time(sk6),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_34,negated_conjecture,
~ greater(sk6,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_35,negated_conjecture,
( ~ size(sk1,X1,X2)
| ~ reorganization_free(sk1,X2,sk7)
| ~ organization(sk1,X2)
| ~ greater(X1,sk5)
| ~ greater(sk7,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_22])]) ).
cnf(c_0_36,negated_conjecture,
size(sk1,sk4,sk6),
t13_FOL_31 ).
cnf(c_0_37,negated_conjecture,
greater(sk4,sk5),
t13_FOL_34 ).
cnf(c_0_38,axiom,
( X4 = X5
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ complexity(X1,X4,X2)
| ~ complexity(X1,X5,X3)
| X2 != X3 ),
mp18_23 ).
cnf(c_0_39,negated_conjecture,
( sk7 = sk6
| greater(sk7,sk6) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_40,negated_conjecture,
~ greater(sk7,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_20]),c_0_18]),c_0_37])]) ).
cnf(c_0_41,plain,
( X1 = X2
| ~ complexity(X3,X2,X4)
| ~ complexity(X3,X1,X4)
| ~ organization(X3,X4) ),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_42,negated_conjecture,
sk7 = sk6,
inference(sr,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( X1 = sk2
| ~ complexity(sk1,X1,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_17]),c_0_18])]) ).
cnf(c_0_44,negated_conjecture,
complexity(sk1,sk3,sk6),
inference(rw,[status(thm)],[c_0_28,c_0_42]) ).
cnf(c_0_45,axiom,
( ~ greater(X1,X2)
| X1 != X2 ),
mp6_1_18 ).
cnf(c_0_46,negated_conjecture,
sk3 = sk2,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT013-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 06:22:47 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.56 start to proof: theBenchmark
% 0.21/0.58 % Version : CSE_E---1.5
% 0.21/0.58 % Problem : theBenchmark.p
% 0.21/0.58 % Proof found
% 0.21/0.58 % SZS status Theorem for theBenchmark.p
% 0.21/0.58 % SZS output start Proof
% See solution above
% 0.21/0.59 % Total time : 0.006000 s
% 0.21/0.59 % SZS output end Proof
% 0.21/0.59 % Total time : 0.009000 s
%------------------------------------------------------------------------------