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

View Problem - Process Solution

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

% Computer : n021.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:23:54 EDT 2024

% Result   : Unsatisfiable 0.21s 0.55s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   50 (  18 unt;   6 nHn;  46 RR)
%            Number of literals    :  131 (  36 equ;  89 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   66 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

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

cnf(clause120,axiom,
    ( app(cons(X1,nil),X2) = cons(X1,X2)
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).

cnf(clause157,axiom,
    ( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).

cnf(clause109,axiom,
    ( cons(skaf83(X1),skaf82(X1)) = X1
    | nil = X1
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).

cnf(clause12,axiom,
    ssItem(skaf83(X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause12) ).

cnf(clause13,axiom,
    ssList(skaf82(X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).

cnf(clause116,axiom,
    ( singletonP(X2)
    | cons(X1,nil) != X2
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause116) ).

cnf(co1_2,negated_conjecture,
    ssList(sk2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).

cnf(clause86,axiom,
    ( ssList(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).

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

cnf(co1_9,negated_conjecture,
    ~ singletonP(sk2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

cnf(clause115,axiom,
    ( X1 != X2
    | ~ neq(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).

cnf(co1_7,negated_conjecture,
    neq(sk2,nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

cnf(c_0_14,negated_conjecture,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4 ),
    inference(fof_simplification,[status(thm)],[co1_8]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4 ),
    c_0_14 ).

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

cnf(c_0_17,plain,
    ( app(cons(X1,nil),X2) = cons(X1,X2)
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(fof_simplification,[status(thm)],[clause120]) ).

cnf(c_0_18,negated_conjecture,
    ( app(app(cons(X1,nil),cons(X2,nil)),X3) != sk2
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(X3) ),
    inference(rw,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    ( app(cons(X1,nil),X2) = cons(X1,X2)
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    c_0_17 ).

cnf(c_0_20,plain,
    ( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    inference(fof_simplification,[status(thm)],[clause157]) ).

cnf(c_0_21,negated_conjecture,
    ( app(cons(X1,cons(X2,nil)),X3) != sk2
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(cons(X2,nil))
    | ~ ssList(X3) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,plain,
    ( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    c_0_20 ).

cnf(c_0_23,negated_conjecture,
    ( cons(X1,app(cons(X2,nil),X3)) != sk2
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(cons(X2,nil))
    | ~ ssList(X3) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_24,plain,
    ( cons(skaf83(X1),skaf82(X1)) = X1
    | nil = X1
    | ~ ssList(X1) ),
    inference(fof_simplification,[status(thm)],[clause109]) ).

cnf(c_0_25,negated_conjecture,
    ( cons(X1,cons(X2,X3)) != sk2
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(cons(X2,nil))
    | ~ ssList(X3) ),
    inference(spm,[status(thm)],[c_0_23,c_0_19]) ).

cnf(c_0_26,plain,
    ( cons(skaf83(X1),skaf82(X1)) = X1
    | nil = X1
    | ~ ssList(X1) ),
    c_0_24 ).

cnf(c_0_27,axiom,
    ssItem(skaf83(X1)),
    clause12 ).

cnf(c_0_28,axiom,
    ssList(skaf82(X1)),
    clause13 ).

cnf(c_0_29,plain,
    ( singletonP(X2)
    | cons(X1,nil) != X2
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(fof_simplification,[status(thm)],[clause116]) ).

cnf(c_0_30,negated_conjecture,
    ( nil = X1
    | cons(X2,X1) != sk2
    | ~ ssItem(X2)
    | ~ ssList(cons(skaf83(X1),nil))
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]) ).

cnf(c_0_31,negated_conjecture,
    ssList(sk2),
    co1_2 ).

cnf(c_0_32,plain,
    ( ssList(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(fof_simplification,[status(thm)],[clause86]) ).

cnf(c_0_33,plain,
    ( singletonP(X2)
    | cons(X1,nil) != X2
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    c_0_29 ).

cnf(c_0_34,negated_conjecture,
    ( skaf82(sk2) = nil
    | sk2 = nil
    | ~ ssList(cons(skaf83(skaf82(sk2)),nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_26]),c_0_27]),c_0_28])])]),c_0_31])]) ).

cnf(c_0_35,plain,
    ( ssList(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    c_0_32 ).

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

cnf(c_0_37,plain,
    ( singletonP(cons(X1,nil))
    | ~ ssItem(X1)
    | ~ ssList(cons(X1,nil)) ),
    inference(er,[status(thm)],[c_0_33]) ).

cnf(c_0_38,negated_conjecture,
    ( skaf82(sk2) = nil
    | sk2 = nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_27]),c_0_36])]) ).

cnf(c_0_39,negated_conjecture,
    ~ singletonP(sk2),
    inference(fof_simplification,[status(thm)],[co1_9]) ).

cnf(c_0_40,plain,
    ( X1 != X2
    | ~ neq(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(fof_simplification,[status(thm)],[clause115]) ).

cnf(c_0_41,plain,
    ( singletonP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_35]),c_0_36])]) ).

cnf(c_0_42,negated_conjecture,
    ( cons(skaf83(sk2),nil) = sk2
    | sk2 = nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_38]),c_0_31])]) ).

cnf(c_0_43,negated_conjecture,
    ~ singletonP(sk2),
    c_0_39 ).

cnf(c_0_44,plain,
    ( X1 != X2
    | ~ neq(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    c_0_40 ).

cnf(c_0_45,negated_conjecture,
    neq(sk2,nil),
    co1_7 ).

cnf(c_0_46,negated_conjecture,
    sk2 = nil,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_27])]),c_0_43]) ).

