↑ Up

E---3.5.1.SAT-Sat.s

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

% Computer : n004.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 01:00:37 PM UTC 2026

% Result   : Satisfiable 10.87s 2.80s
% Output   : Saturation 10.87s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_163ERROR: Could not build tree for root c_0_174ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_33,plain,
    ( ~ cTorF(X1)
    | X1 = iminus4
    | X1 = iplus4 ),
    inference(split_conjunct,[status(thm)],[c_0_30]),
    [final] ).

cnf(c_0_77,plain,
    cTorF(iT),
    inference(er,[status(thm)],[c_0_64]),
    [final] ).

cnf(c_0_140,plain,
    iplus8 = iT,
    inference(csr,[status(thm)],[inference(ef,[status(thm)],[c_0_134]),c_0_125]),
    [final] ).

cnf(c_0_149,plain,
    cTorF(iminus4),
    inference(er,[status(thm)],[c_0_142]),
    [final] ).

cnf(c_0_166,plain,
    iminus8 = iplus3,
    inference(sr,[status(thm)],[c_0_136,c_0_155]),
    [final] ).

cnf(c_0_174,plain,
    cTorF(iplus4),
    inference(er,[status(thm)],[c_0_163]),
    [final] ).

cnf(c_0_176,plain,
    iminus7 = iplus3,
    inference(sr,[status(thm)],[c_0_165,c_0_155]),
    [final] ).

cnf(c_0_177,plain,
    iplus3 != iT,
    inference(rw,[status(thm)],[c_0_155,c_0_166]),
    [final] ).

cnf(c_0_180,plain,
    iminus1 = iT,
    inference(sr,[status(thm)],[c_0_109,c_0_155]),
    [final] ).

cnf(c_0_188,plain,
    iplus5 = iplus3,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_175,c_0_176]),c_0_176]),c_0_177]),c_0_178]),c_0_166]),c_0_177]),
    [final] ).

cnf(c_0_190,plain,
    iplus6 = iT,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_179,c_0_176]),c_0_176]),c_0_177]),c_0_180]),c_0_177]),
    [final] ).

cnf(c_0_192,plain,
    iminus9 = iT,
    inference(sr,[status(thm)],[c_0_87,c_0_155]),
    [final] ).

cnf(c_0_197,plain,
    cTorF(iplus3),
    inference(er,[status(thm)],[c_0_182]),
    [final] ).

cnf(c_0_198,plain,
    ( iplus4 = iT
    | iminus4 = iT ),
    inference(spm,[status(thm)],[c_0_33,c_0_77]),
    [final] ).

cnf(c_0_205,plain,
    ( ~ cTorF(X1)
    | X1 = iT
    | X1 = iplus3 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_140]),c_0_166]),
    [final] ).

cnf(c_0_206,plain,
    ( iplus4 = iplus3
    | iminus5 = iplus4 ),
    inference(rw,[status(thm)],[c_0_187,c_0_188]),
    [final] ).

cnf(c_0_207,plain,
    ( iminus6 = iplus4
    | iplus4 = iT ),
    inference(rw,[status(thm)],[c_0_189,c_0_190]),
    [final] ).

cnf(c_0_208,plain,
    ( iplus4 = iT
    | iplus9 = iplus4 ),
    inference(rw,[status(thm)],[c_0_191,c_0_192]),
    [final] ).

cnf(c_0_209,plain,
    ( iF = iminus4
    | iplus4 = iplus3 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_146]),c_0_166]),
    [final] ).

cnf(c_0_210,plain,
    ( iminus4 = iplus3
    | iminus4 = iT ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_193,c_0_140]),c_0_166]),
    [final] ).

cnf(c_0_211,plain,
    ( iplus4 != iT
    | iminus4 = iplus3 ),
    inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_194,c_0_168]),c_0_155]),c_0_166]),
    [final] ).

cnf(c_0_212,plain,
    ( iplus4 = iT
    | iplus4 = iplus3 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_195,c_0_140]),c_0_140])]),c_0_146]),c_0_166]),
    [final] ).

cnf(c_0_213,plain,
    ( iminus4 != iplus4
    | iplus4 = iplus3 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_196,c_0_146]),c_0_166]),
    [final] ).

cnf(c_0_214,plain,
    ( iminus4 != iT
    | iplus4 = iplus3 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_146]),c_0_166]),
    [final] ).

cnf(c_0_215,plain,
    ( iF = iminus4
    | iminus4 = iT ),
    inference(spm,[status(thm)],[c_0_152,c_0_149]),
    [final] ).

cnf(c_0_216,plain,
    ( iplus4 = iplus3
    | iminus4 = iplus3 ),
    inference(spm,[status(thm)],[c_0_33,c_0_197]),
    [final] ).

