TSTP Solution File: MGT044+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : MGT044+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n031.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:08:37 EDT 2023
% Result : Theorem 0.20s 0.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 19
% Syntax : Number of formulae : 43 ( 8 unt; 13 typ; 0 def)
% Number of atoms : 103 ( 20 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 106 ( 33 ~; 31 |; 24 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 10 >; 10 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 62 ( 7 sgn; 40 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
smaller_or_equal: ( $i * $i ) > $o ).
tff(decl_23,type,
smaller: ( $i * $i ) > $o ).
tff(decl_24,type,
greater_or_equal: ( $i * $i ) > $o ).
tff(decl_25,type,
greater: ( $i * $i ) > $o ).
tff(decl_26,type,
organization: $i > $o ).
tff(decl_27,type,
stock_of_knowledge: ( $i * $i ) > $i ).
tff(decl_28,type,
internal_friction: ( $i * $i ) > $i ).
tff(decl_29,type,
capability: ( $i * $i ) > $i ).
tff(decl_30,type,
age: ( $i * $i ) > $i ).
tff(decl_31,type,
epred1_3: ( $i * $i * $i ) > $o ).
tff(decl_32,type,
esk1_0: $i ).
tff(decl_33,type,
esk2_0: $i ).
tff(decl_34,type,
esk3_0: $i ).
fof(lemma_3,conjecture,
! [X1,X4,X5] :
( ( organization(X1)
& greater(age(X1,X5),age(X1,X4)) )
=> greater(capability(X1,X5),capability(X1,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_3) ).
fof(assumption_9,axiom,
! [X1,X4,X5] :
( organization(X1)
=> internal_friction(X1,X5) = internal_friction(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_9) ).
fof(definition_smaller_or_equal,axiom,
! [X1,X2] :
( smaller_or_equal(X1,X2)
<=> ( smaller(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001+0.ax',definition_smaller_or_equal) ).
fof(assumption_7,axiom,
! [X1,X4,X5] :
( ( organization(X1)
& greater(age(X1,X5),age(X1,X4)) )
=> greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_7) ).
fof(assumption_5,axiom,
! [X1,X4,X5] :
( organization(X1)
=> ( ( ( greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))
& smaller_or_equal(internal_friction(X1,X5),internal_friction(X1,X4)) )
=> greater(capability(X1,X5),capability(X1,X4)) )
& ( ( smaller_or_equal(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))
& greater(internal_friction(X1,X5),internal_friction(X1,X4)) )
=> smaller(capability(X1,X5),capability(X1,X4)) )
& ( ( stock_of_knowledge(X1,X5) = stock_of_knowledge(X1,X4)
& internal_friction(X1,X5) = internal_friction(X1,X4) )
=> capability(X1,X5) = capability(X1,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_5) ).
fof(c_0_5,plain,
! [X1,X5,X4] :
( epred1_3(X4,X5,X1)
<=> ( ( ( greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))
& smaller_or_equal(internal_friction(X1,X5),internal_friction(X1,X4)) )
=> greater(capability(X1,X5),capability(X1,X4)) )
& ( ( smaller_or_equal(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))
& greater(internal_friction(X1,X5),internal_friction(X1,X4)) )
=> smaller(capability(X1,X5),capability(X1,X4)) )
& ( ( stock_of_knowledge(X1,X5) = stock_of_knowledge(X1,X4)
& internal_friction(X1,X5) = internal_friction(X1,X4) )
=> capability(X1,X5) = capability(X1,X4) ) ) ),
introduced(definition) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X4,X5] :
( ( organization(X1)
& greater(age(X1,X5),age(X1,X4)) )
=> greater(capability(X1,X5),capability(X1,X4)) ),
inference(assume_negation,[status(cth)],[lemma_3]) ).
fof(c_0_7,plain,
! [X1,X5,X4] :
( epred1_3(X4,X5,X1)
=> ( ( ( greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))
& smaller_or_equal(internal_friction(X1,X5),internal_friction(X1,X4)) )
=> greater(capability(X1,X5),capability(X1,X4)) )
& ( ( smaller_or_equal(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4))
& greater(internal_friction(X1,X5),internal_friction(X1,X4)) )
=> smaller(capability(X1,X5),capability(X1,X4)) )
& ( ( stock_of_knowledge(X1,X5) = stock_of_knowledge(X1,X4)
& internal_friction(X1,X5) = internal_friction(X1,X4) )
=> capability(X1,X5) = capability(X1,X4) ) ) ),
inference(split_equiv,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X25,X26,X27] :
( ~ organization(X25)
| internal_friction(X25,X27) = internal_friction(X25,X26) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_9])]) ).
fof(c_0_9,negated_conjecture,
( organization(esk1_0)
& greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))
& ~ greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_10,plain,
! [X31,X32,X33] :
( ( ~ greater(stock_of_knowledge(X31,X32),stock_of_knowledge(X31,X33))
| ~ smaller_or_equal(internal_friction(X31,X32),internal_friction(X31,X33))
| greater(capability(X31,X32),capability(X31,X33))
| ~ epred1_3(X33,X32,X31) )
& ( ~ smaller_or_equal(stock_of_knowledge(X31,X32),stock_of_knowledge(X31,X33))
| ~ greater(internal_friction(X31,X32),internal_friction(X31,X33))
| smaller(capability(X31,X32),capability(X31,X33))
| ~ epred1_3(X33,X32,X31) )
& ( stock_of_knowledge(X31,X32) != stock_of_knowledge(X31,X33)
| internal_friction(X31,X32) != internal_friction(X31,X33)
| capability(X31,X32) = capability(X31,X33)
| ~ epred1_3(X33,X32,X31) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_11,plain,
( internal_friction(X1,X2) = internal_friction(X1,X3)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
organization(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X6,X7] :
( ( ~ smaller_or_equal(X6,X7)
| smaller(X6,X7)
| X6 = X7 )
& ( ~ smaller(X6,X7)
| smaller_or_equal(X6,X7) )
& ( X6 != X7
| smaller_or_equal(X6,X7) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_smaller_or_equal])])]) ).
cnf(c_0_14,plain,
( greater(capability(X1,X2),capability(X1,X3))
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ epred1_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
internal_friction(esk1_0,X1) = internal_friction(esk1_0,X2),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X22,X23,X24] :
( ~ organization(X22)
| ~ greater(age(X22,X24),age(X22,X23))
| greater(stock_of_knowledge(X22,X24),stock_of_knowledge(X22,X23)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_7])]) ).
cnf(c_0_18,plain,
( greater(capability(esk1_0,X1),capability(esk1_0,X2))
| ~ epred1_3(X2,X1,esk1_0)
| ~ greater(stock_of_knowledge(esk1_0,X1),stock_of_knowledge(esk1_0,X2))
| ~ smaller_or_equal(internal_friction(esk1_0,X3),internal_friction(esk1_0,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_22,axiom,
! [X1,X4,X5] :
( organization(X1)
=> epred1_3(X4,X5,X1) ),
inference(apply_def,[status(thm)],[assumption_5,c_0_5]) ).
cnf(c_0_23,negated_conjecture,
~ greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,plain,
( greater(capability(esk1_0,X1),capability(esk1_0,X2))
| ~ epred1_3(X2,X1,esk1_0)
| ~ greater(stock_of_knowledge(esk1_0,X1),stock_of_knowledge(esk1_0,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
greater(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_12])]) ).
fof(c_0_26,plain,
! [X19,X20,X21] :
( ~ organization(X19)
| epred1_3(X20,X21,X19) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])]) ).
cnf(c_0_27,negated_conjecture,
~ epred1_3(esk2_0,esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_28,plain,
( epred1_3(X2,X3,X1)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT044+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n031.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Aug 28 06:55:54 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.60 % Version : CSE_E---1.5
% 0.20/0.60 % Problem : theBenchmark.p
% 0.20/0.60 % Proof found
% 0.20/0.60 % SZS status Theorem for theBenchmark.p
% 0.20/0.60 % SZS output start Proof
% See solution above
% 0.20/0.60 % Total time : 0.022000 s
% 0.20/0.60 % SZS output end Proof
% 0.20/0.60 % Total time : 0.024000 s
%------------------------------------------------------------------------------