TSTP Solution File: MGT008+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : MGT008+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n017.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:15 EDT 2023
% Result : Theorem 0.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 21
% Syntax : Number of formulae : 51 ( 13 unt; 17 typ; 0 def)
% Number of atoms : 164 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 211 ( 81 ~; 78 |; 47 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 8 >; 13 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 109 ( 0 sgn; 56 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
organization: ( $i * $i ) > $o ).
tff(decl_23,type,
inertia: ( $i * $i * $i ) > $o ).
tff(decl_24,type,
class: ( $i * $i * $i ) > $o ).
tff(decl_25,type,
size: ( $i * $i * $i ) > $o ).
tff(decl_26,type,
greater: ( $i * $i ) > $o ).
tff(decl_27,type,
reorganization_free: ( $i * $i * $i ) > $o ).
tff(decl_28,type,
survival_chance: ( $i * $i * $i ) > $o ).
tff(decl_29,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_30,type,
esk2_0: $i ).
tff(decl_31,type,
esk3_0: $i ).
tff(decl_32,type,
esk4_0: $i ).
tff(decl_33,type,
esk5_0: $i ).
tff(decl_34,type,
esk6_0: $i ).
tff(decl_35,type,
esk7_0: $i ).
tff(decl_36,type,
esk8_0: $i ).
tff(decl_37,type,
esk9_0: $i ).
tff(decl_38,type,
esk10_0: $i ).
fof(t8_FOL,conjecture,
! [X1,X4,X5,X12,X13,X6,X7,X10,X11] :
( ( organization(X1,X10)
& organization(X4,X11)
& reorganization_free(X1,X10,X10)
& reorganization_free(X4,X11,X11)
& class(X1,X5,X10)
& class(X4,X5,X11)
& survival_chance(X1,X12,X10)
& survival_chance(X4,X13,X11)
& size(X1,X6,X10)
& size(X4,X7,X11)
& greater(X7,X6) )
=> greater(X13,X12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_FOL) ).
fof(a5_FOL,hypothesis,
! [X1,X4,X5,X6,X7,X8,X9,X10,X11] :
( ( organization(X1,X10)
& organization(X4,X11)
& class(X1,X5,X10)
& class(X4,X5,X11)
& size(X1,X6,X10)
& size(X4,X7,X11)
& inertia(X1,X8,X10)
& inertia(X4,X9,X11)
& greater(X7,X6) )
=> greater(X9,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a5_FOL) ).
fof(t1_FOL,hypothesis,
! [X1,X4,X10,X11,X8,X9,X12,X13] :
( ( organization(X1,X10)
& organization(X4,X11)
& reorganization_free(X1,X10,X10)
& reorganization_free(X4,X11,X11)
& inertia(X1,X8,X10)
& inertia(X4,X9,X11)
& survival_chance(X1,X12,X10)
& survival_chance(X4,X13,X11)
& greater(X9,X8) )
=> greater(X13,X12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_FOL) ).
fof(mp5,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : inertia(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X4,X5,X12,X13,X6,X7,X10,X11] :
( ( organization(X1,X10)
& organization(X4,X11)
& reorganization_free(X1,X10,X10)
& reorganization_free(X4,X11,X11)
& class(X1,X5,X10)
& class(X4,X5,X11)
& survival_chance(X1,X12,X10)
& survival_chance(X4,X13,X11)
& size(X1,X6,X10)
& size(X4,X7,X11)
& greater(X7,X6) )
=> greater(X13,X12) ),
inference(assume_negation,[status(cth)],[t8_FOL]) ).
fof(c_0_5,hypothesis,
! [X17,X18,X19,X20,X21,X22,X23,X24,X25] :
( ~ organization(X17,X24)
| ~ organization(X18,X25)
| ~ class(X17,X19,X24)
| ~ class(X18,X19,X25)
| ~ size(X17,X20,X24)
| ~ size(X18,X21,X25)
| ~ inertia(X17,X22,X24)
| ~ inertia(X18,X23,X25)
| ~ greater(X21,X20)
| greater(X23,X22) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a5_FOL])]) ).
fof(c_0_6,negated_conjecture,
( organization(esk2_0,esk9_0)
& organization(esk3_0,esk10_0)
& reorganization_free(esk2_0,esk9_0,esk9_0)
& reorganization_free(esk3_0,esk10_0,esk10_0)
& class(esk2_0,esk4_0,esk9_0)
& class(esk3_0,esk4_0,esk10_0)
& survival_chance(esk2_0,esk5_0,esk9_0)
& survival_chance(esk3_0,esk6_0,esk10_0)
& size(esk2_0,esk7_0,esk9_0)
& size(esk3_0,esk8_0,esk10_0)
& greater(esk8_0,esk7_0)
& ~ greater(esk6_0,esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,hypothesis,
( greater(X9,X8)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ class(X1,X5,X2)
| ~ class(X3,X5,X4)
| ~ size(X1,X6,X2)
| ~ size(X3,X7,X4)
| ~ inertia(X1,X8,X2)
| ~ inertia(X3,X9,X4)
| ~ greater(X7,X6) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
size(esk3_0,esk8_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
organization(esk3_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,hypothesis,
! [X26,X27,X28,X29,X30,X31,X32,X33] :
( ~ organization(X26,X28)
| ~ organization(X27,X29)
| ~ reorganization_free(X26,X28,X28)
| ~ reorganization_free(X27,X29,X29)
| ~ inertia(X26,X30,X28)
| ~ inertia(X27,X31,X29)
| ~ survival_chance(X26,X32,X28)
| ~ survival_chance(X27,X33,X29)
| ~ greater(X31,X30)
| greater(X33,X32) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_FOL])]) ).
cnf(c_0_11,negated_conjecture,
( greater(X1,X2)
| ~ greater(esk8_0,X3)
| ~ size(X4,X3,X5)
| ~ class(esk3_0,X6,esk10_0)
| ~ class(X4,X6,X5)
| ~ inertia(esk3_0,X1,esk10_0)
| ~ inertia(X4,X2,X5)
| ~ organization(X4,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_12,negated_conjecture,
class(esk3_0,esk4_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X14,X15] :
( ~ organization(X14,X15)
| inertia(X14,esk1_2(X14,X15),X15) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp5])])]) ).
cnf(c_0_14,hypothesis,
( greater(X8,X7)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ reorganization_free(X1,X2,X2)
| ~ reorganization_free(X3,X4,X4)
| ~ inertia(X1,X5,X2)
| ~ inertia(X3,X6,X4)
| ~ survival_chance(X1,X7,X2)
| ~ survival_chance(X3,X8,X4)
| ~ greater(X6,X5) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
survival_chance(esk3_0,esk6_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
reorganization_free(esk3_0,esk10_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( greater(X1,X2)
| ~ greater(esk8_0,X3)
| ~ size(X4,X3,X5)
| ~ class(X4,esk4_0,X5)
| ~ inertia(esk3_0,X1,esk10_0)
| ~ inertia(X4,X2,X5)
| ~ organization(X4,X5) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( inertia(X1,esk1_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( greater(esk6_0,X1)
| ~ survival_chance(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ greater(X4,X5)
| ~ inertia(esk3_0,X4,esk10_0)
| ~ inertia(X2,X5,X3)
| ~ organization(X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_9])]) ).
cnf(c_0_20,negated_conjecture,
( greater(esk1_2(esk3_0,esk10_0),X1)
| ~ greater(esk8_0,X2)
| ~ size(X3,X2,X4)
| ~ class(X3,esk4_0,X4)
| ~ inertia(X3,X1,X4)
| ~ organization(X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_9])]) ).
cnf(c_0_21,negated_conjecture,
size(esk2_0,esk7_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
greater(esk8_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
class(esk2_0,esk4_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
organization(esk2_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,negated_conjecture,
( greater(esk6_0,X1)
| ~ survival_chance(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ greater(esk1_2(esk3_0,esk10_0),X4)
| ~ inertia(X2,X4,X3)
| ~ organization(X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_9])]) ).
cnf(c_0_26,negated_conjecture,
( greater(esk1_2(esk3_0,esk10_0),X1)
| ~ inertia(esk2_0,X1,esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
( greater(esk6_0,X1)
| ~ survival_chance(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(esk2_0,X4,esk9_0)
| ~ inertia(X2,X4,X3)
| ~ organization(X2,X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
( greater(esk6_0,X1)
| ~ survival_chance(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(X2,esk1_2(esk2_0,esk9_0),X3)
| ~ organization(X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_18]),c_0_24])]) ).
cnf(c_0_29,negated_conjecture,
reorganization_free(esk2_0,esk9_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_30,negated_conjecture,
( greater(esk6_0,X1)
| ~ survival_chance(esk2_0,X1,esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_18]),c_0_29]),c_0_24])]) ).
cnf(c_0_31,negated_conjecture,
survival_chance(esk2_0,esk5_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_32,negated_conjecture,
~ greater(esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT008+1 : TPTP v8.1.2. Released v2.0.0.
% 0.13/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n017.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 05:34:57 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.58 % Version : CSE_E---1.5
% 0.20/0.58 % Problem : theBenchmark.p
% 0.20/0.58 % Proof found
% 0.20/0.58 % SZS status Theorem for theBenchmark.p
% 0.20/0.58 % SZS output start Proof
% See solution above
% 0.20/0.58 % Total time : 0.006000 s
% 0.20/0.58 % SZS output end Proof
% 0.20/0.58 % Total time : 0.009000 s
%------------------------------------------------------------------------------