TSTP Solution File: MGT053+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT053+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:50 EDT 2022
% Result : Theorem 4.50s 2.24s
% Output : CNFRefutation 4.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of clauses : 27 ( 6 unt; 14 nHn; 19 RR)
% Number of literals : 63 ( 0 equ; 26 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 34 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( is_aligned(X1,X2)
| is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fm9opiu5/input.p',i_0_3) ).
cnf(i_0_6,negated_conjecture,
( dissimilar(esk1_0,esk2_0,esk3_0)
| dissimilar(esk1_0,esk3_0,esk2_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fm9opiu5/input.p',i_0_6) ).
cnf(i_0_5,plain,
( organization(X1)
| ~ dissimilar(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fm9opiu5/input.p',i_0_5) ).
cnf(i_0_2,plain,
( is_aligned(X1,X2)
| dissimilar(X1,X3,X2)
| ~ organization(X1)
| ~ is_aligned(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fm9opiu5/input.p',i_0_2) ).
cnf(i_0_4,plain,
( ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fm9opiu5/input.p',i_0_4) ).
cnf(i_0_1,plain,
( is_aligned(X1,X2)
| dissimilar(X1,X2,X3)
| ~ organization(X1)
| ~ is_aligned(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fm9opiu5/input.p',i_0_1) ).
cnf(i_0_7,negated_conjecture,
( ~ dissimilar(esk1_0,esk2_0,esk3_0)
| ~ dissimilar(esk1_0,esk3_0,esk2_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fm9opiu5/input.p',i_0_7) ).
cnf(c_0_15,plain,
( is_aligned(X1,X2)
| is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
i_0_3 ).
cnf(c_0_16,negated_conjecture,
( dissimilar(esk1_0,esk2_0,esk3_0)
| dissimilar(esk1_0,esk3_0,esk2_0) ),
i_0_6 ).
cnf(c_0_17,plain,
( organization(X1)
| ~ dissimilar(X1,X2,X3) ),
i_0_5 ).
cnf(c_0_18,plain,
( is_aligned(X1,X2)
| dissimilar(X1,X3,X2)
| ~ organization(X1)
| ~ is_aligned(X1,X3) ),
i_0_2 ).
cnf(c_0_19,negated_conjecture,
( is_aligned(esk1_0,esk3_0)
| is_aligned(esk1_0,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_15]) ).
cnf(c_0_20,negated_conjecture,
organization(esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_16]),c_0_17]) ).
cnf(c_0_21,plain,
( is_aligned(esk1_0,esk2_0)
| is_aligned(esk1_0,X1)
| dissimilar(esk1_0,esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_22,plain,
( ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
i_0_4 ).
cnf(c_0_23,plain,
( is_aligned(X1,X2)
| dissimilar(X1,X2,X3)
| ~ organization(X1)
| ~ is_aligned(X1,X3) ),
i_0_1 ).
cnf(c_0_24,plain,
( is_aligned(esk1_0,esk2_0)
| dissimilar(esk1_0,esk3_0,esk2_0) ),
inference(ef,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( ~ is_aligned(esk1_0,esk3_0)
| ~ is_aligned(esk1_0,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_16]),c_0_22]) ).
cnf(c_0_26,plain,
( is_aligned(esk1_0,X1)
| dissimilar(esk1_0,esk3_0,esk2_0)
| dissimilar(esk1_0,X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20])]) ).
cnf(c_0_27,negated_conjecture,
( ~ dissimilar(esk1_0,esk2_0,esk3_0)
| ~ dissimilar(esk1_0,esk3_0,esk2_0) ),
i_0_7 ).
cnf(c_0_28,negated_conjecture,
dissimilar(esk1_0,esk3_0,esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24]) ).
cnf(c_0_29,plain,
( is_aligned(esk1_0,esk2_0)
| is_aligned(esk1_0,X1)
| dissimilar(esk1_0,X1,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_19]),c_0_20])]) ).
cnf(c_0_30,negated_conjecture,
~ dissimilar(esk1_0,esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_31,plain,
is_aligned(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_29]),c_0_30]) ).
cnf(c_0_32,negated_conjecture,
~ is_aligned(esk1_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_31])]) ).
cnf(c_0_33,plain,
( is_aligned(esk1_0,X1)
| dissimilar(esk1_0,esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_31]),c_0_20])]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT053+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n024.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 : 600
% 0.14/0.34 % DateTime : Thu Jun 9 09:30:06 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 4.50/2.24 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 4.50/2.24 # Version: 2.1pre011
% 4.50/2.24 # Preprocessing time : 0.011 s
% 4.50/2.24
% 4.50/2.24 # Proof found!
% 4.50/2.24 # SZS status Theorem
% 4.50/2.24 # SZS output start CNFRefutation
% See solution above
% 4.50/2.24 # Proof object total steps : 27
% 4.50/2.24 # Proof object clause steps : 20
% 4.50/2.24 # Proof object formula steps : 7
% 4.50/2.24 # Proof object conjectures : 11
% 4.50/2.24 # Proof object clause conjectures : 9
% 4.50/2.24 # Proof object formula conjectures : 2
% 4.50/2.24 # Proof object initial clauses used : 7
% 4.50/2.24 # Proof object initial formulas used : 7
% 4.50/2.24 # Proof object generating inferences : 11
% 4.50/2.24 # Proof object simplifying inferences : 18
% 4.50/2.24 # Training examples: 0 positive, 0 negative
% 4.50/2.24 # Parsed axioms : 7
% 4.50/2.24 # Removed by relevancy pruning/SinE : 0
% 4.50/2.24 # Initial clauses : 7
% 4.50/2.24 # Removed in clause preprocessing : 0
% 4.50/2.24 # Initial clauses in saturation : 7
% 4.50/2.24 # Processed clauses : 27
% 4.50/2.24 # ...of these trivial : 0
% 4.50/2.24 # ...subsumed : 5
% 4.50/2.24 # ...remaining for further processing : 22
% 4.50/2.24 # Other redundant clauses eliminated : 0
% 4.50/2.24 # Clauses deleted for lack of memory : 0
% 4.50/2.24 # Backward-subsumed : 4
% 4.50/2.24 # Backward-rewritten : 6
% 4.50/2.24 # Generated clauses : 53
% 4.50/2.24 # ...of the previous two non-trivial : 45
% 4.50/2.24 # Contextual simplify-reflections : 5
% 4.50/2.24 # Paramodulations : 45
% 4.50/2.24 # Factorizations : 8
% 4.50/2.24 # Equation resolutions : 0
% 4.50/2.24 # Propositional unsat checks : 0
% 4.50/2.24 # Propositional unsat check successes : 0
% 4.50/2.24 # Current number of processed clauses : 12
% 4.50/2.24 # Positive orientable unit clauses : 3
% 4.50/2.24 # Positive unorientable unit clauses: 0
% 4.50/2.24 # Negative unit clauses : 2
% 4.50/2.24 # Non-unit-clauses : 7
% 4.50/2.24 # Current number of unprocessed clauses: 1
% 4.50/2.24 # ...number of literals in the above : 2
% 4.50/2.24 # Current number of archived formulas : 0
% 4.50/2.24 # Current number of archived clauses : 10
% 4.50/2.24 # Clause-clause subsumption calls (NU) : 44
% 4.50/2.24 # Rec. Clause-clause subsumption calls : 31
% 4.50/2.24 # Non-unit clause-clause subsumptions : 10
% 4.50/2.24 # Unit Clause-clause subsumption calls : 7
% 4.50/2.24 # Rewrite failures with RHS unbound : 0
% 4.50/2.24 # BW rewrite match attempts : 3
% 4.50/2.24 # BW rewrite match successes : 2
% 4.50/2.24 # Condensation attempts : 0
% 4.50/2.24 # Condensation successes : 0
% 4.50/2.24 # Termbank termtop insertions : 766
% 4.50/2.24
% 4.50/2.24 # -------------------------------------------------
% 4.50/2.24 # User time : 0.007 s
% 4.50/2.24 # System time : 0.004 s
% 4.50/2.24 # Total time : 0.012 s
% 4.50/2.24 # ...preprocessing : 0.011 s
% 4.50/2.24 # ...main loop : 0.001 s
% 4.50/2.24 # Maximum resident set size: 7140 pages
% 4.50/2.24
%------------------------------------------------------------------------------