↑ Up

E---3.5.1.UNS-CRf.s

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

% Result   : Unsatisfiable 0.20s 10.58s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   35 (  20 unt;   6 nHn;  25 RR)
%            Number of literals    :   88 (   8 equ;  55 neg)
%            Maximal clause size   :    9 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   2 con; 0-2 aty)
%            Number of variables   :   49 (  10 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_13,negated_conjecture,
    ~ duplicatefreeP(sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).

cnf(clause181,axiom,
    ( ~ ssList(X6)
    | ~ strictorderedP(X6)
    | ~ ssItem(X2)
    | ~ ssItem(X4)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X5)
    | app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
    | lt(X2,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause181) ).

cnf(clause72,axiom,
    ( ~ ssList(X1)
    | ssItem(X2)
    | duplicatefreeP(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).

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

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

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

cnf(clause162,axiom,
    ( ~ ssList(X1)
    | app(app(skaf75(X1),cons(skaf74(X1),skaf76(X1))),cons(skaf74(X1),skaf77(X1))) = X1
    | duplicatefreeP(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause162) ).

cnf(clause18,axiom,
    ssList(skaf77(X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause18) ).

cnf(clause19,axiom,
    ssList(skaf76(X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause19) ).

cnf(clause20,axiom,
    ssList(skaf75(X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause20) ).

cnf(co1_10,negated_conjecture,
    strictorderedP(sk3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

cnf(c_0_11,negated_conjecture,
    ~ duplicatefreeP(sk1),
    inference(fof_simplification,[status(thm)],[co1_13]) ).

cnf(c_0_12,plain,
    ( ~ ssList(X6)
    | ~ strictorderedP(X6)
    | ~ ssItem(X2)
    | ~ ssItem(X4)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X5)
    | app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
    | lt(X2,X4) ),
    inference(fof_simplification,[status(thm)],[clause181]) ).

cnf(c_0_13,plain,
    ( ~ ssList(X1)
    | ssItem(X2)
    | duplicatefreeP(X1) ),
    inference(fof_simplification,[status(thm)],[clause72]) ).

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

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

cnf(c_0_16,negated_conjecture,
    ~ duplicatefreeP(sk1),
    c_0_11 ).

cnf(c_0_17,plain,
    ( ~ ssList(X6)
    | ~ strictorderedP(X6)
    | ~ ssItem(X2)
    | ~ ssItem(X4)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X5)
    | app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
    | lt(X2,X4) ),
    c_0_12 ).

cnf(c_0_18,plain,
    ( ~ ssList(X1)
    | ssItem(X2)
    | duplicatefreeP(X1) ),
    c_0_13 ).

cnf(c_0_19,negated_conjecture,
    ssList(sk3),
    inference(rw,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    ~ duplicatefreeP(sk3),
    inference(rw,[status(thm)],[c_0_16,c_0_15]) ).

cnf(c_0_21,plain,
    ( ~ ssItem(X1)
    | ~ lt(X1,X1) ),
    inference(fof_simplification,[status(thm)],[clause63]) ).

cnf(c_0_22,plain,
    ( ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
    | ~ ssList(X3)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | lt(X1,X2) ),
    inference(er,[status(thm)],[c_0_17]) ).

cnf(c_0_23,negated_conjecture,
    ssItem(X1),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).

cnf(c_0_24,plain,
    ( ~ ssList(X1)
    | app(app(skaf75(X1),cons(skaf74(X1),skaf76(X1))),cons(skaf74(X1),skaf77(X1))) = X1
    | duplicatefreeP(X1) ),
    inference(fof_simplification,[status(thm)],[clause162]) ).

cnf(c_0_25,plain,
    ( ~ ssItem(X1)
    | ~ lt(X1,X1) ),
    c_0_21 ).

cnf(c_0_26,plain,
    ( ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
    | ~ ssList(X3)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
    | lt(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23])]) ).

cnf(c_0_27,plain,
    ( ~ ssList(X1)
    | app(app(skaf75(X1),cons(skaf74(X1),skaf76(X1))),cons(skaf74(X1),skaf77(X1))) = X1
    | duplicatefreeP(X1) ),
    c_0_24 ).

cnf(c_0_28,axiom,
    ssList(skaf77(X1)),
    clause18 ).

cnf(c_0_29,axiom,
    ssList(skaf76(X1)),
    clause19 ).

cnf(c_0_30,axiom,
    ssList(skaf75(X1)),
    clause20 ).

cnf(c_0_31,plain,
    ~ lt(X1,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_23])]) ).

cnf(c_0_32,plain,
    ( ~ strictorderedP(X1)
    | ~ ssList(X1)
    | duplicatefreeP(X1) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]),c_0_30])]),c_0_31]) ).

cnf(c_0_33,negated_conjecture,
    strictorderedP(sk3),
    co1_10 ).

