↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWC185-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 : n015.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:43:22 PM UTC 2026

% Result   : Unsatisfiable 0.24s 0.54s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   22 (  14 unt;   2 nHn;  22 RR)
%            Number of literals    :   48 (  11 equ;  31 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn)

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

cnf(co1_12,negated_conjecture,
    app(app(sk6,cons(sk5,nil)),sk7) = sk1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

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

cnf(co1_9,negated_conjecture,
    ssItem(sk5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

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

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

cnf(co1_7,negated_conjecture,
    ( ~ memberP(X2,X1)
    | app(app(X2,cons(X1,nil)),X3) != sk3
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

cnf(co1_13,negated_conjecture,
    ( memberP(sk7,sk5)
    | memberP(sk6,sk5) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).

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

cnf(c_0_9,negated_conjecture,
    app(app(sk6,cons(sk5,nil)),sk7) = sk1,
    co1_12 ).

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

cnf(c_0_11,negated_conjecture,
    ( ~ memberP(X3,X1)
    | app(app(X2,cons(X1,nil)),X3) != sk3
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    c_0_8 ).

cnf(c_0_12,negated_conjecture,
    app(app(sk6,cons(sk5,nil)),sk7) = sk3,
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    ssItem(sk5),
    co1_9 ).

cnf(c_0_14,negated_conjecture,
    ssList(sk7),
    co1_11 ).

cnf(c_0_15,negated_conjecture,
    ssList(sk6),
    co1_10 ).

cnf(c_0_16,negated_conjecture,
    ( ~ memberP(X2,X1)
    | app(app(X2,cons(X1,nil)),X3) != sk3
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(fof_simplification,[status(thm)],[co1_7]) ).

cnf(c_0_17,negated_conjecture,
    ( memberP(sk7,sk5)
    | memberP(sk6,sk5) ),
    co1_13 ).

cnf(c_0_18,negated_conjecture,
    ~ memberP(sk7,sk5),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14]),c_0_15])]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ memberP(X2,X1)
    | app(app(X2,cons(X1,nil)),X3) != sk3
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    c_0_16 ).

cnf(c_0_20,negated_conjecture,
    memberP(sk6,sk5),
    inference(sr,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_12]),c_0_20]),c_0_13]),c_0_14]),c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWC185-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.42  % Computer : n015.cluster.edu
