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

View Problem - Process Solution

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

% Computer : n009.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:39 EDT 2023

% Result   : Unsatisfiable 0.15s 0.43s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (  14 unt;   4 nHn;  20 RR)
%            Number of literals    :   28 (  12 equ;   9 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    2 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
    ~ rearsegP(sk2,sk1),
    file('/export/starexec/sandbox2/tmp/tmp.z0PGWXL0cU/E---3.1_27187.p',co1_7) ).

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

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

cnf(co1_11,negated_conjecture,
    ( nil = sk3
    | rearsegP(sk4,sk3) ),
    file('/export/starexec/sandbox2/tmp/tmp.z0PGWXL0cU/E---3.1_27187.p',co1_11) ).

cnf(co1_9,negated_conjecture,
    ( nil = sk4
    | rearsegP(sk4,sk3) ),
    file('/export/starexec/sandbox2/tmp/tmp.z0PGWXL0cU/E---3.1_27187.p',co1_9) ).

cnf(clause81,axiom,
    ( rearsegP(nil,X1)
    | nil != X1
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.z0PGWXL0cU/E---3.1_27187.p',clause81) ).

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

cnf(c_0_7,negated_conjecture,
    ~ rearsegP(sk2,sk1),
    co1_7 ).

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

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

cnf(c_0_10,negated_conjecture,
    ( nil = sk3
    | rearsegP(sk4,sk3) ),
    co1_11 ).

cnf(c_0_11,negated_conjecture,
    ~ rearsegP(sk4,sk3),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    sk3 = nil,
    inference(sr,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,negated_conjecture,
    ( nil = sk4
    | rearsegP(sk4,sk3) ),
    co1_9 ).

cnf(c_0_14,negated_conjecture,
    ~ rearsegP(sk4,nil),
    inference(rw,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    sk4 = nil,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_12]),c_0_14]) ).

cnf(c_0_16,axiom,
    ( rearsegP(nil,X1)
    | nil != X1
    | ~ ssList(X1) ),
    clause81 ).

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

cnf(c_0_18,negated_conjecture,
    ~ rearsegP(nil,nil),
    inference(rw,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_16]),c_0_17])]),c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SWC367-1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.12  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n009.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 2400
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Tue Oct  3 01:48:15 EDT 2023
% 0.10/0.31  % CPUTime    : 
% 0.15/0.42  Running first-order theorem proving
% 0.15/0.42  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.z0PGWXL0cU/E---3.1_27187.p
% 0.15/0.43  # Version: 3.1pre001
% 0.15/0.43  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43  # Starting sh5l with 300s (1) cores
% 0.15/0.43  # new_bool_3 with pid 27266 completed with status 0
% 0.15/0.43  # Result found by new_bool_3
% 0.15/0.43  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43  # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.15/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.43  # SAT001_MinMin_p005000_rr_RG with pid 27269 completed with status 0
% 0.15/0.43  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.43  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43  # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.15/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.43  # Preprocessing time       : 0.002 s
% 0.15/0.43  # Presaturation interreduction done
% 0.15/0.43  
% 0.15/0.43  # Proof found!
% 0.15/0.43  # SZS status Unsatisfiable
% 0.15/0.43  # SZS output start CNFRefutation
% See solution above
% 0.15/0.43  # Parsed axioms                        : 196
% 0.15/0.43  # Removed by relevancy pruning/SinE    : 156
% 0.15/0.43  # Initial clauses                      : 40
% 0.15/0.43  # Removed in clause preprocessing      : 0
% 0.15/0.43  # Initial clauses in saturation        : 40
% 0.15/0.43  # Processed clauses                    : 26
% 0.15/0.43  # ...of these trivial                  : 4
% 0.15/0.43  # ...subsumed                          : 0
% 0.15/0.43  # ...remaining for further processing  : 22
% 0.15/0.43  # Other redundant clauses eliminated   : 3
% 0.15/0.43  # Clauses deleted for lack of memory   : 0
% 0.15/0.43  # Backward-subsumed                    : 0
% 0.15/0.43  # Backward-rewritten                   : 6
% 0.15/0.43  # Generated clauses                    : 3
% 0.15/0.43  # ...of the previous two non-redundant : 6
% 0.15/0.43  # ...aggressively subsumed             : 0
% 0.15/0.43  # Contextual simplify-reflections      : 0
% 0.15/0.43  # Paramodulations                      : 0
% 0.15/0.43  # Factorizations                       : 0
% 0.15/0.43  # NegExts                              : 0
% 0.15/0.43  # Equation resolutions                 : 3
% 0.15/0.43  # Total rewrite steps                  : 20
% 0.15/0.43  # Propositional unsat checks           : 0
% 0.15/0.43  #    Propositional check models        : 0
% 0.15/0.43  #    Propositional check unsatisfiable : 0
% 0.15/0.43  #    Propositional clauses             : 0
% 0.15/0.43  #    Propositional clauses after purity: 0
% 0.15/0.43  #    Propositional unsat core size     : 0
% 0.15/0.43  #    Propositional preprocessing time  : 0.000
% 0.15/0.43  #    Propositional encoding time       : 0.000
% 0.15/0.43  #    Propositional solver time         : 0.000
% 0.15/0.43  #    Success case prop preproc time    : 0.000
% 0.15/0.43  #    Success case prop encoding time   : 0.000
% 0.15/0.43  #    Success case prop solver time     : 0.000
% 0.15/0.43  # Current number of processed clauses  : 13
% 0.15/0.43  #    Positive orientable unit clauses  : 5
% 0.15/0.43  #    Positive unorientable unit clauses: 0
% 0.15/0.43  #    Negative unit clauses             : 1
% 0.15/0.43  #    Non-unit-clauses                  : 7
% 0.15/0.43  # Current number of unprocessed clauses: 20
% 0.15/0.43  # ...number of literals in the above   : 85
% 0.15/0.43  # Current number of archived formulas  : 0
% 0.15/0.43  # Current number of archived clauses   : 6
% 0.15/0.43  # Clause-clause subsumption calls (NU) : 16
% 0.15/0.43  # Rec. Clause-clause subsumption calls : 9
% 0.15/0.43  # Non-unit clause-clause subsumptions  : 0
% 0.15/0.43  # Unit Clause-clause subsumption calls : 0
% 0.15/0.43  # Rewrite failures with RHS unbound    : 0
% 0.15/0.43  # BW rewrite match attempts            : 2
% 0.15/0.43  # BW rewrite match successes           : 2
% 0.15/0.43  # Condensation attempts                : 0
% 0.15/0.43  # Condensation successes               : 0
% 0.15/0.43  # Termbank termtop insertions          : 2313
% 0.15/0.43  
% 0.15/0.43  # -------------------------------------------------
% 0.15/0.43  # User time                : 0.002 s
% 0.15/0.43  # System time              : 0.003 s
% 0.15/0.43  # Total time               : 0.005 s
% 0.15/0.43  # Maximum resident set size: 2000 pages
% 0.15/0.43  
% 0.15/0.43  # -------------------------------------------------
% 0.15/0.43  # User time                : 0.005 s
% 0.15/0.43  # System time              : 0.005 s
% 0.15/0.43  # Total time               : 0.010 s
% 0.15/0.43  # Maximum resident set size: 1848 pages
% 0.15/0.43  % E---3.1 exiting
% 0.15/0.44  % E---3.1 exiting
%------------------------------------------------------------------------------