cnf(c_0_47,plain,
    ( ~ neq(X1,X1)
    | ~ ssList(X1) ),
    inference(er,[status(thm)],[c_0_44]) ).

cnf(c_0_48,negated_conjecture,
    neq(nil,nil),
    inference(rw,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_49,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_36])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SWC149-1 : TPTP v8.2.0. Released v2.4.0.
% 0.13/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n021.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 19 03:54:23 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.21/0.49  Running first-order theorem proving
% 0.21/0.49  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/benchmark/theBenchmark.p
% 0.21/0.55  # Version: 3.1.0
% 0.21/0.55  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55  # Starting sh5l with 300s (1) cores
% 0.21/0.55  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 29719 completed with status 0
% 0.21/0.55  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.55  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.55  # No SInE strategy applied
% 0.21/0.55  # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.21/0.55  # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.55  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.21/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.55  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.21/0.55  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.21/0.55  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.21/0.55  # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 29729 completed with status 0
% 0.21/0.55  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.21/0.55  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.55  # No SInE strategy applied
% 0.21/0.55  # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.21/0.55  # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.55  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.21/0.55  # Preprocessing time       : 0.003 s
% 0.21/0.55  # Presaturation interreduction done
% 0.21/0.55  
% 0.21/0.55  # Proof found!
% 0.21/0.55  # SZS status Unsatisfiable
% 0.21/0.55  # SZS output start CNFRefutation
% See solution above
% 0.21/0.55  # Parsed axioms                        : 194
% 0.21/0.55  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.55  # Initial clauses                      : 194
% 0.21/0.55  # Removed in clause preprocessing      : 0
% 0.21/0.55  # Initial clauses in saturation        : 194
% 0.21/0.55  # Processed clauses                    : 621
% 0.21/0.55  # ...of these trivial                  : 2
% 0.21/0.55  # ...subsumed                          : 162
% 0.21/0.55  # ...remaining for further processing  : 457
% 0.21/0.55  # Other redundant clauses eliminated   : 79
% 0.21/0.55  # Clauses deleted for lack of memory   : 0
% 0.21/0.55  # Backward-subsumed                    : 6
% 0.21/0.55  # Backward-rewritten                   : 47
% 0.21/0.55  # Generated clauses                    : 673
% 0.21/0.55  # ...of the previous two non-redundant : 564
% 0.21/0.55  # ...aggressively subsumed             : 0
% 0.21/0.55  # Contextual simplify-reflections      : 5
% 0.21/0.55  # Paramodulations                      : 590
% 0.21/0.55  # Factorizations                       : 0
% 0.21/0.55  # NegExts                              : 0
% 0.21/0.55  # Equation resolutions                 : 84
% 0.21/0.55  # Disequality decompositions           : 0
% 0.21/0.55  # Total rewrite steps                  : 695
% 0.21/0.55  # ...of those cached                   : 660
% 0.21/0.55  # Propositional unsat checks           : 0
% 0.21/0.55  #    Propositional check models        : 0
% 0.21/0.55  #    Propositional check unsatisfiable : 0
% 0.21/0.55  #    Propositional clauses             : 0
% 0.21/0.55  #    Propositional clauses after purity: 0
% 0.21/0.55  #    Propositional unsat core size     : 0
% 0.21/0.55  #    Propositional preprocessing time  : 0.000
% 0.21/0.55  #    Propositional encoding time       : 0.000
% 0.21/0.55  #    Propositional solver time         : 0.000
% 0.21/0.55  #    Success case prop preproc time    : 0.000
% 0.21/0.55  #    Success case prop encoding time   : 0.000
% 0.21/0.55  #    Success case prop solver time     : 0.000
% 0.21/0.55  # Current number of processed clauses  : 195
% 0.21/0.55  #    Positive orientable unit clauses  : 63
% 0.21/0.55  #    Positive unorientable unit clauses: 0
% 0.21/0.55  #    Negative unit clauses             : 2
% 0.21/0.55  #    Non-unit-clauses                  : 130
% 0.21/0.55  # Current number of unprocessed clauses: 300
% 0.21/0.55  # ...number of literals in the above   : 1530
% 0.21/0.55  # Current number of archived formulas  : 0
% 0.21/0.55  # Current number of archived clauses   : 239
% 0.21/0.55  # Clause-clause subsumption calls (NU) : 12511
% 0.21/0.55  # Rec. Clause-clause subsumption calls : 2147
% 0.21/0.55  # Non-unit clause-clause subsumptions  : 113
% 0.21/0.55  # Unit Clause-clause subsumption calls : 125
% 0.21/0.55  # Rewrite failures with RHS unbound    : 0
% 0.21/0.55  # BW rewrite match attempts            : 3
% 0.21/0.55  # BW rewrite match successes           : 3
% 0.21/0.55  # Condensation attempts                : 0
% 0.21/0.55  # Condensation successes               : 0
% 0.21/0.55  # Termbank termtop insertions          : 19132
% 0.21/0.55  # Search garbage collected termcells   : 534
% 0.21/0.55  
% 0.21/0.55  # -------------------------------------------------
% 0.21/0.55  # User time                : 0.043 s
% 0.21/0.55  # System time              : 0.006 s
% 0.21/0.55  # Total time               : 0.049 s
% 0.21/0.55  # Maximum resident set size: 2144 pages
% 0.21/0.55  
% 0.21/0.55  # -------------------------------------------------
% 0.21/0.55  # User time                : 0.194 s
% 0.21/0.55  # System time              : 0.021 s
% 0.21/0.55  # Total time               : 0.215 s
% 0.21/0.55  # Maximum resident set size: 1896 pages
% 0.21/0.55  % E---3.1 exiting
% 0.21/0.56  % E exiting
%------------------------------------------------------------------------------