TSTP Solution File: SWC370-1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SWC370-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n024.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  : 300s
% DateTime : Tue May 21 04:26:08 EDT 2024

% Result   : Unsatisfiable 0.82s 0.57s
% Output   : CNFRefutation 0.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   29 (  18 unt;   0 nHn;  29 RR)
%            Number of literals    :   59 (  12 equ;  34 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   26 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause173,axiom,
    ( segmentP(X4,X2)
    | app(app(X1,X2),X3) != X4
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).

cnf(clause74,axiom,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).

cnf(clause85,axiom,
    ( ssList(app(X2,X1))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).

cnf(co1_11,negated_conjecture,
    ~ segmentP(sk2,sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).

cnf(clause8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).

cnf(co1_1,negated_conjecture,
    ssList(sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).

cnf(co1_6,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).

cnf(co1_5,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).

cnf(co1_8,negated_conjecture,
    app(sk3,sk5) = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

cnf(co1_7,negated_conjecture,
    ssList(sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

cnf(c_0_10,plain,
    ( segmentP(X4,X2)
    | app(app(X1,X2),X3) != X4
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X4) ),
    inference(fof_simplification,[status(thm)],[clause173]) ).

cnf(c_0_11,plain,
    ( segmentP(X4,X2)
    | app(app(X1,X2),X3) != X4
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X4) ),
    c_0_10 ).

cnf(c_0_12,plain,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    inference(fof_simplification,[status(thm)],[clause74]) ).

cnf(c_0_13,plain,
    ( ssList(app(X2,X1))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(fof_simplification,[status(thm)],[clause85]) ).

cnf(c_0_14,negated_conjecture,
    ~ segmentP(sk2,sk1),
    inference(fof_simplification,[status(thm)],[co1_11]) ).

cnf(c_0_15,plain,
    ( segmentP(app(app(X1,X2),X3),X2)
    | ~ ssList(app(app(X1,X2),X3))
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(er,[status(thm)],[c_0_11]) ).

cnf(c_0_16,plain,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    c_0_12 ).

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

cnf(c_0_18,plain,
    ( ssList(app(X2,X1))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    c_0_13 ).

cnf(c_0_19,negated_conjecture,
    ssList(sk1),
    co1_1 ).

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

cnf(c_0_21,negated_conjecture,
    ~ segmentP(sk2,sk1),
    c_0_14 ).

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

cnf(c_0_23,plain,
    ( segmentP(app(X1,X2),X1)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_18]) ).

cnf(c_0_24,negated_conjecture,
    app(sk3,sk5) = sk4,
    co1_8 ).

cnf(c_0_25,negated_conjecture,
    ssList(sk5),
    co1_7 ).

cnf(c_0_26,negated_conjecture,
    ssList(sk3),
    inference(rw,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_27,negated_conjecture,
    ~ segmentP(sk4,sk3),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_20]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWC370-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n024.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sun May 19 02:57:08 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  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/benchmark/theBenchmark.p
% 0.82/0.57  # Version: 3.1.0
% 0.82/0.57  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.82/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.57  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.82/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.82/0.57  # Starting new_bool_1 with 300s (1) cores
% 0.82/0.57  # Starting sh5l with 300s (1) cores
% 0.82/0.57  # new_bool_3 with pid 19992 completed with status 0
% 0.82/0.57  # Result found by new_bool_3
% 0.82/0.57  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.82/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.57  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.82/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.82/0.57  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.82/0.57  # Search class: FHHSF-FFMM22-MFFFFFNN
% 0.82/0.57  # partial match(1): FHHSF-FFMM22-SFFFFFNN
% 0.82/0.57  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.82/0.57  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.82/0.57  # SAT001_MinMin_p005000_rr_RG with pid 19995 completed with status 0
% 0.82/0.57  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.82/0.57  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.82/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.57  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.82/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.82/0.57  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.82/0.57  # Search class: FHHSF-FFMM22-MFFFFFNN
% 0.82/0.57  # partial match(1): FHHSF-FFMM22-SFFFFFNN
% 0.82/0.57  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.82/0.57  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.82/0.57  # Preprocessing time       : 0.002 s
% 0.82/0.57  # Presaturation interreduction done
% 0.82/0.57  
% 0.82/0.57  # Proof found!
% 0.82/0.57  # SZS status Unsatisfiable
% 0.82/0.57  # SZS output start CNFRefutation
% See solution above
% 0.82/0.57  # Parsed axioms                        : 197
% 0.82/0.57  # Removed by relevancy pruning/SinE    : 157
% 0.82/0.57  # Initial clauses                      : 40
% 0.82/0.57  # Removed in clause preprocessing      : 0
% 0.82/0.57  # Initial clauses in saturation        : 40
% 0.82/0.57  # Processed clauses                    : 831
% 0.82/0.57  # ...of these trivial                  : 23
% 0.82/0.57  # ...subsumed                          : 478
% 0.82/0.57  # ...remaining for further processing  : 330
% 0.82/0.57  # Other redundant clauses eliminated   : 15
% 0.82/0.57  # Clauses deleted for lack of memory   : 0
% 0.82/0.57  # Backward-subsumed                    : 39
% 0.82/0.57  # Backward-rewritten                   : 18
% 0.82/0.57  # Generated clauses                    : 2825
% 0.82/0.57  # ...of the previous two non-redundant : 2498
% 0.82/0.57  # ...aggressively subsumed             : 0
% 0.82/0.57  # Contextual simplify-reflections      : 50
% 0.82/0.57  # Paramodulations                      : 2809
% 0.82/0.57  # Factorizations                       : 0
% 0.82/0.57  # NegExts                              : 0
% 0.82/0.57  # Equation resolutions                 : 17
% 0.82/0.57  # Disequality decompositions           : 0
% 0.82/0.57  # Total rewrite steps                  : 2786
% 0.82/0.57  # ...of those cached                   : 2771
% 0.82/0.57  # Propositional unsat checks           : 0
% 0.82/0.57  #    Propositional check models        : 0
% 0.82/0.57  #    Propositional check unsatisfiable : 0
% 0.82/0.57  #    Propositional clauses             : 0
% 0.82/0.57  #    Propositional clauses after purity: 0
% 0.82/0.57  #    Propositional unsat core size     : 0
% 0.82/0.57  #    Propositional preprocessing time  : 0.000
% 0.82/0.57  #    Propositional encoding time       : 0.000
% 0.82/0.57  #    Propositional solver time         : 0.000
% 0.82/0.57  #    Success case prop preproc time    : 0.000
% 0.82/0.57  #    Success case prop encoding time   : 0.000
% 0.82/0.57  #    Success case prop solver time     : 0.000
% 0.82/0.57  # Current number of processed clauses  : 231
% 0.82/0.57  #    Positive orientable unit clauses  : 17
% 0.82/0.57  #    Positive unorientable unit clauses: 0
% 0.82/0.57  #    Negative unit clauses             : 12
% 0.82/0.57  #    Non-unit-clauses                  : 202
% 0.82/0.57  # Current number of unprocessed clauses: 1682
% 0.82/0.57  # ...number of literals in the above   : 9629
% 0.82/0.57  # Current number of archived formulas  : 0
% 0.82/0.57  # Current number of archived clauses   : 95
% 0.82/0.57  # Clause-clause subsumption calls (NU) : 12088
% 0.82/0.57  # Rec. Clause-clause subsumption calls : 3141
% 0.82/0.57  # Non-unit clause-clause subsumptions  : 454
% 0.82/0.57  # Unit Clause-clause subsumption calls : 769
% 0.82/0.57  # Rewrite failures with RHS unbound    : 0
% 0.82/0.57  # BW rewrite match attempts            : 5
% 0.82/0.57  # BW rewrite match successes           : 5
% 0.82/0.57  # Condensation attempts                : 0
% 0.82/0.57  # Condensation successes               : 0
% 0.82/0.57  # Termbank termtop insertions          : 50729
% 0.82/0.57  # Search garbage collected termcells   : 913
% 0.82/0.57  
% 0.82/0.57  # -------------------------------------------------
% 0.82/0.57  # User time                : 0.070 s
% 0.82/0.57  # System time              : 0.005 s
% 0.82/0.57  # Total time               : 0.075 s
% 0.82/0.57  # Maximum resident set size: 2072 pages
% 0.82/0.57  
% 0.82/0.57  # -------------------------------------------------
% 0.82/0.57  # User time                : 0.074 s
% 0.82/0.57  # System time              : 0.008 s
% 0.82/0.57  # Total time               : 0.081 s
% 0.82/0.57  # Maximum resident set size: 1892 pages
% 0.82/0.57  % E---3.1 exiting
% 0.82/0.57  % E exiting
%------------------------------------------------------------------------------