% 0.16/0.42  % Model    : x86_64 x86_64
% 0.16/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42  % Memory   : 8046.5625MB
% 0.16/0.42  % OS       : Linux 6.8.0-71-generic
% 0.16/0.42  % CPULimit : 300
% 0.16/0.42  % WCLimit  : 300
% 0.16/0.42  % DateTime : Mon Sep 21 08:06:05 UTC 2026
% 0.16/0.42  % CPUTime  : 
% 0.16/0.42  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.48  Running first-order theorem proving
% 0.16/0.48  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.24/0.54  % Version: 3.5.1
% 0.24/0.54  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.54  % Starting new_bool_3 with 300s (1) cores
% 0.24/0.54  % Starting new_bool_1 with 300s (1) cores
% 0.24/0.54  % Starting sh5l with 300s (1) cores
% 0.24/0.54  % new_bool_3 with pid 994474 completed with status 0
% 0.24/0.54  % Result found by new_bool_3
% 0.24/0.54  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.54  % Starting new_bool_3 with 300s (1) cores
% 0.24/0.54  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.54  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.54  % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.24/0.54  % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.24/0.54  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.54  % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.54  % SubtermCWHack with pid 994477 completed with status 0
% 0.24/0.54  % Result found by SubtermCWHack
% 0.24/0.54  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.54  % Starting new_bool_3 with 300s (1) cores
% 0.24/0.54  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.54  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.54  % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.24/0.54  % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.24/0.54  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.54  % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.54  % Preprocessing time       : 0.001 s
% 0.24/0.54  
% 0.24/0.54  % Proof found!
% 0.24/0.54  % SZS status Unsatisfiable
% 0.24/0.54  % SZS output start CNFRefutation
% See solution above
% 0.24/0.54  % Parsed axioms                        : 198
% 0.24/0.54  % Removed by relevancy pruning/SinE    : 160
% 0.24/0.54  % Initial clauses                      : 38
% 0.24/0.54  % Removed in clause preprocessing      : 0
% 0.24/0.54  % Initial clauses in saturation        : 38
% 0.24/0.54  % Processed clauses                    : 132
% 0.24/0.54  % ...of these trivial                  : 3
% 0.24/0.54  % ...subsumed                          : 31
% 0.24/0.54  % ...remaining for further processing  : 98
% 0.24/0.54  % Other redundant clauses eliminated   : 8
% 0.24/0.54  % Clauses deleted for lack of memory   : 0
% 0.24/0.54  % Backward-subsumed                    : 22
% 0.24/0.54  % Backward-rewritten                   : 4
% 0.24/0.54  % Generated clauses                    : 447
% 0.24/0.54  % ...of the previous two non-redundant : 328
% 0.24/0.54  % ...aggressively subsumed             : 0
% 0.24/0.54  % Contextual simplify-reflections      : 2
% 0.24/0.54  % Paramodulations                      : 435
% 0.24/0.54  % Factorizations                       : 0
% 0.24/0.54  % NegExts                              : 0
% 0.24/0.54  % Equation resolutions                 : 12
% 0.24/0.54  % Disequality decompositions           : 0
% 0.24/0.54  % Total rewrite steps                  : 390
% 0.24/0.54  % ...of those cached                   : 379
% 0.24/0.54  % Propositional unsat checks           : 0
% 0.24/0.54  %    Propositional check models        : 0
% 0.24/0.54  %    Propositional check unsatisfiable : 0
% 0.24/0.54  %    Propositional clauses             : 0
% 0.24/0.54  %    Propositional clauses after purity: 0
% 0.24/0.54  %    Propositional unsat core size     : 0
% 0.24/0.54  %    Propositional preprocessing time  : 0.000
% 0.24/0.54  %    Propositional encoding time       : 0.000
% 0.24/0.54  %    Propositional solver time         : 0.000
% 0.24/0.54  %    Success case prop preproc time    : 0.000
% 0.24/0.54  %    Success case prop encoding time   : 0.000
% 0.24/0.54  %    Success case prop solver time     : 0.000
% 0.24/0.54  % Current number of processed clauses  : 68
% 0.24/0.54  %    Positive orientable unit clauses  : 12
% 0.24/0.54  %    Positive unorientable unit clauses: 0
% 0.24/0.54  %    Negative unit clauses             : 3
% 0.24/0.54  %    Non-unit-clauses                  : 53
% 0.24/0.54  % Current number of unprocessed clauses: 197
% 0.24/0.54  % ...number of literals in the above   : 1008
% 0.24/0.54  % Current number of archived formulas  : 0
% 0.24/0.54  % Current number of archived clauses   : 27
% 0.24/0.54  % Clause-clause subsumption calls (NU) : 425
% 0.24/0.54  % Rec. Clause-clause subsumption calls : 244
% 0.24/0.54  % Non-unit clause-clause subsumptions  : 43
% 0.24/0.54  % Unit Clause-clause subsumption calls : 51
% 0.24/0.54  % Rewrite failures with RHS unbound    : 0
% 0.24/0.54  % BW rewrite match attempts            : 4
% 0.24/0.54  % BW rewrite match successes           : 4
% 0.24/0.54  % Condensation attempts                : 0
% 0.24/0.54  % Condensation successes               : 0
% 0.24/0.54  % Termbank termtop insertions          : 10226
% 0.24/0.54  % Search garbage collected termcells   : 911
% 0.24/0.54  
% 0.24/0.54  % -------------------------------------------------
% 0.24/0.54  % User time                : 0.011 s
% 0.24/0.54  % System time              : 0.004 s
% 0.24/0.54  % Total time               : 0.015 s
% 0.24/0.54  % Maximum resident set size: 4068 pages
% 0.24/0.54  
% 0.24/0.54  % -------------------------------------------------
% 0.24/0.54  % User time                : 0.014 s
% 0.24/0.54  % System time              : 0.009 s
% 0.24/0.54  % Total time               : 0.024 s
% 0.24/0.54  % Maximum resident set size: 5120 pages
% 0.24/0.54  % E exiting
%------------------------------------------------------------------------------