↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWC098-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 02:42:59 PM UTC 2026

% Result   : Unsatisfiable 0.16s 0.48s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   51 (  12 unt;  13 nHn;  51 RR)
%            Number of literals    :  137 (  61 equ;  85 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   26 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
    ( nil != sk1
    | nil != sk2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

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

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

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

cnf(co1_19,negated_conjecture,
    ( ~ leq(sk6,X1)
    | ~ memberP(sk4,X1)
    | ~ ssItem(X1)
    | nil = sk3
    | sk6 = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).

cnf(co1_14,negated_conjecture,
    ( nil = sk4
    | cons(sk6,nil) = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

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

cnf(co1_12,negated_conjecture,
    ( nil = sk4
    | ssItem(sk6) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

cnf(co1_9,negated_conjecture,
    ( ~ memberP(sk2,X1)
    | cons(X1,nil) != sk1
    | ~ ssItem(X1)
    | leq(X1,sk5(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

cnf(co1_17,negated_conjecture,
    ( nil = sk3
    | cons(sk6,nil) = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).

cnf(co1_18,negated_conjecture,
    ( nil = sk3
    | memberP(sk4,sk6) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).

cnf(co1_13,negated_conjecture,
    ( nil = sk3
    | ssItem(sk6) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).

cnf(co1_8,negated_conjecture,
    ( ~ memberP(sk2,X1)
    | cons(X1,nil) != sk1
    | ~ ssItem(X1)
    | memberP(sk2,sk5(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

cnf(co1_7,negated_conjecture,
    ( ~ memberP(sk2,X1)
    | cons(X1,nil) != sk1
    | ~ ssItem(X1)
    | ssItem(sk5(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

cnf(co1_10,negated_conjecture,
    ( ~ memberP(sk2,X1)
    | X1 != sk5(X1)
    | cons(X1,nil) != sk1
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

cnf(c_0_15,negated_conjecture,
    ( nil != sk1
    | nil != sk2 ),
    inference(fof_simplification,[status(thm)],[co1_11]) ).

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

cnf(c_0_17,negated_conjecture,
    ( nil != sk1
    | nil != sk2 ),
    c_0_15 ).

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

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

cnf(c_0_20,negated_conjecture,
    ( ~ leq(sk6,X1)
    | ~ memberP(sk4,X1)
    | ~ ssItem(X1)
    | nil = sk3
    | sk6 = X1 ),
    inference(fof_simplification,[status(thm)],[co1_19]) ).

cnf(c_0_21,plain,
    ( ~ ssList(X2)
    | ~ ssItem(X1)
    | cons(X1,X2) != nil ),
    c_0_16 ).

cnf(c_0_22,negated_conjecture,
    ( nil = sk4
    | cons(sk6,nil) = sk3 ),
    co1_14 ).

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

cnf(c_0_24,negated_conjecture,
    ( nil = sk4
    | ssItem(sk6) ),
    co1_12 ).

cnf(c_0_25,negated_conjecture,
    ( sk4 != nil
    | sk3 != nil ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ memberP(sk2,X1)
    | cons(X1,nil) != sk1
    | ~ ssItem(X1)
    | leq(X1,sk5(X1)) ),
    inference(fof_simplification,[status(thm)],[co1_9]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ leq(sk6,X1)
    | ~ memberP(sk4,X1)
    | ~ ssItem(X1)
    | nil = sk3
    | sk6 = X1 ),
    c_0_20 ).

cnf(c_0_28,negated_conjecture,
    sk3 != nil,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[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]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ memberP(sk2,X1)
    | cons(X1,nil) != sk1
    | ~ ssItem(X1)
    | leq(X1,sk5(X1)) ),
    c_0_26 ).

cnf(c_0_30,negated_conjecture,
    ( nil = sk3
    | cons(sk6,nil) = sk3 ),
    co1_17 ).

cnf(c_0_31,negated_conjecture,
    ( nil = sk3
    | memberP(sk4,sk6) ),
    co1_18 ).

cnf(c_0_32,negated_conjecture,
    ( nil = sk3
    | ssItem(sk6) ),
    co1_13 ).

cnf(c_0_33,negated_conjecture,
    ( ~ memberP(sk2,X1)
    | cons(X1,nil) != sk1
    | ~ ssItem(X1)
    | memberP(sk2,sk5(X1)) ),
    inference(fof_simplification,[status(thm)],[co1_8]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ ssItem(X1)
    | ~ leq(sk6,X1)
    | ~ memberP(sk4,X1)
    | sk6 = X1 ),
    inference(sr,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_35,negated_conjecture,
    ( ~ ssItem(X1)
    | ~ memberP(sk4,X1)
    | cons(X1,nil) != sk3
    | leq(X1,sk5(X1)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_18]),c_0_19]) ).

cnf(c_0_36,negated_conjecture,
    cons(sk6,nil) = sk3,
    inference(sr,[status(thm)],[c_0_30,c_0_28]) ).

cnf(c_0_37,negated_conjecture,
    memberP(sk4,sk6),
    inference(sr,[status(thm)],[c_0_31,c_0_28]) ).

cnf(c_0_38,negated_conjecture,
    ssItem(sk6),
    inference(sr,[status(thm)],[c_0_32,c_0_28]) ).

cnf(c_0_39,negated_conjecture,
    ( ~ memberP(sk2,X1)
    | cons(X1,nil) != sk1
    | ~ ssItem(X1)
    | memberP(sk2,sk5(X1)) ),
    c_0_33 ).

cnf(c_0_40,negated_conjecture,
    ( ~ memberP(sk2,X1)
    | cons(X1,nil) != sk1
    | ~ ssItem(X1)
    | ssItem(sk5(X1)) ),
    inference(fof_simplification,[status(thm)],[co1_7]) ).

cnf(c_0_41,negated_conjecture,
    ( ~ memberP(sk2,X1)
    | X1 != sk5(X1)
    | cons(X1,nil) != sk1
    | ~ ssItem(X1) ),
    inference(fof_simplification,[status(thm)],[co1_10]) ).

cnf(c_0_42,negated_conjecture,
    ( ~ ssItem(sk5(sk6))
    | ~ memberP(sk4,sk5(sk6))
    | sk5(sk6) = sk6 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37]),c_0_38])]) ).

cnf(c_0_43,negated_conjecture,
    ( ~ ssItem(X1)
    | ~ memberP(sk4,X1)
    | cons(X1,nil) != sk3
    | memberP(sk4,sk5(X1)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_19]),c_0_18]),c_0_19]) ).

cnf(c_0_44,negated_conjecture,
    ( ~ memberP(sk2,X1)
    | cons(X1,nil) != sk1
    | ~ ssItem(X1)
    | ssItem(sk5(X1)) ),
    c_0_40 ).

cnf(c_0_45,negated_conjecture,
    ( ~ memberP(sk2,X1)
    | X1 != sk5(X1)
    | cons(X1,nil) != sk1
    | ~ ssItem(X1) ),
    c_0_41 ).

cnf(c_0_46,negated_conjecture,
    ( ~ ssItem(sk5(sk6))
    | sk5(sk6) = sk6 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_36]),c_0_37]),c_0_38])]) ).

cnf(c_0_47,negated_conjecture,
    ( ~ ssItem(X1)
    | ~ memberP(sk4,X1)
    | cons(X1,nil) != sk3
    | ssItem(sk5(X1)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_18]),c_0_19]) ).

cnf(c_0_48,negated_conjecture,
    ( ~ ssItem(X1)
    | ~ memberP(sk4,X1)
    | sk5(X1) != X1
    | cons(X1,nil) != sk3 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_18]),c_0_19]) ).

cnf(c_0_49,negated_conjecture,
    sk5(sk6) = sk6,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_36]),c_0_37]),c_0_38])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC098-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37  % Computer : n014.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 21 07:55:36 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.42  Running first-order theorem proving
