↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n019.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:44:11 PM UTC 2026

% Result   : Unsatisfiable 0.14s 5.52s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   41 (  11 unt;  14 nHn;  41 RR)
%            Number of literals    :   85 (  39 equ;  38 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_14,negated_conjecture,
    ( ~ memberP(sk2,X1)
    | cons(X1,nil) != sk1
    | ~ ssItem(X1)
    | nil = sk2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).

cnf(co1_15,negated_conjecture,
    ( nil != sk1
    | neq(sk2,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).

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

cnf(co1_10,negated_conjecture,
    ( nil = sk4
    | memberP(sk4,sk5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

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

cnf(co1_7,negated_conjecture,
    ( nil = sk4
    | ssItem(sk5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

cnf(co1_9,negated_conjecture,
    ( nil = sk4
    | cons(sk5,nil) = sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

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

cnf(co1_12,negated_conjecture,
    ( nil = sk3
    | memberP(sk4,sk5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

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

cnf(clause71,axiom,
    ( ~ ssItem(X1)
    | ~ memberP(nil,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).

cnf(co1_8,negated_conjecture,
    ( nil = sk3
    | ssItem(sk5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

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

cnf(c_0_13,negated_conjecture,
    ( nil != sk1
    | neq(sk2,nil) ),
    inference(fof_simplification,[status(thm)],[co1_15]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ memberP(sk2,X1)
    | cons(X1,nil) != sk1
    | ~ ssItem(X1)
    | nil = sk2 ),
    c_0_12 ).

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

cnf(c_0_16,negated_conjecture,
    ( nil = sk4
    | memberP(sk4,sk5) ),
    co1_10 ).

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

cnf(c_0_18,negated_conjecture,
    ( nil = sk4
    | ssItem(sk5) ),
    co1_7 ).

cnf(c_0_19,negated_conjecture,
    ( nil = sk4
    | cons(sk5,nil) = sk3 ),
    co1_9 ).

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

cnf(c_0_21,negated_conjecture,
    ( nil != sk1
    | neq(sk2,nil) ),
    c_0_13 ).

cnf(c_0_22,negated_conjecture,
    ( ~ ssItem(X1)
    | ~ memberP(sk2,X1)
    | cons(X1,nil) != sk3
    | sk2 = nil ),
    inference(rw,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_23,negated_conjecture,
    ( memberP(sk2,sk5)
    | sk2 = nil ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).

cnf(c_0_24,negated_conjecture,
    ( ssItem(sk5)
    | sk2 = nil ),
    inference(rw,[status(thm)],[c_0_18,c_0_17]) ).

cnf(c_0_25,negated_conjecture,
    ( sk2 = nil
    | cons(sk5,nil) = sk3 ),
    inference(rw,[status(thm)],[c_0_19,c_0_17]) ).

cnf(c_0_26,plain,
    ( ~ ssList(X1)
    | ~ ssList(X2)
    | ~ neq(X1,X2)
    | X1 != X2 ),
    c_0_20 ).

cnf(c_0_27,negated_conjecture,
    ( sk3 != nil
    | neq(sk2,nil) ),
    inference(rw,[status(thm)],[c_0_21,c_0_15]) ).

cnf(c_0_28,negated_conjecture,
    sk2 = nil,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]) ).

cnf(c_0_29,negated_conjecture,
    ( nil = sk3
    | memberP(sk4,sk5) ),
    co1_12 ).

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

cnf(c_0_31,negated_conjecture,
    ( sk3 != nil
    | neq(nil,nil) ),
    inference(rw,[status(thm)],[c_0_27,c_0_28]) ).

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

cnf(c_0_33,plain,
    ( ~ ssItem(X1)
    | ~ memberP(nil,X1) ),
    inference(fof_simplification,[status(thm)],[clause71]) ).

cnf(c_0_34,negated_conjecture,
    ( memberP(sk2,sk5)
    | sk3 = nil ),
    inference(rw,[status(thm)],[c_0_29,c_0_17]) ).

cnf(c_0_35,negated_conjecture,
    sk3 != nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).

cnf(c_0_36,negated_conjecture,
    ( nil = sk3
    | ssItem(sk5) ),
    co1_8 ).

cnf(c_0_37,plain,
    ( ~ ssItem(X1)
    | ~ memberP(nil,X1) ),
    c_0_33 ).

cnf(c_0_38,negated_conjecture,
    memberP(nil,sk5),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_28]),c_0_35]) ).

cnf(c_0_39,negated_conjecture,
    ssItem(sk5),
    inference(sr,[status(thm)],[c_0_36,c_0_35]) ).

cnf(c_0_40,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC386-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/5.36  % Computer : n019.cluster.edu
% 0.10/5.36  % Model    : x86_64 x86_64
% 0.10/5.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.36  % Memory   : 8046.5625MB
% 0.10/5.36  % OS       : Linux 6.8.0-71-generic
% 0.10/5.36  % CPULimit : 300
% 0.10/5.36  % WCLimit  : 300
% 0.10/5.36  % DateTime : Mon Sep 21 08:20:29 UTC 2026
% 0.10/5.36  % CPUTime  : 
% 0.10/5.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.44  Running first-order theorem proving
% 0.14/5.44  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.14/5.52  % Version: 3.5.1
% 0.14/5.52  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/5.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.52  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/5.52  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.52  % Starting new_bool_1 with 300s (1) cores
% 0.14/5.52  % Starting sh5l with 300s (1) cores
% 0.14/5.52  % new_bool_3 with pid 2122585 completed with status 0
% 0.14/5.52  % Result found by new_bool_3
% 0.14/5.52  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/5.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.52  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/5.52  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.52  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.52  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.52  % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.14/5.52  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.52  % Starting SubtermCWHack with 31s (1) cores
% 0.14/5.52  % SubtermCWHack with pid 2122588 completed with status 0
% 0.14/5.52  % Result found by SubtermCWHack
% 0.14/5.52  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/5.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.52  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/5.52  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.52  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.52  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.52  % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.14/5.52  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.52  % Starting SubtermCWHack with 31s (1) cores
% 0.14/5.52  % Preprocessing time       : 0.003 s
% 0.14/5.52  
% 0.14/5.52  % Proof found!
% 0.14/5.52  % SZS status Unsatisfiable
% 0.14/5.52  % SZS output start CNFRefutation
% See solution above
% 0.14/5.52  % Parsed axioms                        : 201
% 0.14/5.52  % Removed by relevancy pruning/SinE    : 156
% 0.14/5.52  % Initial clauses                      : 45
% 0.14/5.52  % Removed in clause preprocessing      : 0
% 0.14/5.52  % Initial clauses in saturation        : 45
% 0.14/5.52  % Processed clauses                    : 45
% 0.14/5.52  % ...of these trivial                  : 0
% 0.14/5.52  % ...subsumed                          : 4
% 0.14/5.52  % ...remaining for further processing  : 41
% 0.14/5.52  % Other redundant clauses eliminated   : 4
% 0.14/5.52  % Clauses deleted for lack of memory   : 0
% 0.14/5.52  % Backward-subsumed                    : 1
% 0.14/5.52  % Backward-rewritten                   : 12
% 0.14/5.52  % Generated clauses                    : 24
% 0.14/5.52  % ...of the previous two non-redundant : 16
% 0.14/5.52  % ...aggressively subsumed             : 0
% 0.14/5.52  % Contextual simplify-reflections      : 3
% 0.14/5.52  % Paramodulations                      : 19
% 0.14/5.52  % Factorizations                       : 0
% 0.14/5.52  % NegExts                              : 0
% 0.14/5.52  % Equation resolutions                 : 4
% 0.14/5.52  % Disequality decompositions           : 0
% 0.14/5.52  % Total rewrite steps                  : 52
% 0.14/5.52  % ...of those cached                   : 45
% 0.14/5.52  % Propositional unsat checks           : 0
% 0.14/5.52  %    Propositional check models        : 0
% 0.14/5.52  %    Propositional check unsatisfiable : 0
% 0.14/5.52  %    Propositional clauses             : 0
% 0.14/5.52  %    Propositional clauses after purity: 0
% 0.14/5.52  %    Propositional unsat core size     : 0
% 0.14/5.52  %    Propositional preprocessing time  : 0.000
% 0.14/5.52  %    Propositional encoding time       : 0.000
% 0.14/5.52  %    Propositional solver time         : 0.000
% 0.14/5.52  %    Success case prop preproc time    : 0.000
% 0.14/5.52  %    Success case prop encoding time   : 0.000
% 0.14/5.52  %    Success case prop solver time     : 0.000
% 0.14/5.52  % Current number of processed clauses  : 23
% 0.14/5.52  %    Positive orientable unit clauses  : 9
% 0.14/5.52  %    Positive unorientable unit clauses: 0
% 0.14/5.52  %    Negative unit clauses             : 1
% 0.14/5.52  %    Non-unit-clauses                  : 13
% 0.14/5.52  % Current number of unprocessed clauses: 15
% 0.14/5.52  % ...number of literals in the above   : 75
% 0.14/5.52  % Current number of archived formulas  : 0
% 0.14/5.52  % Current number of archived clauses   : 15
% 0.14/5.52  % Clause-clause subsumption calls (NU) : 66
% 0.14/5.52  % Rec. Clause-clause subsumption calls : 38
% 0.14/5.52  % Non-unit clause-clause subsumptions  : 4
% 0.14/5.52  % Unit Clause-clause subsumption calls : 5
% 0.14/5.52  % Rewrite failures with RHS unbound    : 0
% 0.14/5.52  % BW rewrite match attempts            : 3
% 0.14/5.52  % BW rewrite match successes           : 3
% 0.14/5.52  % Condensation attempts                : 0
% 0.14/5.52  % Condensation successes               : 0
% 0.14/5.52  % Termbank termtop insertions          : 3517
% 0.14/5.52  % Search garbage collected termcells   : 909
% 0.14/5.52  
% 0.14/5.52  % -------------------------------------------------
% 0.14/5.52  % User time                : 0.011 s
% 0.14/5.52  % System time              : 0.002 s
% 0.14/5.52  % Total time               : 0.014 s
% 0.14/5.52  % Maximum resident set size: 4068 pages
% 0.14/5.52  
% 0.14/5.52  % -------------------------------------------------
% 0.14/5.52  % User time                : 0.019 s
% 0.14/5.52  % System time              : 0.009 s
% 0.14/5.52  % Total time               : 0.028 s
% 0.14/5.52  % Maximum resident set size: 4864 pages
% 0.14/5.52  % E exiting
%------------------------------------------------------------------------------