TSTP Solution File: SWC102+1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SWC102+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n018.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:39:21 EDT 2023

% Result   : Theorem 0.24s 0.55s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   16 (   9 unt;   0 def)
%            Number of atoms       :   47 (  13 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   47 (  16   ~;  12   |;  10   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   11 (   0 sgn;  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | X4 != X3
                    | ~ neq(X2,nil)
                    | ( neq(X1,nil)
                      & frontsegP(X2,X1) ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.Schd6dQAxp/E---3.1_12883.p',co1) ).

fof(ax42,axiom,
    ! [X1] :
      ( ssList(X1)
     => frontsegP(X1,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.Schd6dQAxp/E---3.1_12883.p',ax42) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | X4 != X3
                      | ~ neq(X2,nil)
                      | ( neq(X1,nil)
                        & frontsegP(X2,X1) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).

fof(c_0_3,negated_conjecture,
    ( ssList(esk1_0)
    & ssList(esk2_0)
    & ssList(esk3_0)
    & ssList(esk4_0)
    & esk2_0 = esk4_0
    & esk1_0 = esk3_0
    & esk4_0 = esk3_0
    & neq(esk2_0,nil)
    & ( ~ neq(esk1_0,nil)
      | ~ frontsegP(esk2_0,esk1_0) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

cnf(c_0_4,negated_conjecture,
    esk4_0 = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_5,negated_conjecture,
    esk1_0 = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    esk2_0 = esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_7,negated_conjecture,
    neq(esk2_0,nil),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_8,negated_conjecture,
    esk2_0 = esk1_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    ( ~ neq(esk1_0,nil)
    | ~ frontsegP(esk2_0,esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_10,negated_conjecture,
    neq(esk1_0,nil),
    inference(rw,[status(thm)],[c_0_7,c_0_8]) ).

fof(c_0_11,plain,
    ! [X20] :
      ( ~ ssList(X20)
      | frontsegP(X20,X20) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax42])]) ).

cnf(c_0_12,negated_conjecture,
    ~ frontsegP(esk1_0,esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_8])]) ).

cnf(c_0_13,plain,
    ( frontsegP(X1,X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    ssList(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.15  % Problem    : SWC102+1 : TPTP v8.1.2. Released v2.4.0.
% 0.14/0.16  % Command    : run_E %s %d THM
% 0.17/0.37  % Computer : n018.cluster.edu
% 0.17/0.37  % Model    : x86_64 x86_64
% 0.17/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37  % Memory   : 8042.1875MB
% 0.17/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37  % CPULimit   : 2400
% 0.17/0.37  % WCLimit    : 300
% 0.17/0.37  % DateTime   : Tue Oct  3 02:03:09 EDT 2023
% 0.17/0.38  % CPUTime    : 
% 0.24/0.53  Running first-order theorem proving
% 0.24/0.53  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.Schd6dQAxp/E---3.1_12883.p
% 0.24/0.55  # Version: 3.1pre001
% 0.24/0.55  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.24/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.24/0.55  # Starting sh5l with 300s (1) cores
% 0.24/0.55  # new_bool_3 with pid 12962 completed with status 0
% 0.24/0.55  # Result found by new_bool_3
% 0.24/0.55  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.24/0.55  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.55  # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.24/0.55  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.55  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.24/0.55  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 12965 completed with status 0
% 0.24/0.55  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.24/0.55  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.24/0.55  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.55  # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.24/0.55  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.55  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.24/0.55  # Preprocessing time       : 0.002 s
% 0.24/0.55  # Presaturation interreduction done
% 0.24/0.55  
% 0.24/0.55  # Proof found!
% 0.24/0.55  # SZS status Theorem
% 0.24/0.55  # SZS output start CNFRefutation
% See solution above
% 0.24/0.55  # Parsed axioms                        : 96
% 0.24/0.55  # Removed by relevancy pruning/SinE    : 69
% 0.24/0.55  # Initial clauses                      : 49
% 0.24/0.55  # Removed in clause preprocessing      : 0
% 0.24/0.55  # Initial clauses in saturation        : 49
% 0.24/0.55  # Processed clauses                    : 73
% 0.24/0.55  # ...of these trivial                  : 3
% 0.24/0.55  # ...subsumed                          : 0
% 0.24/0.55  # ...remaining for further processing  : 70
% 0.24/0.55  # Other redundant clauses eliminated   : 7
% 0.24/0.55  # Clauses deleted for lack of memory   : 0
% 0.24/0.55  # Backward-subsumed                    : 0
% 0.24/0.55  # Backward-rewritten                   : 1
% 0.24/0.55  # Generated clauses                    : 7
% 0.24/0.55  # ...of the previous two non-redundant : 7
% 0.24/0.55  # ...aggressively subsumed             : 0
% 0.24/0.55  # Contextual simplify-reflections      : 1
% 0.24/0.55  # Paramodulations                      : 1
% 0.24/0.55  # Factorizations                       : 0
% 0.24/0.55  # NegExts                              : 0
% 0.24/0.55  # Equation resolutions                 : 7
% 0.24/0.55  # Total rewrite steps                  : 16
% 0.24/0.55  # Propositional unsat checks           : 0
% 0.24/0.55  #    Propositional check models        : 0
% 0.24/0.55  #    Propositional check unsatisfiable : 0
% 0.24/0.55  #    Propositional clauses             : 0
% 0.24/0.55  #    Propositional clauses after purity: 0
% 0.24/0.55  #    Propositional unsat core size     : 0
% 0.24/0.55  #    Propositional preprocessing time  : 0.000
% 0.24/0.55  #    Propositional encoding time       : 0.000
% 0.24/0.55  #    Propositional solver time         : 0.000
% 0.24/0.55  #    Success case prop preproc time    : 0.000
% 0.24/0.55  #    Success case prop encoding time   : 0.000
% 0.24/0.55  #    Success case prop solver time     : 0.000
% 0.24/0.55  # Current number of processed clauses  : 17
% 0.24/0.55  #    Positive orientable unit clauses  : 10
% 0.24/0.55  #    Positive unorientable unit clauses: 0
% 0.24/0.55  #    Negative unit clauses             : 2
% 0.24/0.55  #    Non-unit-clauses                  : 5
% 0.24/0.55  # Current number of unprocessed clauses: 29
% 0.24/0.55  # ...number of literals in the above   : 118
% 0.24/0.55  # Current number of archived formulas  : 0
% 0.24/0.55  # Current number of archived clauses   : 47
% 0.24/0.55  # Clause-clause subsumption calls (NU) : 338
% 0.24/0.55  # Rec. Clause-clause subsumption calls : 73
% 0.24/0.55  # Non-unit clause-clause subsumptions  : 1
% 0.24/0.55  # Unit Clause-clause subsumption calls : 1
% 0.24/0.55  # Rewrite failures with RHS unbound    : 0
% 0.24/0.55  # BW rewrite match attempts            : 1
% 0.24/0.55  # BW rewrite match successes           : 1
% 0.24/0.55  # Condensation attempts                : 0
% 0.24/0.55  # Condensation successes               : 0
% 0.24/0.55  # Termbank termtop insertions          : 4371
% 0.24/0.55  
% 0.24/0.55  # -------------------------------------------------
% 0.24/0.55  # User time                : 0.008 s
% 0.24/0.55  # System time              : 0.003 s
% 0.24/0.55  # Total time               : 0.010 s
% 0.24/0.55  # Maximum resident set size: 1916 pages
% 0.24/0.55  
% 0.24/0.55  # -------------------------------------------------
% 0.24/0.55  # User time                : 0.012 s
% 0.24/0.55  # System time              : 0.004 s
% 0.24/0.55  # Total time               : 0.016 s
% 0.24/0.55  # Maximum resident set size: 1796 pages
% 0.24/0.55  % E---3.1 exiting
% 0.24/0.55  % E---3.1 exiting
%------------------------------------------------------------------------------