cnf(c_0_217,plain,
    ( iF = iplus4
    | iplus4 = iT ),
    inference(spm,[status(thm)],[c_0_40,c_0_198]),
    [final] ).

cnf(c_0_218,plain,
    ( xsd_string(X1)
    | xsd_integer(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_199]),
    [final] ).

cnf(c_0_219,plain,
    ( ~ xsd_integer(X1)
    | ~ xsd_string(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_199]),
    [final] ).

cnf(c_0_220,plain,
    ~ cowlNothing(X1),
    inference(split_conjunct,[status(thm)],[c_0_200]),
    [final] ).

cnf(c_0_221,plain,
    iminus5 = iT,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_201,c_0_188]),c_0_177]),
    [final] ).

cnf(c_0_222,plain,
    iminus6 = iplus3,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_202,c_0_190])]),c_0_177]),
    [final] ).

cnf(c_0_223,plain,
    iF = iplus3,
    inference(rw,[status(thm)],[c_0_146,c_0_166]),
    [final] ).

cnf(c_0_224,plain,
    iplus9 = iplus3,
    inference(rw,[status(thm)],[c_0_203,c_0_166]),
    [final] ).

cnf(c_0_225,plain,
    iminus2 = iplus3,
    inference(rw,[status(thm)],[c_0_168,c_0_166]),
    [final] ).

cnf(c_0_226,plain,
    iplus1 = iplus3,
    inference(rw,[status(thm)],[c_0_178,c_0_166]),
    [final] ).

cnf(c_0_227,plain,
    iminus3 = iT,
    inference(sr,[status(thm)],[c_0_130,c_0_155]),
    [final] ).

cnf(c_0_228,plain,
    iplus2 = iT,
    inference(sr,[status(thm)],[c_0_132,c_0_155]),
    [final] ).

