TSTP Solution File: MGT048+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT048+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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 : 600s
% DateTime : Sun Jul 17 22:06:48 EDT 2022
% Result : Theorem 5.56s 1.97s
% Output : CNFRefutation 5.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 11 unt; 0 nHn; 17 RR)
% Number of literals : 44 ( 5 equ; 24 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 36 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nqo8c2iz/input.p',i_0_1) ).
cnf(i_0_14,negated_conjecture,
organization(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nqo8c2iz/input.p',i_0_14) ).
cnf(i_0_19,plain,
( smaller(capability(X1,X2),capability(X1,X3))
| ~ epred1_3(X3,X2,X1)
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nqo8c2iz/input.p',i_0_19) ).
cnf(i_0_9,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nqo8c2iz/input.p',i_0_9) ).
cnf(i_0_2,plain,
( greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nqo8c2iz/input.p',i_0_2) ).
cnf(i_0_13,negated_conjecture,
greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nqo8c2iz/input.p',i_0_13) ).
cnf(i_0_12,negated_conjecture,
~ smaller(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nqo8c2iz/input.p',i_0_12) ).
cnf(i_0_3,plain,
( epred1_3(X1,X2,X3)
| ~ organization(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nqo8c2iz/input.p',i_0_3) ).
cnf(c_0_28,plain,
( stock_of_knowledge(X1,X2) = stock_of_knowledge(X1,X3)
| ~ organization(X1) ),
i_0_1 ).
cnf(c_0_29,negated_conjecture,
organization(esk1_0),
i_0_14 ).
cnf(c_0_30,plain,
( smaller(capability(X1,X2),capability(X1,X3))
| ~ epred1_3(X3,X2,X1)
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)) ),
i_0_19 ).
cnf(c_0_31,negated_conjecture,
stock_of_knowledge(esk1_0,X1) = stock_of_knowledge(esk1_0,X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
i_0_9 ).
cnf(c_0_33,plain,
( smaller(capability(esk1_0,X1),capability(esk1_0,X2))
| ~ epred1_3(X2,X1,esk1_0)
| ~ smaller_or_equal(stock_of_knowledge(esk1_0,X3),stock_of_knowledge(esk1_0,X2))
| ~ greater(internal_friction(esk1_0,X1),internal_friction(esk1_0,X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_35,plain,
( greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
i_0_2 ).
cnf(c_0_36,negated_conjecture,
greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)),
i_0_13 ).
cnf(c_0_37,negated_conjecture,
~ smaller(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)),
i_0_12 ).
cnf(c_0_38,plain,
( smaller(capability(esk1_0,X1),capability(esk1_0,X2))
| ~ epred1_3(X2,X1,esk1_0)
| ~ greater(internal_friction(esk1_0,X1),internal_friction(esk1_0,X2)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
greater(internal_friction(esk1_0,esk3_0),internal_friction(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_29])]) ).
cnf(c_0_40,negated_conjecture,
~ epred1_3(esk2_0,esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_41,plain,
( epred1_3(X1,X2,X3)
| ~ organization(X3) ),
i_0_3 ).
cnf(c_0_42,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08 % Problem : MGT048+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.08 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 600
% 0.08/0.27 % DateTime : Thu Jun 9 08:46:54 EDT 2022
% 0.08/0.27 % CPUTime :
% 0.12/0.33 # ENIGMATIC: Selected SinE mode:
% 0.12/0.33 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.33 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.12/0.33 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.12/0.33 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.56/1.97 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 5.56/1.97 # Version: 2.1pre011
% 5.56/1.97 # Preprocessing time : 0.009 s
% 5.56/1.97
% 5.56/1.97 # Proof found!
% 5.56/1.97 # SZS status Theorem
% 5.56/1.97 # SZS output start CNFRefutation
% See solution above
% 5.56/1.97 # Proof object total steps : 23
% 5.56/1.97 # Proof object clause steps : 15
% 5.56/1.97 # Proof object formula steps : 8
% 5.56/1.97 # Proof object conjectures : 9
% 5.56/1.97 # Proof object clause conjectures : 6
% 5.56/1.97 # Proof object formula conjectures : 3
% 5.56/1.97 # Proof object initial clauses used : 8
% 5.56/1.97 # Proof object initial formulas used : 8
% 5.56/1.97 # Proof object generating inferences : 6
% 5.56/1.97 # Proof object simplifying inferences : 7
% 5.56/1.97 # Training examples: 0 positive, 0 negative
% 5.56/1.97 # Parsed axioms : 20
% 5.56/1.97 # Removed by relevancy pruning/SinE : 0
% 5.56/1.97 # Initial clauses : 20
% 5.56/1.97 # Removed in clause preprocessing : 0
% 5.56/1.97 # Initial clauses in saturation : 20
% 5.56/1.97 # Processed clauses : 147
% 5.56/1.97 # ...of these trivial : 0
% 5.56/1.97 # ...subsumed : 56
% 5.56/1.97 # ...remaining for further processing : 91
% 5.56/1.97 # Other redundant clauses eliminated : 2
% 5.56/1.97 # Clauses deleted for lack of memory : 0
% 5.56/1.97 # Backward-subsumed : 6
% 5.56/1.97 # Backward-rewritten : 0
% 5.56/1.97 # Generated clauses : 343
% 5.56/1.97 # ...of the previous two non-trivial : 302
% 5.56/1.97 # Contextual simplify-reflections : 18
% 5.56/1.97 # Paramodulations : 338
% 5.56/1.97 # Factorizations : 2
% 5.56/1.97 # Equation resolutions : 3
% 5.56/1.97 # Propositional unsat checks : 0
% 5.56/1.97 # Propositional unsat check successes : 0
% 5.56/1.97 # Current number of processed clauses : 83
% 5.56/1.97 # Positive orientable unit clauses : 5
% 5.56/1.97 # Positive unorientable unit clauses: 1
% 5.56/1.97 # Negative unit clauses : 5
% 5.56/1.97 # Non-unit-clauses : 72
% 5.56/1.97 # Current number of unprocessed clauses: 152
% 5.56/1.97 # ...number of literals in the above : 745
% 5.56/1.97 # Current number of archived formulas : 0
% 5.56/1.97 # Current number of archived clauses : 6
% 5.56/1.97 # Clause-clause subsumption calls (NU) : 2143
% 5.56/1.97 # Rec. Clause-clause subsumption calls : 1473
% 5.56/1.97 # Non-unit clause-clause subsumptions : 70
% 5.56/1.97 # Unit Clause-clause subsumption calls : 56
% 5.56/1.97 # Rewrite failures with RHS unbound : 0
% 5.56/1.97 # BW rewrite match attempts : 4
% 5.56/1.97 # BW rewrite match successes : 0
% 5.56/1.97 # Condensation attempts : 0
% 5.56/1.97 # Condensation successes : 0
% 5.56/1.97 # Termbank termtop insertions : 7217
% 5.56/1.97
% 5.56/1.97 # -------------------------------------------------
% 5.56/1.97 # User time : 0.013 s
% 5.56/1.97 # System time : 0.003 s
% 5.56/1.97 # Total time : 0.017 s
% 5.56/1.97 # ...preprocessing : 0.009 s
% 5.56/1.97 # ...main loop : 0.007 s
% 5.56/1.97 # Maximum resident set size: 7136 pages
% 5.56/1.97
%------------------------------------------------------------------------------