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

View Problem - Process Solution

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

% Computer : n027.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:49 EDT 2023

% Result   : Unsatisfiable 0.19s 0.49s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   31 (  23 unt;   0 nHn;  31 RR)
%            Number of literals    :   57 (   6 equ;  30 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause140,axiom,
    ( memberP(app(X1,X3),X2)
    | ~ memberP(X1,X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    file('/export/starexec/sandbox/tmp/tmp.zKOif9HRem/E---3.1_19569.p',clause140) ).

cnf(co1_9,negated_conjecture,
    app(app(sk5,sk3),sk6) = sk4,
    file('/export/starexec/sandbox/tmp/tmp.zKOif9HRem/E---3.1_19569.p',co1_9) ).

cnf(co1_8,negated_conjecture,
    ssList(sk6),
    file('/export/starexec/sandbox/tmp/tmp.zKOif9HRem/E---3.1_19569.p',co1_8) ).

cnf(co1_1,negated_conjecture,
    ssList(sk1),
    file('/export/starexec/sandbox/tmp/tmp.zKOif9HRem/E---3.1_19569.p',co1_1) ).

cnf(co1_6,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox/tmp/tmp.zKOif9HRem/E---3.1_19569.p',co1_6) ).

cnf(co1_15,negated_conjecture,
    ~ memberP(sk2,sk7),
    file('/export/starexec/sandbox/tmp/tmp.zKOif9HRem/E---3.1_19569.p',co1_15) ).

cnf(co1_5,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox/tmp/tmp.zKOif9HRem/E---3.1_19569.p',co1_5) ).

cnf(clause141,axiom,
    ( memberP(app(X3,X1),X2)
    | ~ memberP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssItem(X2) ),
    file('/export/starexec/sandbox/tmp/tmp.zKOif9HRem/E---3.1_19569.p',clause141) ).

cnf(co1_7,negated_conjecture,
    ssList(sk5),
    file('/export/starexec/sandbox/tmp/tmp.zKOif9HRem/E---3.1_19569.p',co1_7) ).

cnf(co1_14,negated_conjecture,
    memberP(sk1,sk7),
    file('/export/starexec/sandbox/tmp/tmp.zKOif9HRem/E---3.1_19569.p',co1_14) ).

cnf(co1_13,negated_conjecture,
    ssItem(sk7),
    file('/export/starexec/sandbox/tmp/tmp.zKOif9HRem/E---3.1_19569.p',co1_13) ).

cnf(clause85,axiom,
    ( ssList(app(X2,X1))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    file('/export/starexec/sandbox/tmp/tmp.zKOif9HRem/E---3.1_19569.p',clause85) ).

cnf(c_0_12,axiom,
    ( memberP(app(X1,X3),X2)
    | ~ memberP(X1,X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    clause140 ).

cnf(c_0_13,negated_conjecture,
    app(app(sk5,sk3),sk6) = sk4,
    co1_9 ).

cnf(c_0_14,negated_conjecture,
    ssList(sk6),
    co1_8 ).

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

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

cnf(c_0_17,negated_conjecture,
    ~ memberP(sk2,sk7),
    co1_15 ).

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

cnf(c_0_19,negated_conjecture,
    ( memberP(sk4,X1)
    | ~ memberP(app(sk5,sk3),X1)
    | ~ ssItem(X1)
    | ~ ssList(app(sk5,sk3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).

cnf(c_0_20,axiom,
    ( memberP(app(X3,X1),X2)
    | ~ memberP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssItem(X2) ),
    clause141 ).

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

cnf(c_0_22,negated_conjecture,
    ssList(sk3),
    inference(rw,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_23,negated_conjecture,
    memberP(sk1,sk7),
    co1_14 ).

cnf(c_0_24,negated_conjecture,
    ~ memberP(sk4,sk7),
    inference(rw,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_25,negated_conjecture,
    ( memberP(sk4,X1)
    | ~ memberP(sk3,X1)
    | ~ ssItem(X1)
    | ~ ssList(app(sk5,sk3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).

cnf(c_0_26,negated_conjecture,
    memberP(sk3,sk7),
    inference(rw,[status(thm)],[c_0_23,c_0_16]) ).

cnf(c_0_27,negated_conjecture,
    ssItem(sk7),
    co1_13 ).

cnf(c_0_28,negated_conjecture,
    ~ ssList(app(sk5,sk3)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).

cnf(c_0_29,axiom,
    ( ssList(app(X2,X1))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    clause85 ).

cnf(c_0_30,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21]),c_0_22])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWC399-1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n027.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 2400
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Tue Oct  3 02:30:46 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  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.zKOif9HRem/E---3.1_19569.p
% 0.19/0.49  # Version: 3.1pre001
% 0.19/0.49  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49  # Starting sh5l with 300s (1) cores
% 0.19/0.49  # new_bool_3 with pid 19649 completed with status 0
% 0.19/0.49  # Result found by new_bool_3
% 0.19/0.49  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49  # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.19/0.49  # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.19/0.49  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.49  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19652 completed with status 0
% 0.19/0.49  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.49  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49  # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.19/0.49  # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.19/0.49  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.49  # Preprocessing time       : 0.003 s
% 0.19/0.49  # Presaturation interreduction done
% 0.19/0.49  
% 0.19/0.49  # Proof found!
% 0.19/0.49  # SZS status Unsatisfiable
% 0.19/0.49  # SZS output start CNFRefutation
% See solution above
% 0.19/0.49  # Parsed axioms                        : 201
% 0.19/0.49  # Removed by relevancy pruning/SinE    : 157
% 0.19/0.49  # Initial clauses                      : 44
% 0.19/0.49  # Removed in clause preprocessing      : 0
% 0.19/0.49  # Initial clauses in saturation        : 44
% 0.19/0.49  # Processed clauses                    : 231
% 0.19/0.49  # ...of these trivial                  : 2
% 0.19/0.49  # ...subsumed                          : 73
% 0.19/0.49  # ...remaining for further processing  : 156
% 0.19/0.49  # Other redundant clauses eliminated   : 9
% 0.19/0.49  # Clauses deleted for lack of memory   : 0
% 0.19/0.49  # Backward-subsumed                    : 45
% 0.19/0.49  # Backward-rewritten                   : 0
% 0.19/0.49  # Generated clauses                    : 578
% 0.19/0.49  # ...of the previous two non-redundant : 448
% 0.19/0.49  # ...aggressively subsumed             : 0
% 0.19/0.49  # Contextual simplify-reflections      : 4
% 0.19/0.49  # Paramodulations                      : 566
% 0.19/0.49  # Factorizations                       : 0
% 0.19/0.49  # NegExts                              : 0
% 0.19/0.49  # Equation resolutions                 : 13
% 0.19/0.49  # Total rewrite steps                  : 680
% 0.19/0.49  # Propositional unsat checks           : 0
% 0.19/0.49  #    Propositional check models        : 0
% 0.19/0.49  #    Propositional check unsatisfiable : 0
% 0.19/0.49  #    Propositional clauses             : 0
% 0.19/0.49  #    Propositional clauses after purity: 0
% 0.19/0.49  #    Propositional unsat core size     : 0
% 0.19/0.49  #    Propositional preprocessing time  : 0.000
% 0.19/0.49  #    Propositional encoding time       : 0.000
% 0.19/0.49  #    Propositional solver time         : 0.000
% 0.19/0.49  #    Success case prop preproc time    : 0.000
% 0.19/0.49  #    Success case prop encoding time   : 0.000
% 0.19/0.49  #    Success case prop solver time     : 0.000
% 0.19/0.49  # Current number of processed clauses  : 65
% 0.19/0.49  #    Positive orientable unit clauses  : 14
% 0.19/0.49  #    Positive unorientable unit clauses: 0
% 0.19/0.49  #    Negative unit clauses             : 6
% 0.19/0.49  #    Non-unit-clauses                  : 45
% 0.19/0.49  # Current number of unprocessed clauses: 113
% 0.19/0.49  # ...number of literals in the above   : 617
% 0.19/0.49  # Current number of archived formulas  : 0
% 0.19/0.49  # Current number of archived clauses   : 87
% 0.19/0.49  # Clause-clause subsumption calls (NU) : 959
% 0.19/0.49  # Rec. Clause-clause subsumption calls : 499
% 0.19/0.49  # Non-unit clause-clause subsumptions  : 82
% 0.19/0.49  # Unit Clause-clause subsumption calls : 160
% 0.19/0.49  # Rewrite failures with RHS unbound    : 0
% 0.19/0.49  # BW rewrite match attempts            : 0
% 0.19/0.49  # BW rewrite match successes           : 0
% 0.19/0.49  # Condensation attempts                : 0
% 0.19/0.49  # Condensation successes               : 0
% 0.19/0.49  # Termbank termtop insertions          : 10863
% 0.19/0.49  
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.014 s
% 0.19/0.49  # System time              : 0.004 s
% 0.19/0.49  # Total time               : 0.018 s
% 0.19/0.49  # Maximum resident set size: 1952 pages
% 0.19/0.49  
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.018 s
% 0.19/0.49  # System time              : 0.006 s
% 0.19/0.49  # Total time               : 0.024 s
% 0.19/0.49  # Maximum resident set size: 1852 pages
% 0.19/0.49  % E---3.1 exiting
% 0.19/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------