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

View Problem - Process Solution

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

% Computer : n010.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 : Wed Jul 20 17:47:09 EDT 2022

% Result   : Theorem 8.12s 2.48s
% Output   : CNFRefutation 8.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   18 (  10 unt;   2 nHn;  13 RR)
%            Number of literals    :   30 (   7 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   37 (  13 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_20,negated_conjecture,
    ~ pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ar22l0he/input.p',i_0_20) ).

cnf(i_0_9,plain,
    ( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
    | ~ pair_in_list(X1,X4,X5) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ar22l0he/input.p',i_0_9) ).

cnf(i_0_22,negated_conjecture,
    ( pair_in_list(esk1_0,X1,esk2_1(X1))
    | ~ contains_slb(esk1_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ar22l0he/input.p',i_0_22) ).

cnf(i_0_6,plain,
    ( X1 = X2
    | contains_slb(X3,X2)
    | ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ar22l0he/input.p',i_0_6) ).

cnf(i_0_21,negated_conjecture,
    contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ar22l0he/input.p',i_0_21) ).

cnf(i_0_8,plain,
    ( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
    | X3 != X5
    | X2 != X4 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ar22l0he/input.p',i_0_8) ).

cnf(c_0_29,negated_conjecture,
    ~ pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0,X1),
    i_0_20 ).

cnf(c_0_30,plain,
    ( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
    | ~ pair_in_list(X1,X4,X5) ),
    i_0_9 ).

cnf(c_0_31,negated_conjecture,
    ~ pair_in_list(esk1_0,esk3_0,X1),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_32,negated_conjecture,
    ( pair_in_list(esk1_0,X1,esk2_1(X1))
    | ~ contains_slb(esk1_0,X1) ),
    i_0_22 ).

cnf(c_0_33,plain,
    ( X1 = X2
    | contains_slb(X3,X2)
    | ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2) ),
    i_0_6 ).

cnf(c_0_34,negated_conjecture,
    contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),
    i_0_21 ).

cnf(c_0_35,negated_conjecture,
    ~ contains_slb(esk1_0,esk3_0),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_36,negated_conjecture,
    esk3_0 = esk4_0,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).

cnf(c_0_37,plain,
    ( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
    | X3 != X5
    | X2 != X4 ),
    i_0_8 ).

cnf(c_0_38,negated_conjecture,
    ~ pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk4_0,X1),
    inference(rw,[status(thm)],[c_0_29,c_0_36]) ).

cnf(c_0_39,plain,
    pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_37])]) ).

cnf(c_0_40,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_38,c_0_39]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SWV411+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n010.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Wed Jun 15 23:14:10 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected SinE mode:
% 0.20/0.47  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.47  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.47  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.12/2.48  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.12/2.48  # Version: 2.1pre011
% 8.12/2.48  # Preprocessing time       : 0.012 s
% 8.12/2.48  
% 8.12/2.48  # Proof found!
% 8.12/2.48  # SZS status Theorem
% 8.12/2.48  # SZS output start CNFRefutation
% See solution above
% 8.12/2.48  # Proof object total steps             : 18
% 8.12/2.48  # Proof object clause steps            : 12
% 8.12/2.48  # Proof object formula steps           : 6
% 8.12/2.48  # Proof object conjectures             : 11
% 8.12/2.48  # Proof object clause conjectures      : 8
% 8.12/2.48  # Proof object formula conjectures     : 3
% 8.12/2.48  # Proof object initial clauses used    : 6
% 8.12/2.48  # Proof object initial formulas used   : 6
% 8.12/2.48  # Proof object generating inferences   : 4
% 8.12/2.48  # Proof object simplifying inferences  : 4
% 8.12/2.48  # Training examples: 0 positive, 0 negative
% 8.12/2.48  # Parsed axioms                        : 28
% 8.12/2.48  # Removed by relevancy pruning/SinE    : 0
% 8.12/2.48  # Initial clauses                      : 28
% 8.12/2.48  # Removed in clause preprocessing      : 0
% 8.12/2.48  # Initial clauses in saturation        : 28
% 8.12/2.48  # Processed clauses                    : 40
% 8.12/2.48  # ...of these trivial                  : 0
% 8.12/2.48  # ...subsumed                          : 2
% 8.12/2.48  # ...remaining for further processing  : 38
% 8.12/2.48  # Other redundant clauses eliminated   : 3
% 8.12/2.48  # Clauses deleted for lack of memory   : 0
% 8.12/2.48  # Backward-subsumed                    : 0
% 8.12/2.48  # Backward-rewritten                   : 4
% 8.12/2.48  # Generated clauses                    : 45
% 8.12/2.48  # ...of the previous two non-trivial   : 33
% 8.12/2.48  # Contextual simplify-reflections      : 1
% 8.12/2.48  # Paramodulations                      : 41
% 8.12/2.48  # Factorizations                       : 2
% 8.12/2.48  # Equation resolutions                 : 3
% 8.12/2.48  # Propositional unsat checks           : 0
% 8.12/2.48  # Propositional unsat check successes  : 0
% 8.12/2.48  # Current number of processed clauses  : 32
% 8.12/2.48  #    Positive orientable unit clauses  : 9
% 8.12/2.48  #    Positive unorientable unit clauses: 0
% 8.12/2.48  #    Negative unit clauses             : 6
% 8.12/2.48  #    Non-unit-clauses                  : 17
% 8.12/2.48  # Current number of unprocessed clauses: 21
% 8.12/2.48  # ...number of literals in the above   : 62
% 8.12/2.48  # Current number of archived formulas  : 0
% 8.12/2.48  # Current number of archived clauses   : 4
% 8.12/2.48  # Clause-clause subsumption calls (NU) : 29
% 8.12/2.48  # Rec. Clause-clause subsumption calls : 28
% 8.12/2.48  # Non-unit clause-clause subsumptions  : 2
% 8.12/2.48  # Unit Clause-clause subsumption calls : 42
% 8.12/2.48  # Rewrite failures with RHS unbound    : 0
% 8.12/2.48  # BW rewrite match attempts            : 10
% 8.12/2.48  # BW rewrite match successes           : 1
% 8.12/2.48  # Condensation attempts                : 0
% 8.12/2.48  # Condensation successes               : 0
% 8.12/2.48  # Termbank termtop insertions          : 958
% 8.12/2.48  
% 8.12/2.48  # -------------------------------------------------
% 8.12/2.48  # User time                : 0.009 s
% 8.12/2.48  # System time              : 0.004 s
% 8.12/2.48  # Total time               : 0.013 s
% 8.12/2.48  # ...preprocessing         : 0.012 s
% 8.12/2.48  # ...main loop             : 0.001 s
% 8.12/2.48  # Maximum resident set size: 7136 pages
% 8.12/2.48  
%------------------------------------------------------------------------------