TSTP Solution File: SWC198-1 by E---3.1

View Problem - Process Solution

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

% Computer : n028.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:50 EDT 2023

% Result   : Unsatisfiable 0.17s 0.53s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   28 (   9 unt;   9 nHn;  28 RR)
%            Number of literals    :   58 (  19 equ;  26 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   19 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause161,axiom,
    ( memberP(X2,X3)
    | X3 = X1
    | ~ memberP(cons(X1,X2),X3)
    | ~ ssList(X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.fj3rOiToSP/E---3.1_21985.p',clause161) ).

cnf(co1_15,negated_conjecture,
    ( cons(sk6,nil) = sk3
    | nil = sk3 ),
    file('/export/starexec/sandbox2/tmp/tmp.fj3rOiToSP/E---3.1_21985.p',co1_15) ).

cnf(clause8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/tmp/tmp.fj3rOiToSP/E---3.1_21985.p',clause8) ).

cnf(co1_11,negated_conjecture,
    ( ssItem(sk6)
    | nil = sk3 ),
    file('/export/starexec/sandbox2/tmp/tmp.fj3rOiToSP/E---3.1_21985.p',co1_11) ).

cnf(clause71,axiom,
    ( ~ memberP(nil,X1)
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.fj3rOiToSP/E---3.1_21985.p',clause71) ).

cnf(co1_8,negated_conjecture,
    ( memberP(sk1,sk5(X1))
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.fj3rOiToSP/E---3.1_21985.p',co1_8) ).

cnf(co1_6,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox2/tmp/tmp.fj3rOiToSP/E---3.1_21985.p',co1_6) ).

cnf(co1_7,negated_conjecture,
    ( ssItem(sk5(X1))
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.fj3rOiToSP/E---3.1_21985.p',co1_7) ).

cnf(co1_9,negated_conjecture,
    ( ~ ssItem(X1)
    | X1 != sk5(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.fj3rOiToSP/E---3.1_21985.p',co1_9) ).

cnf(clause9,axiom,
    ssItem(skac3),
    file('/export/starexec/sandbox2/tmp/tmp.fj3rOiToSP/E---3.1_21985.p',clause9) ).

cnf(c_0_10,axiom,
    ( memberP(X2,X3)
    | X3 = X1
    | ~ memberP(cons(X1,X2),X3)
    | ~ ssList(X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3) ),
    clause161 ).

cnf(c_0_11,negated_conjecture,
    ( cons(sk6,nil) = sk3
    | nil = sk3 ),
    co1_15 ).

cnf(c_0_12,axiom,
    ssList(nil),
    clause8 ).

cnf(c_0_13,negated_conjecture,
    ( ssItem(sk6)
    | nil = sk3 ),
    co1_11 ).

cnf(c_0_14,axiom,
    ( ~ memberP(nil,X1)
    | ~ ssItem(X1) ),
    clause71 ).

cnf(c_0_15,negated_conjecture,
    ( memberP(sk1,sk5(X1))
    | ~ ssItem(X1) ),
    co1_8 ).

cnf(c_0_16,negated_conjecture,
    sk1 = sk3,
    co1_6 ).

cnf(c_0_17,negated_conjecture,
    ( sk3 = nil
    | sk6 = X1
    | ~ memberP(sk3,X1)
    | ~ ssItem(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]),c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    ( memberP(sk3,sk5(X1))
    | ~ ssItem(X1) ),
    inference(rw,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    ( ssItem(sk5(X1))
    | ~ ssItem(X1) ),
    co1_7 ).

cnf(c_0_20,negated_conjecture,
    ( sk5(X1) = sk6
    | sk3 = nil
    | ~ ssItem(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

cnf(c_0_21,negated_conjecture,
    ( ~ ssItem(X1)
    | X1 != sk5(X1) ),
    co1_9 ).

cnf(c_0_22,negated_conjecture,
    ( sk5(sk6) = sk6
    | sk3 = nil ),
    inference(spm,[status(thm)],[c_0_20,c_0_13]) ).

cnf(c_0_23,negated_conjecture,
    sk3 = nil,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_13]) ).

cnf(c_0_24,negated_conjecture,
    ( memberP(nil,sk5(X1))
    | ~ ssItem(X1) ),
    inference(rw,[status(thm)],[c_0_18,c_0_23]) ).

cnf(c_0_25,axiom,
    ssItem(skac3),
    clause9 ).

cnf(c_0_26,negated_conjecture,
    ~ ssItem(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_24]),c_0_19]) ).

cnf(c_0_27,plain,
    $false,
    inference(sr,[status(thm)],[c_0_25,c_0_26]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SWC198-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.12  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n028.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 2400
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Tue Oct  3 02:19:07 EDT 2023
% 0.11/0.32  % CPUTime    : 
% 0.17/0.44  Running first-order theorem proving
% 0.17/0.44  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.fj3rOiToSP/E---3.1_21985.p
% 0.17/0.53  # Version: 3.1pre001
% 0.17/0.53  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.53  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.53  # Starting sh5l with 300s (1) cores
% 0.17/0.53  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 22063 completed with status 0
% 0.17/0.53  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.53  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.53  # No SInE strategy applied
% 0.17/0.53  # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.17/0.53  # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.53  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.17/0.53  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.53  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.17/0.53  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.17/0.53  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.17/0.53  # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 22072 completed with status 0
% 0.17/0.53  # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.17/0.53  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.53  # No SInE strategy applied
% 0.17/0.53  # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.17/0.53  # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.53  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.17/0.53  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.53  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.17/0.53  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.17/0.53  # Preprocessing time       : 0.004 s
% 0.17/0.53  
% 0.17/0.53  # Proof found!
% 0.17/0.53  # SZS status Unsatisfiable
% 0.17/0.53  # SZS output start CNFRefutation
% See solution above
% 0.17/0.53  # Parsed axioms                        : 202
% 0.17/0.53  # Removed by relevancy pruning/SinE    : 0
% 0.17/0.53  # Initial clauses                      : 202
% 0.17/0.53  # Removed in clause preprocessing      : 0
% 0.17/0.53  # Initial clauses in saturation        : 202
% 0.17/0.53  # Processed clauses                    : 466
% 0.17/0.53  # ...of these trivial                  : 12
% 0.17/0.53  # ...subsumed                          : 93
% 0.17/0.53  # ...remaining for further processing  : 361
% 0.17/0.53  # Other redundant clauses eliminated   : 31
% 0.17/0.53  # Clauses deleted for lack of memory   : 0
% 0.17/0.53  # Backward-subsumed                    : 83
% 0.17/0.53  # Backward-rewritten                   : 99
% 0.17/0.53  # Generated clauses                    : 2257
% 0.17/0.53  # ...of the previous two non-redundant : 2118
% 0.17/0.53  # ...aggressively subsumed             : 0
% 0.17/0.53  # Contextual simplify-reflections      : 62
% 0.17/0.53  # Paramodulations                      : 2119
% 0.17/0.53  # Factorizations                       : 39
% 0.17/0.53  # NegExts                              : 0
% 0.17/0.53  # Equation resolutions                 : 61
% 0.17/0.53  # Total rewrite steps                  : 980
% 0.17/0.53  # Propositional unsat checks           : 0
% 0.17/0.53  #    Propositional check models        : 0
% 0.17/0.53  #    Propositional check unsatisfiable : 0
% 0.17/0.53  #    Propositional clauses             : 0
% 0.17/0.53  #    Propositional clauses after purity: 0
% 0.17/0.53  #    Propositional unsat core size     : 0
% 0.17/0.53  #    Propositional preprocessing time  : 0.000
% 0.17/0.53  #    Propositional encoding time       : 0.000
% 0.17/0.53  #    Propositional solver time         : 0.000
% 0.17/0.53  #    Success case prop preproc time    : 0.000
% 0.17/0.53  #    Success case prop encoding time   : 0.000
% 0.17/0.53  #    Success case prop solver time     : 0.000
% 0.17/0.53  # Current number of processed clauses  : 136
% 0.17/0.53  #    Positive orientable unit clauses  : 39
% 0.17/0.53  #    Positive unorientable unit clauses: 0
% 0.17/0.53  #    Negative unit clauses             : 3
% 0.17/0.53  #    Non-unit-clauses                  : 94
% 0.17/0.53  # Current number of unprocessed clauses: 1775
% 0.17/0.53  # ...number of literals in the above   : 8203
% 0.17/0.53  # Current number of archived formulas  : 0
% 0.17/0.53  # Current number of archived clauses   : 220
% 0.17/0.53  # Clause-clause subsumption calls (NU) : 13713
% 0.17/0.53  # Rec. Clause-clause subsumption calls : 1789
% 0.17/0.53  # Non-unit clause-clause subsumptions  : 157
% 0.17/0.53  # Unit Clause-clause subsumption calls : 205
% 0.17/0.53  # Rewrite failures with RHS unbound    : 0
% 0.17/0.53  # BW rewrite match attempts            : 2
% 0.17/0.53  # BW rewrite match successes           : 2
% 0.17/0.53  # Condensation attempts                : 0
% 0.17/0.53  # Condensation successes               : 0
% 0.17/0.53  # Termbank termtop insertions          : 42139
% 0.17/0.53  
% 0.17/0.53  # -------------------------------------------------
% 0.17/0.53  # User time                : 0.062 s
% 0.17/0.53  # System time              : 0.010 s
% 0.17/0.53  # Total time               : 0.072 s
% 0.17/0.53  # Maximum resident set size: 2112 pages
% 0.17/0.53  
% 0.17/0.53  # -------------------------------------------------
% 0.17/0.53  # User time                : 0.321 s
% 0.17/0.53  # System time              : 0.033 s
% 0.17/0.53  # Total time               : 0.354 s
% 0.17/0.53  # Maximum resident set size: 1852 pages
% 0.17/0.53  % E---3.1 exiting
% 0.17/0.53  % E---3.1 exiting
%------------------------------------------------------------------------------