TSTP Solution File: MGT014+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : MGT014+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n018.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:18 EDT 2023
% Result : Theorem 0.19s 0.57s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 21
% Syntax : Number of formulae : 65 ( 19 unt; 13 typ; 0 def)
% Number of atoms : 178 ( 18 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 205 ( 79 ~; 68 |; 48 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 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 : 108 ( 1 sgn; 72 !; 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,
size: ( $i * $i * $i ) > $o ).
tff(decl_27,type,
complexity: ( $i * $i * $i ) > $o ).
tff(decl_28,type,
esk1_0: $i ).
tff(decl_29,type,
esk2_0: $i ).
tff(decl_30,type,
esk3_0: $i ).
tff(decl_31,type,
esk4_0: $i ).
tff(decl_32,type,
esk5_0: $i ).
tff(decl_33,type,
esk6_0: $i ).
tff(decl_34,type,
esk7_0: $i ).
fof(t11_FOL,hypothesis,
! [X1,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& greater(X5,X4) )
=> ~ greater(X6,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t11_FOL) ).
fof(t14_FOL,conjecture,
! [X1,X8,X9,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& greater(X7,X6) )
=> ~ greater(X8,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t14_FOL) ).
fof(mp17,axiom,
! [X1,X4,X5] :
( reorganization_free(X1,X4,X5)
=> reorganization_free(X1,X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp17) ).
fof(mp15,axiom,
! [X1,X3] :
( organization(X1,X3)
=> time(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp15) ).
fof(t12_FOL,hypothesis,
! [X1,X8,X9,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& greater(X5,X4) )
=> ~ greater(X8,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_FOL) ).
fof(mp16,axiom,
! [X4,X5] :
( ( time(X4)
& time(X5) )
=> ( greater(X4,X5)
| X4 = X5
| greater(X5,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp16) ).
fof(mp19,axiom,
! [X1,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& X4 = X5 )
=> X6 = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp19) ).
fof(mp6_1,axiom,
! [X1,X2] :
~ ( greater(X1,X2)
& X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp6_1) ).
fof(c_0_8,hypothesis,
! [X1,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& greater(X5,X4) )
=> ~ greater(X6,X7) ),
inference(fof_simplification,[status(thm)],[t11_FOL]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X8,X9,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& greater(X7,X6) )
=> ~ greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t14_FOL])]) ).
fof(c_0_10,hypothesis,
! [X26,X27,X28,X29,X30] :
( ~ organization(X26,X29)
| ~ organization(X26,X30)
| ~ reorganization_free(X26,X29,X30)
| ~ size(X26,X27,X29)
| ~ size(X26,X28,X30)
| ~ greater(X30,X29)
| ~ greater(X27,X28) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
fof(c_0_11,negated_conjecture,
( organization(esk1_0,esk6_0)
& organization(esk1_0,esk7_0)
& reorganization_free(esk1_0,esk6_0,esk7_0)
& complexity(esk1_0,esk2_0,esk6_0)
& complexity(esk1_0,esk3_0,esk7_0)
& size(esk1_0,esk4_0,esk6_0)
& size(esk1_0,esk5_0,esk7_0)
& greater(esk5_0,esk4_0)
& greater(esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_12,plain,
! [X18,X19,X20] :
( ~ reorganization_free(X18,X19,X20)
| reorganization_free(X18,X20,X19) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp17])]) ).
fof(c_0_13,plain,
! [X14,X15] :
( ~ organization(X14,X15)
| time(X15) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp15])]) ).
cnf(c_0_14,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) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
size(esk1_0,esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
organization(esk1_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( reorganization_free(X1,X3,X2)
| ~ reorganization_free(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
reorganization_free(esk1_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_19,hypothesis,
! [X1,X8,X9,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& greater(X5,X4) )
=> ~ greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[t12_FOL]) ).
fof(c_0_20,plain,
! [X16,X17] :
( ~ time(X16)
| ~ time(X17)
| greater(X16,X17)
| X16 = X17
| greater(X17,X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp16])]) ).
cnf(c_0_21,plain,
( time(X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
organization(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
( ~ size(esk1_0,X1,X2)
| ~ reorganization_free(esk1_0,X2,esk6_0)
| ~ organization(esk1_0,X2)
| ~ greater(X1,esk4_0)
| ~ greater(esk6_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_24,negated_conjecture,
reorganization_free(esk1_0,esk7_0,esk6_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_25,hypothesis,
! [X31,X32,X33,X34,X35] :
( ~ organization(X31,X34)
| ~ organization(X31,X35)
| ~ reorganization_free(X31,X34,X35)
| ~ complexity(X31,X32,X34)
| ~ complexity(X31,X33,X35)
| ~ greater(X35,X34)
| ~ greater(X32,X33) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])]) ).
cnf(c_0_26,plain,
( greater(X1,X2)
| X1 = X2
| greater(X2,X1)
| ~ time(X1)
| ~ time(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
time(esk7_0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( ~ size(esk1_0,X1,esk7_0)
| ~ greater(esk6_0,esk7_0)
| ~ greater(X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22])]) ).
cnf(c_0_29,negated_conjecture,
size(esk1_0,esk5_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_30,negated_conjecture,
greater(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,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) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
complexity(esk1_0,esk3_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_33,plain,
! [X21,X22,X23,X24,X25] :
( ~ organization(X21,X24)
| ~ organization(X21,X25)
| ~ size(X21,X22,X24)
| ~ size(X21,X23,X25)
| X24 != X25
| X22 = X23 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp19])]) ).
cnf(c_0_34,negated_conjecture,
( X1 = esk7_0
| greater(X1,esk7_0)
| greater(esk7_0,X1)
| ~ time(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
time(esk6_0),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_36,negated_conjecture,
~ greater(esk6_0,esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_37,negated_conjecture,
( ~ complexity(esk1_0,X1,X2)
| ~ reorganization_free(esk1_0,X2,esk7_0)
| ~ organization(esk1_0,X2)
| ~ greater(X1,esk3_0)
| ~ greater(esk7_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_22])]) ).
cnf(c_0_38,negated_conjecture,
complexity(esk1_0,esk2_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_39,negated_conjecture,
greater(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_40,plain,
( X4 = X5
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ size(X1,X4,X2)
| ~ size(X1,X5,X3)
| X2 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,negated_conjecture,
( esk7_0 = esk6_0
| greater(esk7_0,esk6_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_42,negated_conjecture,
~ greater(esk7_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_18]),c_0_16]),c_0_39])]) ).
cnf(c_0_43,plain,
( X1 = X2
| ~ size(X3,X2,X4)
| ~ size(X3,X1,X4)
| ~ organization(X3,X4) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_44,negated_conjecture,
esk7_0 = esk6_0,
inference(sr,[status(thm)],[c_0_41,c_0_42]) ).
fof(c_0_45,plain,
! [X10,X11] :
( ~ greater(X10,X11)
| X10 != X11 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp6_1])]) ).
cnf(c_0_46,negated_conjecture,
( X1 = esk4_0
| ~ size(esk1_0,X1,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_15]),c_0_16])]) ).
cnf(c_0_47,negated_conjecture,
size(esk1_0,esk5_0,esk6_0),
inference(rw,[status(thm)],[c_0_29,c_0_44]) ).
cnf(c_0_48,plain,
( ~ greater(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_49,negated_conjecture,
esk4_0 = esk5_0,
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_48]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_49]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT014+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Aug 28 06:40:46 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 0.19/0.57 % Version : CSE_E---1.5
% 0.19/0.57 % Problem : theBenchmark.p
% 0.19/0.57 % Proof found
% 0.19/0.57 % SZS status Theorem for theBenchmark.p
% 0.19/0.57 % SZS output start Proof
% See solution above
% 0.19/0.57 % Total time : 0.009000 s
% 0.19/0.57 % SZS output end Proof
% 0.19/0.57 % Total time : 0.012000 s
%------------------------------------------------------------------------------