TSTP Solution File: MGT044+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT044+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:47 EDT 2022
% Result : Theorem 5.04s 2.18s
% Output : CNFRefutation 5.04s
% 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 : 6 ( 4 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_3,plain,
( internal_friction(X1,X2) = internal_friction(X1,X3)
| ~ organization(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b35mmshw/input.p',i_0_3) ).
cnf(i_0_14,negated_conjecture,
organization(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b35mmshw/input.p',i_0_14) ).
cnf(i_0_20,plain,
( greater(capability(X1,X2),capability(X1,X3))
| ~ epred1_3(X3,X2,X1)
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b35mmshw/input.p',i_0_20) ).
cnf(i_0_9,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b35mmshw/input.p',i_0_9) ).
cnf(i_0_2,plain,
( greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b35mmshw/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-b35mmshw/input.p',i_0_13) ).
cnf(i_0_12,negated_conjecture,
~ greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b35mmshw/input.p',i_0_12) ).
cnf(i_0_1,plain,
( epred1_3(X1,X2,X3)
| ~ organization(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b35mmshw/input.p',i_0_1) ).
cnf(c_0_29,plain,
( internal_friction(X1,X2) = internal_friction(X1,X3)
| ~ organization(X1) ),
i_0_3 ).
cnf(c_0_30,negated_conjecture,
organization(esk1_0),
i_0_14 ).
cnf(c_0_31,plain,
( greater(capability(X1,X2),capability(X1,X3))
| ~ epred1_3(X3,X2,X1)
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)) ),
i_0_20 ).
cnf(c_0_32,negated_conjecture,
internal_friction(esk1_0,X1) = internal_friction(esk1_0,X2),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
i_0_9 ).
cnf(c_0_34,plain,
( greater(capability(esk1_0,X1),capability(esk1_0,X2))
| ~ epred1_3(X2,X1,esk1_0)
| ~ smaller_or_equal(internal_friction(esk1_0,X3),internal_friction(esk1_0,X2))
| ~ greater(stock_of_knowledge(esk1_0,X1),stock_of_knowledge(esk1_0,X2)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_36,plain,
( greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
i_0_2 ).
cnf(c_0_37,negated_conjecture,
greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)),
i_0_13 ).
cnf(c_0_38,negated_conjecture,
~ greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)),
i_0_12 ).
cnf(c_0_39,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_34,c_0_35]) ).
cnf(c_0_40,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_36,c_0_37]),c_0_30])]) ).
cnf(c_0_41,negated_conjecture,
~ epred1_3(esk2_0,esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_42,plain,
( epred1_3(X1,X2,X3)
| ~ organization(X3) ),
i_0_1 ).
cnf(c_0_43,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT044+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n020.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 : 600
% 0.12/0.33 % DateTime : Thu Jun 9 11:24:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.04/2.18 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 5.04/2.18 # Version: 2.1pre011
% 5.04/2.18 # Preprocessing time : 0.017 s
% 5.04/2.18
% 5.04/2.18 # Proof found!
% 5.04/2.18 # SZS status Theorem
% 5.04/2.18 # SZS output start CNFRefutation
% See solution above
% 5.04/2.18 # Proof object total steps : 23
% 5.04/2.18 # Proof object clause steps : 15
% 5.04/2.18 # Proof object formula steps : 8
% 5.04/2.18 # Proof object conjectures : 9
% 5.04/2.18 # Proof object clause conjectures : 6
% 5.04/2.18 # Proof object formula conjectures : 3
% 5.04/2.18 # Proof object initial clauses used : 8
% 5.04/2.18 # Proof object initial formulas used : 8
% 5.04/2.18 # Proof object generating inferences : 6
% 5.04/2.18 # Proof object simplifying inferences : 7
% 5.04/2.18 # Training examples: 0 positive, 0 negative
% 5.04/2.18 # Parsed axioms : 20
% 5.04/2.18 # Removed by relevancy pruning/SinE : 0
% 5.04/2.18 # Initial clauses : 20
% 5.04/2.18 # Removed in clause preprocessing : 0
% 5.04/2.18 # Initial clauses in saturation : 20
% 5.04/2.18 # Processed clauses : 99
% 5.04/2.18 # ...of these trivial : 0
% 5.04/2.18 # ...subsumed : 28
% 5.04/2.18 # ...remaining for further processing : 71
% 5.04/2.18 # Other redundant clauses eliminated : 2
% 5.04/2.18 # Clauses deleted for lack of memory : 0
% 5.04/2.18 # Backward-subsumed : 6
% 5.04/2.18 # Backward-rewritten : 0
% 5.04/2.18 # Generated clauses : 220
% 5.04/2.18 # ...of the previous two non-trivial : 171
% 5.04/2.18 # Contextual simplify-reflections : 12
% 5.04/2.18 # Paramodulations : 215
% 5.04/2.18 # Factorizations : 2
% 5.04/2.18 # Equation resolutions : 3
% 5.04/2.18 # Propositional unsat checks : 0
% 5.04/2.18 # Propositional unsat check successes : 0
% 5.04/2.18 # Current number of processed clauses : 63
% 5.04/2.18 # Positive orientable unit clauses : 5
% 5.04/2.18 # Positive unorientable unit clauses: 1
% 5.04/2.18 # Negative unit clauses : 4
% 5.04/2.18 # Non-unit-clauses : 53
% 5.04/2.18 # Current number of unprocessed clauses: 70
% 5.04/2.18 # ...number of literals in the above : 339
% 5.04/2.18 # Current number of archived formulas : 0
% 5.04/2.18 # Current number of archived clauses : 6
% 5.04/2.18 # Clause-clause subsumption calls (NU) : 1749
% 5.04/2.18 # Rec. Clause-clause subsumption calls : 1226
% 5.04/2.18 # Non-unit clause-clause subsumptions : 39
% 5.04/2.18 # Unit Clause-clause subsumption calls : 48
% 5.04/2.18 # Rewrite failures with RHS unbound : 0
% 5.04/2.18 # BW rewrite match attempts : 4
% 5.04/2.18 # BW rewrite match successes : 0
% 5.04/2.18 # Condensation attempts : 0
% 5.04/2.18 # Condensation successes : 0
% 5.04/2.18 # Termbank termtop insertions : 5093
% 5.04/2.18
% 5.04/2.18 # -------------------------------------------------
% 5.04/2.18 # User time : 0.022 s
% 5.04/2.18 # System time : 0.003 s
% 5.04/2.18 # Total time : 0.025 s
% 5.04/2.18 # ...preprocessing : 0.017 s
% 5.04/2.18 # ...main loop : 0.009 s
% 5.04/2.18 # Maximum resident set size: 7132 pages
% 5.04/2.18
%------------------------------------------------------------------------------