↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWC348-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:44:02 PM UTC 2026

% Result   : Unsatisfiable 0.22s 0.57s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   43 (  23 unt;   3 nHn;  41 RR)
%            Number of literals    :   76 (  15 equ;  35 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   18 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause66,axiom,
    ( ~ ssItem(X1)
    | strictorderedP(cons(X1,nil)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause66) ).

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

cnf(co1_8,negated_conjecture,
    ( ~ neq(sk4,nil)
    | singletonP(sk3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

cnf(co1_9,negated_conjecture,
    ( ~ strictorderedP(sk1)
    | ~ segmentP(sk2,sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

cnf(co1_7,negated_conjecture,
    segmentP(sk4,sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

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

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

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

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

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

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

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

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

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

cnf(c_0_14,plain,
    ( ~ ssItem(X1)
    | strictorderedP(cons(X1,nil)) ),
    inference(fof_simplification,[status(thm)],[clause66]) ).

cnf(c_0_15,plain,
    ( ~ ssList(X1)
    | ~ singletonP(X1)
    | cons(skaf44(X1),nil) = X1 ),
    inference(fof_simplification,[status(thm)],[clause101]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ neq(sk4,nil)
    | singletonP(sk3) ),
    inference(fof_simplification,[status(thm)],[co1_8]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ strictorderedP(sk1)
    | ~ segmentP(sk2,sk1) ),
    inference(fof_simplification,[status(thm)],[co1_9]) ).

cnf(c_0_18,negated_conjecture,
    segmentP(sk4,sk3),
    co1_7 ).

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

cnf(c_0_20,plain,
    ( ~ ssItem(X1)
    | strictorderedP(cons(X1,nil)) ),
    c_0_14 ).

cnf(c_0_21,plain,
    ( ~ ssList(X1)
    | ~ singletonP(X1)
    | cons(skaf44(X1),nil) = X1 ),
    c_0_15 ).

cnf(c_0_22,axiom,
    ssItem(skaf44(X1)),
    clause47 ).

cnf(c_0_23,negated_conjecture,
    ( ~ neq(sk4,nil)
    | singletonP(sk3) ),
    c_0_16 ).

cnf(c_0_24,negated_conjecture,
    ( ~ strictorderedP(sk1)
    | ~ segmentP(sk2,sk1) ),
    c_0_17 ).

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

cnf(c_0_26,negated_conjecture,
    segmentP(sk4,sk1),
    inference(rw,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_27,plain,
    ( ~ ssList(X1)
    | ~ singletonP(X1)
    | strictorderedP(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ neq(sk4,nil)
    | singletonP(sk1) ),
    inference(rw,[status(thm)],[c_0_23,c_0_19]) ).

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

cnf(c_0_30,negated_conjecture,
    ~ strictorderedP(sk1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).

cnf(c_0_31,plain,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | X2 = X1
    | neq(X2,X1) ),
    inference(fof_simplification,[status(thm)],[clause100]) ).

cnf(c_0_32,negated_conjecture,
    ~ neq(sk4,nil),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30]) ).

cnf(c_0_33,plain,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | X2 = X1
    | neq(X2,X1) ),
    c_0_31 ).

cnf(c_0_34,negated_conjecture,
    ssList(sk4),
    co1_4 ).

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

cnf(c_0_36,plain,
    ( ~ ssList(X1)
    | ~ segmentP(nil,X1)
    | nil = X1 ),
    inference(fof_simplification,[status(thm)],[clause80]) ).

cnf(c_0_37,negated_conjecture,
    sk4 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).

cnf(c_0_38,plain,
    ( ~ ssList(X1)
    | ~ segmentP(nil,X1)
    | nil = X1 ),
    c_0_36 ).

cnf(c_0_39,negated_conjecture,
    segmentP(nil,sk1),
    inference(rw,[status(thm)],[c_0_26,c_0_37]) ).

cnf(c_0_40,negated_conjecture,
    sk1 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_29])]) ).

cnf(c_0_41,axiom,
    strictorderedP(nil),
    clause3 ).

cnf(c_0_42,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_40]),c_0_41])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWC348-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.18/0.45  % Computer : n014.cluster.edu
% 0.18/0.45  % Model    : x86_64 x86_64
% 0.18/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45  % Memory   : 8046.5625MB
% 0.18/0.45  % OS       : Linux 6.8.0-71-generic
% 0.18/0.45  % CPULimit : 300
% 0.18/0.45  % WCLimit  : 300
% 0.18/0.45  % DateTime : Mon Sep 21 08:17:34 UTC 2026
% 0.18/0.45  % CPUTime  : 
% 0.18/0.45  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.52  Running first-order theorem proving
% 0.22/0.52  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.22/0.57  % Version: 3.5.1
% 0.22/0.57  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.57  % Starting new_bool_3 with 300s (1) cores
% 0.22/0.57  % Starting new_bool_1 with 300s (1) cores
% 0.22/0.57  % Starting sh5l with 300s (1) cores
% 0.22/0.57  % sh5l with pid 3619166 completed with status 0
% 0.22/0.57  % Result found by sh5l
% 0.22/0.57  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.57  % Starting new_bool_3 with 300s (1) cores
% 0.22/0.57  % Starting new_bool_1 with 300s (1) cores
% 0.22/0.57  % Starting sh5l with 300s (1) cores
% 0.22/0.57  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.57  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.57  % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.22/0.57  % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.57  % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.57  % SubtermCWHack with pid 3619173 completed with status 0
% 0.22/0.57  % Result found by SubtermCWHack
% 0.22/0.57  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.57  % Starting new_bool_3 with 300s (1) cores
% 0.22/0.57  % Starting new_bool_1 with 300s (1) cores
% 0.22/0.57  % Starting sh5l with 300s (1) cores
% 0.22/0.57  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.57  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.57  % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.22/0.57  % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.57  % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.57  % Preprocessing time       : 0.004 s
% 0.22/0.57  
% 0.22/0.57  % Proof found!
% 0.22/0.57  % SZS status Unsatisfiable
% 0.22/0.57  % SZS output start CNFRefutation
% See solution above
% 0.22/0.57  % Parsed axioms                        : 194
% 0.22/0.57  % Removed by relevancy pruning/SinE    : 35
% 0.22/0.57  % Initial clauses                      : 159
% 0.22/0.57  % Removed in clause preprocessing      : 0
% 0.22/0.57  % Initial clauses in saturation        : 159
% 0.22/0.57  % Processed clauses                    : 94
% 0.22/0.57  % ...of these trivial                  : 0
% 0.22/0.57  % ...subsumed                          : 4
% 0.22/0.57  % ...remaining for further processing  : 90
% 0.22/0.57  % Other redundant clauses eliminated   : 7
% 0.22/0.57  % Clauses deleted for lack of memory   : 0
% 0.22/0.57  % Backward-subsumed                    : 1
% 0.22/0.57  % Backward-rewritten                   : 10
% 0.22/0.57  % Generated clauses                    : 20
% 0.22/0.57  % ...of the previous two non-redundant : 18
% 0.22/0.57  % ...aggressively subsumed             : 0
% 0.22/0.57  % Contextual simplify-reflections      : 0
% 0.22/0.57  % Paramodulations                      : 14
% 0.22/0.57  % Factorizations                       : 0
% 0.22/0.57  % NegExts                              : 0
% 0.22/0.57  % Equation resolutions                 : 7
% 0.22/0.57  % Disequality decompositions           : 0
% 0.22/0.57  % Total rewrite steps                  : 40
% 0.22/0.57  % ...of those cached                   : 29
% 0.22/0.57  % Propositional unsat checks           : 0
% 0.22/0.57  %    Propositional check models        : 0
% 0.22/0.57  %    Propositional check unsatisfiable : 0
% 0.22/0.57  %    Propositional clauses             : 0
% 0.22/0.57  %    Propositional clauses after purity: 0
% 0.22/0.57  %    Propositional unsat core size     : 0
% 0.22/0.57  %    Propositional preprocessing time  : 0.000
% 0.22/0.57  %    Propositional encoding time       : 0.000
% 0.22/0.57  %    Propositional solver time         : 0.000
% 0.22/0.57  %    Success case prop preproc time    : 0.000
% 0.22/0.57  %    Success case prop encoding time   : 0.000
% 0.22/0.57  %    Success case prop solver time     : 0.000
% 0.22/0.57  % Current number of processed clauses  : 75
% 0.22/0.57  %    Positive orientable unit clauses  : 35
% 0.22/0.57  %    Positive unorientable unit clauses: 0
% 0.22/0.57  %    Negative unit clauses             : 2
% 0.22/0.57  %    Non-unit-clauses                  : 38
% 0.22/0.57  % Current number of unprocessed clauses: 83
% 0.22/0.57  % ...number of literals in the above   : 408
% 0.22/0.57  % Current number of archived formulas  : 0
% 0.22/0.57  % Current number of archived clauses   : 11
% 0.22/0.57  % Clause-clause subsumption calls (NU) : 309
% 0.22/0.57  % Rec. Clause-clause subsumption calls : 247
% 0.22/0.57  % Non-unit clause-clause subsumptions  : 2
% 0.22/0.57  % Unit Clause-clause subsumption calls : 42
% 0.22/0.57  % Rewrite failures with RHS unbound    : 0
% 0.22/0.57  % BW rewrite match attempts            : 4
% 0.22/0.57  % BW rewrite match successes           : 4
% 0.22/0.57  % Condensation attempts                : 0
% 0.22/0.57  % Condensation successes               : 0
% 0.22/0.57  % Termbank termtop insertions          : 6934
% 0.22/0.57  % Search garbage collected termcells   : 626
% 0.22/0.57  
% 0.22/0.57  % -------------------------------------------------
% 0.22/0.57  % User time                : 0.016 s
% 0.22/0.57  % System time              : 0.003 s
% 0.22/0.57  % Total time               : 0.019 s
% 0.22/0.57  % Maximum resident set size: 4012 pages
% 0.22/0.57  
% 0.22/0.57  % -------------------------------------------------
% 0.22/0.57  % User time                : 0.023 s
% 0.22/0.57  % System time              : 0.010 s
% 0.22/0.57  % Total time               : 0.033 s
% 0.22/0.57  % Maximum resident set size: 4864 pages
% 0.22/0.57  % E exiting
%------------------------------------------------------------------------------