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

View Problem - Process Solution

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

% Computer : n002.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:40:57 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
    ( neq(sk2,nil)
    | neq(sk2,nil) ),
    file('/export/starexec/sandbox2/tmp/tmp.K4CPmzbtNd/E---3.1_25726.p',co1_7) ).

cnf(co1_18,negated_conjecture,
    ( ssList(sk7)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/tmp/tmp.K4CPmzbtNd/E---3.1_25726.p',co1_18) ).

cnf(co1_5,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/tmp/tmp.K4CPmzbtNd/E---3.1_25726.p',co1_5) ).

cnf(co1_17,negated_conjecture,
    ( ssList(sk6)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/tmp/tmp.K4CPmzbtNd/E---3.1_25726.p',co1_17) ).

cnf(co1_15,negated_conjecture,
    ( ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(app(X2,cons(X1,nil)),X3) != sk2
    | app(app(X3,cons(X1,nil)),X2) != sk1
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/tmp/tmp.K4CPmzbtNd/E---3.1_25726.p',co1_15) ).

cnf(co1_20,negated_conjecture,
    ( app(app(sk7,cons(sk5,nil)),sk6) = sk3
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/tmp/tmp.K4CPmzbtNd/E---3.1_25726.p',co1_20) ).

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

cnf(co1_19,negated_conjecture,
    ( app(app(sk6,cons(sk5,nil)),sk7) = sk4
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/tmp/tmp.K4CPmzbtNd/E---3.1_25726.p',co1_19) ).

cnf(co1_16,negated_conjecture,
    ( ssItem(sk5)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/tmp/tmp.K4CPmzbtNd/E---3.1_25726.p',co1_16) ).

cnf(c_0_9,negated_conjecture,
    neq(sk2,nil),
    inference(fof_simplification,[status(thm)],[co1_7]) ).

cnf(c_0_10,negated_conjecture,
    ( ssList(sk7)
    | ~ neq(sk4,nil) ),
    co1_18 ).

cnf(c_0_11,negated_conjecture,
    sk2 = sk4,
    co1_5 ).

cnf(c_0_12,negated_conjecture,
    ( ssList(sk6)
    | ~ neq(sk4,nil) ),
    co1_17 ).

cnf(c_0_13,negated_conjecture,
    ( ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(app(X2,cons(X1,nil)),X3) != sk2
    | app(app(X3,cons(X1,nil)),X2) != sk1
    | ~ neq(sk4,nil) ),
    co1_15 ).

cnf(c_0_14,negated_conjecture,
    neq(sk2,nil),
    c_0_9 ).

cnf(c_0_15,negated_conjecture,
    ( app(app(sk7,cons(sk5,nil)),sk6) = sk3
    | ~ neq(sk4,nil) ),
    co1_20 ).

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

cnf(c_0_17,negated_conjecture,
    ( app(app(sk6,cons(sk5,nil)),sk7) = sk4
    | ~ neq(sk4,nil) ),
    co1_19 ).

cnf(c_0_18,negated_conjecture,
    ( ssItem(sk5)
    | ~ neq(sk4,nil) ),
    co1_16 ).

cnf(c_0_19,negated_conjecture,
    ( ssList(sk7)
    | ~ neq(sk2,nil) ),
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_20,negated_conjecture,
    ( ssList(sk6)
    | ~ neq(sk2,nil) ),
    inference(rw,[status(thm)],[c_0_12,c_0_11]) ).

cnf(c_0_21,negated_conjecture,
    ( app(app(X1,cons(X2,nil)),X3) != sk1
    | app(app(X3,cons(X2,nil)),X1) != sk2
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ ssList(X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11]),c_0_14])]) ).

cnf(c_0_22,negated_conjecture,
    app(app(sk7,cons(sk5,nil)),sk6) = sk1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_11]),c_0_14])]) ).

cnf(c_0_23,negated_conjecture,
    app(app(sk6,cons(sk5,nil)),sk7) = sk2,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_11]),c_0_11]),c_0_14])]) ).

cnf(c_0_24,negated_conjecture,
    ssItem(sk5),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_11]),c_0_14])]) ).

cnf(c_0_25,negated_conjecture,
    ssList(sk7),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_14])]) ).

cnf(c_0_26,negated_conjecture,
    ssList(sk6),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_14])]) ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),c_0_25]),c_0_26])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14  % Problem    : SWC422-1 : TPTP v8.1.2. Released v2.4.0.
