TSTP Solution File: REL046+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : REL046+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n026.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 : Mon Jul 18 19:13:54 EDT 2022

% Result   : Theorem 8.38s 2.47s
% Output   : CNFRefutation 8.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   17 (  14 unt;   0 nHn;   8 RR)
%            Number of literals    :   20 (  19 equ;   7 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   19 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_13,plain,
    join(join(X1,X2),X3) = join(X1,join(X2,X3)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rss0k35g/input.p',i_0_13) ).

cnf(i_0_11,negated_conjecture,
    join(esk1_0,complement(join(complement(esk2_0),complement(esk3_0)))) = complement(join(complement(esk2_0),complement(esk3_0))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rss0k35g/input.p',i_0_11) ).

cnf(i_0_14,plain,
    join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rss0k35g/input.p',i_0_14) ).

cnf(i_0_12,plain,
    join(X1,X2) = join(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rss0k35g/input.p',i_0_12) ).

cnf(i_0_10,negated_conjecture,
    ( join(esk1_0,esk2_0) != esk2_0
    | join(esk1_0,esk3_0) != esk3_0 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rss0k35g/input.p',i_0_10) ).

cnf(c_0_20,plain,
    join(join(X1,X2),X3) = join(X1,join(X2,X3)),
    i_0_13 ).

cnf(c_0_21,negated_conjecture,
    join(esk1_0,complement(join(complement(esk2_0),complement(esk3_0)))) = complement(join(complement(esk2_0),complement(esk3_0))),
    i_0_11 ).

cnf(c_0_22,plain,
    join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))) = X1,
    i_0_14 ).

cnf(c_0_23,plain,
    join(X1,X2) = join(X2,X1),
    i_0_12 ).

cnf(c_0_24,negated_conjecture,
    ( join(esk1_0,esk2_0) != esk2_0
    | join(esk1_0,esk3_0) != esk3_0 ),
    i_0_10 ).

cnf(c_0_25,negated_conjecture,
    join(esk1_0,join(complement(join(complement(esk2_0),complement(esk3_0))),X1)) = join(complement(join(complement(esk2_0),complement(esk3_0))),X1),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_26,plain,
    join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
    inference(rw,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,negated_conjecture,
    ( join(esk2_0,esk1_0) != esk2_0
    | join(esk3_0,esk1_0) != esk3_0 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_23]),c_0_23]) ).

cnf(c_0_28,plain,
    join(esk2_0,esk1_0) = esk2_0,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_23]) ).

cnf(c_0_29,plain,
    join(complement(join(X1,complement(X2))),complement(join(complement(X2),complement(X1)))) = X2,
    inference(spm,[status(thm)],[c_0_26,c_0_23]) ).

cnf(c_0_30,negated_conjecture,
    join(esk3_0,esk1_0) != esk3_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).

cnf(c_0_31,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_29]),c_0_23]),c_0_30]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : REL046+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n026.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.34  % DateTime : Fri Jul  8 10:49:26 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected SinE mode:
% 0.18/0.45  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.38/2.47  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.38/2.47  # Version: 2.1pre011
% 8.38/2.47  # Preprocessing time       : 0.010 s
% 8.38/2.47  
% 8.38/2.47  # Proof found!
% 8.38/2.47  # SZS status Theorem
% 8.38/2.47  # SZS output start CNFRefutation
% See solution above
% 8.38/2.47  # Proof object total steps             : 17
% 8.38/2.47  # Proof object clause steps            : 12
% 8.38/2.47  # Proof object formula steps           : 5
% 8.38/2.47  # Proof object conjectures             : 8
% 8.38/2.47  # Proof object clause conjectures      : 6
% 8.38/2.47  # Proof object formula conjectures     : 2
% 8.38/2.47  # Proof object initial clauses used    : 5
% 8.38/2.47  # Proof object initial formulas used   : 5
% 8.38/2.47  # Proof object generating inferences   : 4
% 8.38/2.47  # Proof object simplifying inferences  : 8
% 8.38/2.47  # Training examples: 0 positive, 0 negative
% 8.38/2.47  # Parsed axioms                        : 14
% 8.38/2.47  # Removed by relevancy pruning/SinE    : 0
% 8.38/2.47  # Initial clauses                      : 14
% 8.38/2.47  # Removed in clause preprocessing      : 0
% 8.38/2.47  # Initial clauses in saturation        : 14
% 8.38/2.47  # Processed clauses                    : 83
% 8.38/2.47  # ...of these trivial                  : 14
% 8.38/2.47  # ...subsumed                          : 18
% 8.38/2.47  # ...remaining for further processing  : 51
% 8.38/2.47  # Other redundant clauses eliminated   : 0
% 8.38/2.47  # Clauses deleted for lack of memory   : 0
% 8.38/2.47  # Backward-subsumed                    : 0
% 8.38/2.47  # Backward-rewritten                   : 7
% 8.38/2.47  # Generated clauses                    : 681
% 8.38/2.47  # ...of the previous two non-trivial   : 583
% 8.38/2.47  # Contextual simplify-reflections      : 0
% 8.38/2.47  # Paramodulations                      : 681
% 8.38/2.47  # Factorizations                       : 0
% 8.38/2.47  # Equation resolutions                 : 0
% 8.38/2.47  # Propositional unsat checks           : 0
% 8.38/2.47  # Propositional unsat check successes  : 0
% 8.38/2.47  # Current number of processed clauses  : 44
% 8.38/2.47  #    Positive orientable unit clauses  : 40
% 8.38/2.47  #    Positive unorientable unit clauses: 3
% 8.38/2.47  #    Negative unit clauses             : 1
% 8.38/2.47  #    Non-unit-clauses                  : 0
% 8.38/2.47  # Current number of unprocessed clauses: 465
% 8.38/2.47  # ...number of literals in the above   : 465
% 8.38/2.47  # Current number of archived formulas  : 0
% 8.38/2.47  # Current number of archived clauses   : 7
% 8.38/2.47  # Clause-clause subsumption calls (NU) : 0
% 8.38/2.47  # Rec. Clause-clause subsumption calls : 0
% 8.38/2.47  # Non-unit clause-clause subsumptions  : 0
% 8.38/2.47  # Unit Clause-clause subsumption calls : 5
% 8.38/2.47  # Rewrite failures with RHS unbound    : 0
% 8.38/2.47  # BW rewrite match attempts            : 61
% 8.38/2.47  # BW rewrite match successes           : 35
% 8.38/2.47  # Condensation attempts                : 0
% 8.38/2.47  # Condensation successes               : 0
% 8.38/2.47  # Termbank termtop insertions          : 8076
% 8.38/2.47  
% 8.38/2.47  # -------------------------------------------------
% 8.38/2.47  # User time                : 0.011 s
% 8.38/2.47  # System time              : 0.005 s
% 8.38/2.47  # Total time               : 0.016 s
% 8.38/2.47  # ...preprocessing         : 0.010 s
% 8.38/2.47  # ...main loop             : 0.006 s
% 8.38/2.47  # Maximum resident set size: 7132 pages
% 8.38/2.47  
%------------------------------------------------------------------------------