cnf(c_0_229,plain,
    iplus7 = iT,
    inference(spm,[status(thm)],[c_0_204,c_0_140]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : KRS040+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.09  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.48  % Computer : n004.cluster.edu
% 0.21/0.48  % Model    : x86_64 x86_64
% 0.21/0.48  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.48  % Memory   : 8046.5625MB
% 0.21/0.48  % OS       : Linux 6.8.0-71-generic
% 0.21/0.48  % CPULimit : 300
% 0.21/0.48  % WCLimit  : 300
% 0.21/0.48  % DateTime : Sun Sep 20 22:51:19 UTC 2026
% 0.21/0.48  % CPUTime  : 
% 0.21/0.48  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.55  Running first-order theorem proving
% 0.26/0.55  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
% 10.87/2.80  % Version: 3.5.1
% 10.87/2.80  % Preprocessing class: FSLSSMSMSSSNFFN.
% 10.87/2.80  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.87/2.80  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 10.87/2.80  % Starting new_bool_3 with 300s (1) cores
% 10.87/2.80  % Starting new_bool_1 with 300s (1) cores
% 10.87/2.80  % Starting sh5l with 300s (1) cores
% 10.87/2.80  % new_bool_1 with pid 1664052 completed with status 9
% 10.87/2.80  % new_bool_3 with pid 1664051 completed with status 9
% 10.87/2.80  % sh5l with pid 1664053 completed with status 9
% 10.87/2.80  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1664050 completed with status 1
% 10.87/2.80  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 10.87/2.80  % Preprocessing class: FSLSSMSMSSSNFFN.
% 10.87/2.80  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.87/2.80  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 10.87/2.80  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.87/2.80  % No SInE strategy applied
% 10.87/2.80  % Search class: FGHSF-FFMM00-SFFFFFNN
% 10.87/2.80  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 10.87/2.80  % Starting SubtermCWHack with 136s (1) cores
% 10.87/2.80  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 10.87/2.80  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 10.87/2.80  % Starting new_bool_3 with 136s (1) cores
% 10.87/2.80  % Starting new_bool_1 with 136s (1) cores
% 10.87/2.80  % new_bool_1 with pid 1664068 completed with status 1
% 10.87/2.80  % Result found by new_bool_1
% 10.87/2.80  % Preprocessing class: FSLSSMSMSSSNFFN.
% 10.87/2.80  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.87/2.80  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 10.87/2.80  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.87/2.80  % No SInE strategy applied
% 10.87/2.80  % Search class: FGHSF-FFMM00-SFFFFFNN
% 10.87/2.80  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 10.87/2.80  % Starting SubtermCWHack with 136s (1) cores
% 10.87/2.80  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 10.87/2.80  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 10.87/2.80  % Starting new_bool_3 with 136s (1) cores
% 10.87/2.80  % Starting new_bool_1 with 136s (1) cores
% 10.87/2.80  % Preprocessing time       : 0.003 s
% 10.87/2.80  % Presaturation interreduction done
% 10.87/2.80  
% 10.87/2.80  % No proof found!
% 10.87/2.80  % SZS status Satisfiable
% 10.87/2.80  % SZS output start Saturation
% See solution above
% 10.87/2.80  % Parsed axioms                        : 83
% 10.87/2.80  % Removed by relevancy pruning/SinE    : 0
% 10.87/2.80  % Initial clauses                      : 105
% 10.87/2.80  % Removed in clause preprocessing      : 26
% 10.87/2.80  % Initial clauses in saturation        : 79
% 10.87/2.80  % Processed clauses                    : 5737
% 10.87/2.80  % ...of these trivial                  : 1219
% 10.87/2.80  % ...subsumed                          : 2265
% 10.87/2.80  % ...remaining for further processing  : 2253
% 10.87/2.80  % Other redundant clauses eliminated   : 20
% 10.87/2.80  % Clauses deleted for lack of memory   : 0
% 10.87/2.80  % Backward-subsumed                    : 216
% 10.87/2.80  % Backward-rewritten                   : 1757
% 10.87/2.80  % Generated clauses                    : 98912
% 10.87/2.80  % ...of the previous two non-redundant : 92907
% 10.87/2.80  % ...aggressively subsumed             : 0
% 10.87/2.80  % Contextual simplify-reflections      : 31
% 10.87/2.80  % Paramodulations                      : 98144
% 10.87/2.80  % Factorizations                       : 606
% 10.87/2.80  % NegExts                              : 0
% 10.87/2.80  % Equation resolutions                 : 20
% 10.87/2.80  % Disequality decompositions           : 0
% 10.87/2.80  % Total rewrite steps                  : 8888
% 10.87/2.80  % ...of those cached                   : 8853
% 10.87/2.80  % Propositional unsat checks           : 0
% 10.87/2.80  %    Propositional check models        : 0
% 10.87/2.80  %    Propositional check unsatisfiable : 0
% 10.87/2.80  %    Propositional clauses             : 0
% 10.87/2.80  %    Propositional clauses after purity: 0
% 10.87/2.80  %    Propositional unsat core size     : 0
% 10.87/2.80  %    Propositional preprocessing time  : 0.000
% 10.87/2.80  %    Propositional encoding time       : 0.000
% 10.87/2.80  %    Propositional solver time         : 0.000
% 10.87/2.80  %    Success case prop preproc time    : 0.000
% 10.87/2.80  %    Success case prop encoding time   : 0.000
% 10.87/2.80  %    Success case prop solver time     : 0.000
% 10.87/2.80  % Current number of processed clauses  : 39
% 10.87/2.80  %    Positive orientable unit clauses  : 20
% 10.87/2.80  %    Positive unorientable unit clauses: 0
% 10.87/2.80  %    Negative unit clauses             : 2
% 10.87/2.80  %    Non-unit-clauses                  : 17
% 10.87/2.80  % Current number of unprocessed clauses: 0
% 10.87/2.80  % ...number of literals in the above   : 0
% 10.87/2.80  % Current number of archived formulas  : 0
% 10.87/2.80  % Current number of archived clauses   : 2195
% 10.87/2.80  % Clause-clause subsumption calls (NU) : 199533
% 10.87/2.80  % Rec. Clause-clause subsumption calls : 108359
% 10.87/2.80  % Non-unit clause-clause subsumptions  : 2454
% 10.87/2.80  % Unit Clause-clause subsumption calls : 885
% 10.87/2.80  % Rewrite failures with RHS unbound    : 0
% 10.87/2.80  % BW rewrite match attempts            : 17
% 10.87/2.80  % BW rewrite match successes           : 17
% 10.87/2.80  % Condensation attempts                : 0
% 10.87/2.80  % Condensation successes               : 0
% 10.87/2.80  % Termbank termtop insertions          : 570615
% 10.87/2.80  % Search garbage collected termcells   : 398
% 10.87/2.80  
% 10.87/2.80  % -------------------------------------------------
% 10.87/2.80  % User time                : 2.034 s
% 10.87/2.80  % System time              : 0.103 s
% 10.87/2.80  % Total time               : 2.138 s
% 10.87/2.80  % Maximum resident set size: 3680 pages
% 10.87/2.80  
% 10.87/2.80  % -------------------------------------------------
% 10.87/2.80  % User time                : 10.326 s
% 10.87/2.80  % System time              : 0.599 s
% 10.87/2.80  % Total time               : 10.924 s
% 10.87/2.80  % Maximum resident set size: 4608 pages
% 10.87/2.80  % E exiting
%------------------------------------------------------------------------------