% 0.09/0.42  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.16/0.48  % Version: 3.5.1
% 0.16/0.48  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.48  % Starting new_bool_3 with 300s (1) cores
% 0.16/0.48  % Starting new_bool_1 with 300s (1) cores
% 0.16/0.48  % Starting sh5l with 300s (1) cores
% 0.16/0.48  % new_bool_3 with pid 3581060 completed with status 0
% 0.16/0.48  % Result found by new_bool_3
% 0.16/0.48  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.48  % Starting new_bool_3 with 300s (1) cores
% 0.16/0.48  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.48  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.48  % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.16/0.48  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.48  % Starting SubtermCWHack with 28s (1) cores
% 0.16/0.48  % SubtermCWHack with pid 3581064 completed with status 0
% 0.16/0.48  % Result found by SubtermCWHack
% 0.16/0.48  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.48  % Starting new_bool_3 with 300s (1) cores
% 0.16/0.48  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.48  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.48  % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.16/0.48  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.48  % Starting SubtermCWHack with 28s (1) cores
% 0.16/0.48  % Preprocessing time       : 0.001 s
% 0.16/0.48  
% 0.16/0.48  % Proof found!
% 0.16/0.48  % SZS status Unsatisfiable
% 0.16/0.48  % SZS output start CNFRefutation
% See solution above
% 0.16/0.48  % Parsed axioms                        : 204
% 0.16/0.48  % Removed by relevancy pruning/SinE    : 149
% 0.16/0.48  % Initial clauses                      : 55
% 0.16/0.48  % Removed in clause preprocessing      : 0
% 0.16/0.48  % Initial clauses in saturation        : 55
% 0.16/0.48  % Processed clauses                    : 61
% 0.16/0.48  % ...of these trivial                  : 0
% 0.16/0.48  % ...subsumed                          : 9
% 0.16/0.48  % ...remaining for further processing  : 52
% 0.16/0.48  % Other redundant clauses eliminated   : 4
% 0.16/0.48  % Clauses deleted for lack of memory   : 0
% 0.16/0.48  % Backward-subsumed                    : 5
% 0.16/0.48  % Backward-rewritten                   : 3
% 0.16/0.48  % Generated clauses                    : 40
% 0.16/0.48  % ...of the previous two non-redundant : 24
% 0.16/0.48  % ...aggressively subsumed             : 0
% 0.16/0.48  % Contextual simplify-reflections      : 2
% 0.16/0.48  % Paramodulations                      : 34
% 0.16/0.48  % Factorizations                       : 0
% 0.16/0.48  % NegExts                              : 0
% 0.16/0.48  % Equation resolutions                 : 4
% 0.16/0.48  % Disequality decompositions           : 0
% 0.16/0.48  % Total rewrite steps                  : 62
% 0.16/0.48  % ...of those cached                   : 53
% 0.16/0.48  % Propositional unsat checks           : 0
% 0.16/0.48  %    Propositional check models        : 0
% 0.16/0.48  %    Propositional check unsatisfiable : 0
% 0.16/0.48  %    Propositional clauses             : 0
% 0.16/0.48  %    Propositional clauses after purity: 0
% 0.16/0.48  %    Propositional unsat core size     : 0
% 0.16/0.48  %    Propositional preprocessing time  : 0.000
% 0.16/0.48  %    Propositional encoding time       : 0.000
% 0.16/0.48  %    Propositional solver time         : 0.000
% 0.16/0.48  %    Success case prop preproc time    : 0.000
% 0.16/0.48  %    Success case prop encoding time   : 0.000
% 0.16/0.48  %    Success case prop solver time     : 0.000
% 0.16/0.48  % Current number of processed clauses  : 38
% 0.16/0.48  %    Positive orientable unit clauses  : 11
% 0.16/0.48  %    Positive unorientable unit clauses: 0
% 0.16/0.48  %    Negative unit clauses             : 1
% 0.16/0.48  %    Non-unit-clauses                  : 26
% 0.16/0.48  % Current number of unprocessed clauses: 18
% 0.16/0.48  % ...number of literals in the above   : 97
% 0.16/0.48  % Current number of archived formulas  : 0
% 0.16/0.48  % Current number of archived clauses   : 11
% 0.16/0.48  % Clause-clause subsumption calls (NU) : 125
% 0.16/0.48  % Rec. Clause-clause subsumption calls : 46
% 0.16/0.48  % Non-unit clause-clause subsumptions  : 9
% 0.16/0.48  % Unit Clause-clause subsumption calls : 6
% 0.16/0.48  % Rewrite failures with RHS unbound    : 0
% 0.16/0.48  % BW rewrite match attempts            : 6
% 0.16/0.48  % BW rewrite match successes           : 6
% 0.16/0.48  % Condensation attempts                : 0
% 0.16/0.48  % Condensation successes               : 0
% 0.16/0.48  % Termbank termtop insertions          : 4361
% 0.16/0.48  % Search garbage collected termcells   : 918
% 0.16/0.48  
% 0.16/0.48  % -------------------------------------------------
% 0.16/0.48  % User time                : 0.005 s
% 0.16/0.48  % System time              : 0.003 s
% 0.16/0.48  % Total time               : 0.008 s
% 0.16/0.48  % Maximum resident set size: 3816 pages
% 0.16/0.48  
% 0.16/0.48  % -------------------------------------------------
% 0.16/0.48  % User time                : 0.010 s
% 0.16/0.48  % System time              : 0.007 s
% 0.16/0.48  % Total time               : 0.017 s
% 0.16/0.48  % Maximum resident set size: 5120 pages
% 0.16/0.48  % E exiting
%------------------------------------------------------------------------------