↑ Up

E-SAT---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SWC070-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 : n013.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:47 PM UTC 2026

% Result   : Unsatisfiable 0.16s 5.87s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   52 (  19 unt;   6 nHn;  50 RR)
%            Number of literals    :  125 (  37 equ;  78 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   45 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause118,axiom,
    ( ~ ssList(X1)
    | ~ ssList(X2)
    | app(X1,X2) != nil
    | nil = X1 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).

cnf(clause132,axiom,
    ( ~ ssList(X1)
    | ~ ssList(X2)
    | ~ frontsegP(X1,X2)
    | app(X2,skaf45(X1,X2)) = X1 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).

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

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

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(co1_2,negated_conjecture,
    ssList(sk2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).

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

cnf(co1_7,negated_conjecture,
    ( ~ segmentP(sk1,X1)
    | ~ segmentP(sk2,X1)
    | ~ neq(X1,nil)
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

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

cnf(clause173,axiom,
    ( ~ ssList(X4)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | app(app(X1,X2),X3) != X4
    | segmentP(X4,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).

cnf(clause74,axiom,
    ( ~ ssList(X1)
    | app(nil,X1) = X1 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).

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

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

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

cnf(clause57,axiom,
    ( ~ ssList(X1)
    | segmentP(X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).

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

cnf(c_0_17,plain,
    ( ~ ssList(X1)
    | ~ ssList(X2)
    | ~ frontsegP(X1,X2)
    | app(X2,skaf45(X1,X2)) = X1 ),
    inference(fof_simplification,[status(thm)],[clause132]) ).

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

cnf(c_0_19,plain,
    ( ~ ssList(X1)
    | ~ ssList(X2)
    | app(X1,X2) != nil
    | nil = X1 ),
    c_0_16 ).

cnf(c_0_20,plain,
    ( ~ ssList(X1)
    | ~ ssList(X2)
    | ~ frontsegP(X1,X2)
    | app(X2,skaf45(X1,X2)) = X1 ),
    c_0_17 ).

cnf(c_0_21,axiom,
    ssList(skaf45(X1,X2)),
    clause51 ).

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

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

cnf(c_0_24,negated_conjecture,
    ssList(sk2),
    co1_2 ).

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

cnf(c_0_26,negated_conjecture,
    ( nil != sk1
    | nil != sk2 ),
    c_0_18 ).

cnf(c_0_27,negated_conjecture,
    ( ~ segmentP(sk1,X1)
    | ~ segmentP(sk2,X1)
    | ~ neq(X1,nil)
    | ~ ssList(X1) ),
    inference(fof_simplification,[status(thm)],[co1_7]) ).

cnf(c_0_28,plain,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | ~ frontsegP(X2,X1)
    | X2 != nil
    | nil = X1 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).

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

cnf(c_0_30,negated_conjecture,
    ssList(sk3),
    inference(rw,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_31,negated_conjecture,
    ssList(sk4),
    inference(rw,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_32,negated_conjecture,
    ( sk4 != nil
    | sk3 != nil ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_23]),c_0_25]) ).

cnf(c_0_33,plain,
    ( ~ ssList(X4)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | app(app(X1,X2),X3) != X4
    | segmentP(X4,X2) ),
    inference(fof_simplification,[status(thm)],[clause173]) ).

cnf(c_0_34,plain,
    ( ~ ssList(X1)
    | app(nil,X1) = X1 ),
    inference(fof_simplification,[status(thm)],[clause74]) ).

cnf(c_0_35,negated_conjecture,
    ( ~ segmentP(sk1,X1)
    | ~ segmentP(sk2,X1)
    | ~ neq(X1,nil)
    | ~ ssList(X1) ),
    c_0_27 ).

cnf(c_0_36,negated_conjecture,
    ( neq(sk3,nil)
    | nil = sk4 ),
    co1_9 ).

cnf(c_0_37,negated_conjecture,
    sk4 != nil,
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]),c_0_32]) ).

cnf(c_0_38,plain,
    ( ~ ssList(X4)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | app(app(X1,X2),X3) != X4
    | segmentP(X4,X2) ),
    c_0_33 ).

cnf(c_0_39,plain,
    ( ~ ssList(X1)
    | app(nil,X1) = X1 ),
    c_0_34 ).

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

cnf(c_0_41,negated_conjecture,
    ( ~ ssList(X1)
    | ~ segmentP(sk4,X1)
    | ~ segmentP(sk3,X1)
    | ~ neq(X1,nil) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_23]),c_0_25]) ).

cnf(c_0_42,negated_conjecture,
    neq(sk3,nil),
    inference(sr,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_43,plain,
    ( ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | app(X2,X3) != X1
    | segmentP(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).

cnf(c_0_44,negated_conjecture,
    ( frontsegP(sk4,sk3)
    | nil = sk4 ),
    co1_10 ).

cnf(c_0_45,negated_conjecture,
    ( ~ segmentP(sk4,sk3)
    | ~ segmentP(sk3,sk3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_30])]) ).

cnf(c_0_46,plain,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | ~ frontsegP(X1,X2)
    | segmentP(X1,X2) ),
    inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_20]),c_0_21])])]) ).

