TSTP Solution File: MGT048-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : MGT048-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 : n025.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:39 EDT 2023
% Result : Unsatisfiable 0.19s 0.60s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 19
% Syntax : Number of formulae : 32 ( 10 unt; 12 typ; 0 def)
% Number of atoms : 37 ( 5 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 36 ( 19 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 9 >; 8 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 7 sgn; 0 !; 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,
sk1: $i ).
tff(decl_32,type,
sk3: $i ).
tff(decl_33,type,
sk2: $i ).
cnf(assumption_10_35,axiom,
( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_10_35) ).
cnf(lemma_5_37,negated_conjecture,
organization(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_5_37) ).
cnf(assumption_5_33,axiom,
( smaller(capability(X1,X2),capability(X1,X3))
| ~ organization(X1)
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_5_33) ).
cnf(definition_smaller_or_equal_3,axiom,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001-0.ax',definition_smaller_or_equal_3) ).
cnf(assumption_12_36,axiom,
( greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_12_36) ).
cnf(lemma_5_38,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_5_38) ).
cnf(lemma_5_39,negated_conjecture,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_5_39) ).
cnf(c_0_7,axiom,
( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
assumption_10_35 ).
cnf(c_0_8,negated_conjecture,
organization(sk1),
lemma_5_37 ).
cnf(c_0_9,axiom,
( smaller(capability(X1,X2),capability(X1,X3))
| ~ organization(X1)
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X3)) ),
assumption_5_33 ).
cnf(c_0_10,negated_conjecture,
stock_of_knowledge(sk1,X1) = stock_of_knowledge(sk1,X2),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
definition_smaller_or_equal_3 ).
cnf(c_0_12,negated_conjecture,
( smaller(capability(sk1,X1),capability(sk1,X2))
| ~ greater(internal_friction(sk1,X1),internal_friction(sk1,X2))
| ~ smaller_or_equal(stock_of_knowledge(sk1,X3),stock_of_knowledge(sk1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8])]) ).
cnf(c_0_13,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_14,axiom,
( greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
assumption_12_36 ).
cnf(c_0_15,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
lemma_5_38 ).
cnf(c_0_16,negated_conjecture,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
lemma_5_39 ).
cnf(c_0_17,negated_conjecture,
( smaller(capability(sk1,X1),capability(sk1,X2))
| ~ greater(internal_friction(sk1,X1),internal_friction(sk1,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_8])]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT048-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 28 06:39:24 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.57 start to proof: theBenchmark
% 0.19/0.60 % Version : CSE_E---1.5
% 0.19/0.60 % Problem : theBenchmark.p
% 0.19/0.60 % Proof found
% 0.19/0.60 % SZS status Theorem for theBenchmark.p
% 0.19/0.60 % SZS output start Proof
% See solution above
% 0.19/0.60 % Total time : 0.011000 s
% 0.19/0.60 % SZS output end Proof
% 0.19/0.60 % Total time : 0.014000 s
%------------------------------------------------------------------------------