cnf(c_0_34,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_32]),c_0_19]),c_0_33])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWC181-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/10.44  % Computer : n026.cluster.edu
% 0.17/10.44  % Model    : x86_64 x86_64
% 0.17/10.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/10.44  % Memory   : 8046.5625MB
% 0.17/10.44  % OS       : Linux 6.8.0-71-generic
% 0.17/10.44  % CPULimit : 300
% 0.17/10.44  % WCLimit  : 300
% 0.17/10.44  % DateTime : Mon Sep 21 08:05:18 UTC 2026
% 0.17/10.45  % CPUTime  : 
% 0.17/10.45  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/10.49  Running first-order theorem proving
% 0.17/10.49  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.20/10.58  % Version: 3.5.1
% 0.20/10.58  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/10.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/10.58  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/10.58  % Starting new_bool_3 with 300s (1) cores
% 0.20/10.58  % Starting new_bool_1 with 300s (1) cores
% 0.20/10.58  % Starting sh5l with 300s (1) cores
% 0.20/10.58  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1794594 completed with status 0
% 0.20/10.58  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/10.58  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/10.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/10.58  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/10.58  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/10.58  % No SInE strategy applied
% 0.20/10.58  % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.20/10.58  % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/10.58  % Starting SubtermCWHack with 136s (1) cores
% 0.20/10.58  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/10.58  % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.20/10.58  % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.20/10.58  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.20/10.58  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1794601 completed with status 0
% 0.20/10.58  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/10.58  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/10.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/10.58  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/10.58  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/10.58  % No SInE strategy applied
% 0.20/10.58  % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.20/10.58  % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/10.58  % Starting SubtermCWHack with 136s (1) cores
% 0.20/10.58  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/10.58  % Preprocessing time       : 0.004 s
% 0.20/10.58  % Presaturation interreduction done
% 0.20/10.58  
% 0.20/10.58  % Proof found!
% 0.20/10.58  % SZS status Unsatisfiable
% 0.20/10.58  % SZS output start CNFRefutation
% See solution above
% 0.20/10.58  % Parsed axioms                        : 199
% 0.20/10.58  % Removed by relevancy pruning/SinE    : 0
% 0.20/10.58  % Initial clauses                      : 199
% 0.20/10.58  % Removed in clause preprocessing      : 0
% 0.20/10.58  % Initial clauses in saturation        : 199
% 0.20/10.58  % Processed clauses                    : 594
% 0.20/10.58  % ...of these trivial                  : 3
% 0.20/10.58  % ...subsumed                          : 100
% 0.20/10.58  % ...remaining for further processing  : 491
% 0.20/10.58  % Other redundant clauses eliminated   : 72
% 0.20/10.58  % Clauses deleted for lack of memory   : 0
% 0.20/10.58  % Backward-subsumed                    : 7
% 0.20/10.58  % Backward-rewritten                   : 28
% 0.20/10.58  % Generated clauses                    : 1704
% 0.20/10.58  % ...of the previous two non-redundant : 1375
% 0.20/10.58  % ...aggressively subsumed             : 0
% 0.20/10.58  % Contextual simplify-reflections      : 4
% 0.20/10.58  % Paramodulations                      : 1628
% 0.20/10.58  % Factorizations                       : 0
% 0.20/10.58  % NegExts                              : 0
% 0.20/10.58  % Equation resolutions                 : 77
% 0.20/10.58  % Disequality decompositions           : 0
% 0.20/10.58  % Total rewrite steps                  : 1964
% 0.20/10.58  % ...of those cached                   : 1851
% 0.20/10.58  % Propositional unsat checks           : 0
% 0.20/10.58  %    Propositional check models        : 0
% 0.20/10.58  %    Propositional check unsatisfiable : 0
% 0.20/10.58  %    Propositional clauses             : 0
% 0.20/10.58  %    Propositional clauses after purity: 0
% 0.20/10.58  %    Propositional unsat core size     : 0
% 0.20/10.58  %    Propositional preprocessing time  : 0.000
% 0.20/10.58  %    Propositional encoding time       : 0.000
% 0.20/10.58  %    Propositional solver time         : 0.000
% 0.20/10.58  %    Success case prop preproc time    : 0.000
% 0.20/10.58  %    Success case prop encoding time   : 0.000
% 0.20/10.58  %    Success case prop solver time     : 0.000
% 0.20/10.58  % Current number of processed clauses  : 242
% 0.20/10.58  %    Positive orientable unit clauses  : 59
% 0.20/10.58  %    Positive unorientable unit clauses: 0
% 0.20/10.58  %    Negative unit clauses             : 6
% 0.20/10.58  %    Non-unit-clauses                  : 177
% 0.20/10.58  % Current number of unprocessed clauses: 1138
% 0.20/10.58  % ...number of literals in the above   : 5396
% 0.20/10.58  % Current number of archived formulas  : 0
% 0.20/10.58  % Current number of archived clauses   : 226
% 0.20/10.58  % Clause-clause subsumption calls (NU) : 14036
% 0.20/10.58  % Rec. Clause-clause subsumption calls : 3858
% 0.20/10.58  % Non-unit clause-clause subsumptions  : 98
% 0.20/10.58  % Unit Clause-clause subsumption calls : 85
% 0.20/10.58  % Rewrite failures with RHS unbound    : 0
% 0.20/10.58  % BW rewrite match attempts            : 21
% 0.20/10.58  % BW rewrite match successes           : 18
% 0.20/10.58  % Condensation attempts                : 0
% 0.20/10.58  % Condensation successes               : 0
% 0.20/10.58  % Termbank termtop insertions          : 35248
% 0.20/10.58  % Search garbage collected termcells   : 554
% 0.20/10.58  
% 0.20/10.58  % -------------------------------------------------
% 0.20/10.58  % User time                : 0.058 s
% 0.20/10.58  % System time              : 0.006 s
% 0.20/10.58  % Total time               : 0.065 s
% 0.20/10.58  % Maximum resident set size: 4068 pages
% 0.20/10.58  
% 0.20/10.58  % -------------------------------------------------
% 0.20/10.58  % User time                : 0.283 s
% 0.20/10.58  % System time              : 0.030 s
% 0.20/10.58  % Total time               : 0.313 s
% 0.20/10.58  % Maximum resident set size: 5120 pages
% 0.20/10.58  % E exiting
%------------------------------------------------------------------------------