cnf(c_0_47,negated_conjecture,
    frontsegP(sk4,sk3),
    inference(sr,[status(thm)],[c_0_44,c_0_37]) ).

cnf(c_0_48,plain,
    ( ~ ssList(X1)
    | segmentP(X1,X1) ),
    inference(fof_simplification,[status(thm)],[clause57]) ).

cnf(c_0_49,negated_conjecture,
    ~ segmentP(sk3,sk3),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_31]),c_0_30])]) ).

cnf(c_0_50,plain,
    ( ~ ssList(X1)
    | segmentP(X1,X1) ),
    c_0_48 ).

cnf(c_0_51,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_30])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC070-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.39  % Computer : n013.cluster.edu
% 0.11/5.39  % Model    : x86_64 x86_64
% 0.11/5.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39  % Memory   : 8046.5625MB
% 0.11/5.39  % OS       : Linux 6.8.0-71-generic
% 0.11/5.39  % CPULimit : 300
% 0.11/5.39  % WCLimit  : 300
% 0.11/5.39  % DateTime : Mon Sep 21 07:53:12 UTC 2026
% 0.11/5.39  % CPUTime  : 
% 0.11/5.39  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.44  Running first-order theorem proving
% 0.16/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.16/5.87  % Version: 3.5.1
% 0.16/5.87  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/5.87  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.87  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/5.87  % Starting new_bool_3 with 300s (1) cores
% 0.16/5.87  % Starting new_bool_1 with 300s (1) cores
% 0.16/5.87  % Starting sh5l with 300s (1) cores
% 0.16/5.87  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 307815 completed with status 0
% 0.16/5.87  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.16/5.87  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/5.87  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.87  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/5.87  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/5.87  % No SInE strategy applied
% 0.16/5.87  % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.16/5.87  % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/5.87  % Starting SubtermCWHack with 136s (1) cores
% 0.16/5.87  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/5.87  % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.16/5.87  % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.16/5.87  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.16/5.87  % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 307824 completed with status 0
% 0.16/5.87  % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.16/5.87  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/5.87  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.87  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/5.87  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/5.87  % No SInE strategy applied
% 0.16/5.87  % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.16/5.87  % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/5.87  % Starting SubtermCWHack with 136s (1) cores
% 0.16/5.87  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/5.87  % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.16/5.87  % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.16/5.87  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.16/5.87  % Preprocessing time       : 0.007 s
% 0.16/5.87  
% 0.16/5.87  % Proof found!
% 0.16/5.87  % SZS status Unsatisfiable
% 0.16/5.87  % SZS output start CNFRefutation
% See solution above
% 0.16/5.87  % Parsed axioms                        : 197
% 0.16/5.87  % Removed by relevancy pruning/SinE    : 0
% 0.16/5.87  % Initial clauses                      : 197
% 0.16/5.87  % Removed in clause preprocessing      : 0
% 0.16/5.87  % Initial clauses in saturation        : 197
% 0.16/5.87  % Processed clauses                    : 715
% 0.16/5.87  % ...of these trivial                  : 9
% 0.16/5.87  % ...subsumed                          : 164
% 0.16/5.87  % ...remaining for further processing  : 542
% 0.16/5.87  % Other redundant clauses eliminated   : 41
% 0.16/5.87  % Clauses deleted for lack of memory   : 0
% 0.16/5.87  % Backward-subsumed                    : 18
% 0.16/5.87  % Backward-rewritten                   : 6
% 0.16/5.87  % Generated clauses                    : 6108
% 0.16/5.87  % ...of the previous two non-redundant : 5907
% 0.16/5.87  % ...aggressively subsumed             : 0
% 0.16/5.87  % Contextual simplify-reflections      : 21
% 0.16/5.87  % Paramodulations                      : 5980
% 0.16/5.88  % Factorizations                       : 40
% 0.16/5.88  % NegExts                              : 0
% 0.16/5.88  % Equation resolutions                 : 81
% 0.16/5.88  % Disequality decompositions           : 0
% 0.16/5.88  % Total rewrite steps                  : 2035
% 0.16/5.88  % ...of those cached                   : 1889
% 0.16/5.88  % Propositional unsat checks           : 0
% 0.16/5.88  %    Propositional check models        : 0
% 0.16/5.88  %    Propositional check unsatisfiable : 0
% 0.16/5.88  %    Propositional clauses             : 0
% 0.16/5.88  %    Propositional clauses after purity: 0
% 0.16/5.88  %    Propositional unsat core size     : 0
% 0.16/5.88  %    Propositional preprocessing time  : 0.000
% 0.16/5.88  %    Propositional encoding time       : 0.000
% 0.16/5.88  %    Propositional solver time         : 0.000
% 0.16/5.88  %    Success case prop preproc time    : 0.000
% 0.16/5.88  %    Success case prop encoding time   : 0.000
% 0.16/5.88  %    Success case prop solver time     : 0.000
% 0.16/5.88  % Current number of processed clauses  : 506
% 0.16/5.88  %    Positive orientable unit clauses  : 70
% 0.16/5.88  %    Positive unorientable unit clauses: 0
% 0.16/5.88  %    Negative unit clauses             : 8
% 0.16/5.88  %    Non-unit-clauses                  : 428
% 0.16/5.88  % Current number of unprocessed clauses: 5362
% 0.16/5.88  % ...number of literals in the above   : 20276
% 0.16/5.88  % Current number of archived formulas  : 0
% 0.16/5.88  % Current number of archived clauses   : 31
% 0.16/5.88  % Clause-clause subsumption calls (NU) : 20484
% 0.16/5.88  % Rec. Clause-clause subsumption calls : 5060
% 0.16/5.88  % Non-unit clause-clause subsumptions  : 161
% 0.16/5.88  % Unit Clause-clause subsumption calls : 1354
% 0.16/5.88  % Rewrite failures with RHS unbound    : 0
% 0.16/5.88  % BW rewrite match attempts            : 5
% 0.16/5.88  % BW rewrite match successes           : 5
% 0.16/5.88  % Condensation attempts                : 0
% 0.16/5.88  % Condensation successes               : 0
% 0.16/5.88  % Termbank termtop insertions          : 104850
% 0.16/5.88  % Search garbage collected termcells   : 541
% 0.16/5.88  
% 0.16/5.88  % -------------------------------------------------
% 0.16/5.88  % User time                : 0.252 s
% 0.16/5.88  % System time              : 0.021 s
% 0.16/5.88  % Total time               : 0.273 s
% 0.16/5.88  % Maximum resident set size: 3812 pages
% 0.16/5.88  
% 0.16/5.88  % -------------------------------------------------
% 0.16/5.88  % User time                : 1.337 s
% 0.16/5.88  % System time              : 0.075 s
% 0.16/5.88  % Total time               : 1.412 s
% 0.16/5.88  % Maximum resident set size: 5120 pages
% 0.16/5.88  % E exiting
%------------------------------------------------------------------------------