% 0.15/0.15  % Command    : run_E %s %d THM
% 0.15/0.36  % Computer : n002.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 2400
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Tue Oct  3 02:16:30 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.23/0.51  Running first-order theorem proving
% 0.23/0.51  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.K4CPmzbtNd/E---3.1_25726.p
% 0.23/0.53  # Version: 3.1pre001
% 0.23/0.53  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53  # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53  # Starting sh5l with 300s (1) cores
% 0.23/0.53  # new_bool_3 with pid 25807 completed with status 0
% 0.23/0.53  # Result found by new_bool_3
% 0.23/0.53  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.53  # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.23/0.53  # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.23/0.53  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.23/0.53  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 25810 completed with status 0
% 0.23/0.53  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.53  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.53  # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.23/0.53  # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.23/0.53  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.23/0.53  # Preprocessing time       : 0.003 s
% 0.23/0.53  # Presaturation interreduction done
% 0.23/0.53  
% 0.23/0.53  # Proof found!
% 0.23/0.53  # SZS status Unsatisfiable
% 0.23/0.53  # SZS output start CNFRefutation
% See solution above
% 0.23/0.53  # Parsed axioms                        : 205
% 0.23/0.53  # Removed by relevancy pruning/SinE    : 164
% 0.23/0.53  # Initial clauses                      : 41
% 0.23/0.53  # Removed in clause preprocessing      : 0
% 0.23/0.53  # Initial clauses in saturation        : 41
% 0.23/0.53  # Processed clauses                    : 94
% 0.23/0.53  # ...of these trivial                  : 9
% 0.23/0.53  # ...subsumed                          : 0
% 0.23/0.53  # ...remaining for further processing  : 85
% 0.23/0.53  # Other redundant clauses eliminated   : 8
% 0.23/0.53  # Clauses deleted for lack of memory   : 0
% 0.23/0.53  # Backward-subsumed                    : 4
% 0.23/0.53  # Backward-rewritten                   : 2
% 0.23/0.53  # Generated clauses                    : 122
% 0.23/0.53  # ...of the previous two non-redundant : 104
% 0.23/0.53  # ...aggressively subsumed             : 0
% 0.23/0.53  # Contextual simplify-reflections      : 0
% 0.23/0.53  # Paramodulations                      : 113
% 0.23/0.53  # Factorizations                       : 0
% 0.23/0.53  # NegExts                              : 0
% 0.23/0.53  # Equation resolutions                 : 10
% 0.23/0.53  # Total rewrite steps                  : 114
% 0.23/0.53  # Propositional unsat checks           : 0
% 0.23/0.53  #    Propositional check models        : 0
% 0.23/0.53  #    Propositional check unsatisfiable : 0
% 0.23/0.53  #    Propositional clauses             : 0
% 0.23/0.53  #    Propositional clauses after purity: 0
% 0.23/0.53  #    Propositional unsat core size     : 0
% 0.23/0.53  #    Propositional preprocessing time  : 0.000
% 0.23/0.53  #    Propositional encoding time       : 0.000
% 0.23/0.53  #    Propositional solver time         : 0.000
% 0.23/0.53  #    Success case prop preproc time    : 0.000
% 0.23/0.53  #    Success case prop encoding time   : 0.000
% 0.23/0.53  #    Success case prop solver time     : 0.000
% 0.23/0.53  # Current number of processed clauses  : 44
% 0.23/0.53  #    Positive orientable unit clauses  : 12
% 0.23/0.53  #    Positive unorientable unit clauses: 0
% 0.23/0.53  #    Negative unit clauses             : 0
% 0.23/0.53  #    Non-unit-clauses                  : 32
% 0.23/0.53  # Current number of unprocessed clauses: 78
% 0.23/0.53  # ...number of literals in the above   : 319
% 0.23/0.53  # Current number of archived formulas  : 0
% 0.23/0.53  # Current number of archived clauses   : 38
% 0.23/0.53  # Clause-clause subsumption calls (NU) : 207
% 0.23/0.53  # Rec. Clause-clause subsumption calls : 102
% 0.23/0.53  # Non-unit clause-clause subsumptions  : 4
% 0.23/0.53  # Unit Clause-clause subsumption calls : 0
% 0.23/0.53  # Rewrite failures with RHS unbound    : 0
% 0.23/0.53  # BW rewrite match attempts            : 1
% 0.23/0.53  # BW rewrite match successes           : 1
% 0.23/0.53  # Condensation attempts                : 0
% 0.23/0.53  # Condensation successes               : 0
% 0.23/0.53  # Termbank termtop insertions          : 4584
% 0.23/0.53  
% 0.23/0.53  # -------------------------------------------------
% 0.23/0.53  # User time                : 0.006 s
% 0.23/0.53  # System time              : 0.005 s
% 0.23/0.53  # Total time               : 0.011 s
% 0.23/0.53  # Maximum resident set size: 2024 pages
% 0.23/0.53  
% 0.23/0.53  # -------------------------------------------------
% 0.23/0.53  # User time                : 0.012 s
% 0.23/0.53  # System time              : 0.006 s
% 0.23/0.53  # Total time               : 0.018 s
% 0.23/0.53  # Maximum resident set size: 1860 pages
% 0.23/0.53  % E---3.1 exiting
% 0.23/0.53  % E---3.1 exiting
%------------------------------------------------------------------------------