↑ Up

E---3.5.1.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : NUM285-1 : TPTP v9.3.1. Released v1.1.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 01:44:37 PM UTC 2026

% Result   : Satisfiable 0.23s 0.56s
% Output   : Saturation 0.23s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_47ERROR: Could not build tree for root c_0_61ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_51,negated_conjecture,
    ( ~ b1
    | b0
    | q1 ),
    c_0_47,
    [final] ).

cnf(c_0_52,negated_conjecture,
    ( ~ a1
    | b1 ),
    c_0_48,
    [final] ).

cnf(c_0_61,negated_conjecture,
    ( ~ a1
    | q1
    | b0 ),
    inference(spm,[status(thm)],[c_0_51,c_0_52]),
    [final] ).

cnf(c_0_62,negated_conjecture,
    ( ~ a0
    | a1
    | p1 ),
    c_0_53,
    [final] ).

cnf(c_0_63,negated_conjecture,
    ( b0
    | a0 ),
    a0_not_b0_1,
    [final] ).

cnf(c_0_67,negated_conjecture,
    ( ~ b1
    | a1 ),
    c_0_54,
    [final] ).

cnf(c_0_68,negated_conjecture,
    ( ~ q1
    | b1
    | b0 ),
    c_0_55,
    [final] ).

cnf(c_0_70,negated_conjecture,
    ( ~ b3
    | a3 ),
    c_0_56,
    [final] ).

cnf(c_0_71,negated_conjecture,
    ( ~ q3
    | b3 ),
    inference(csr,[status(thm)],[c_0_57,c_0_58]),
    [final] ).

cnf(c_0_75,negated_conjecture,
    ( ~ b0
    | b1
    | q1 ),
    c_0_59,
    [final] ).

cnf(c_0_76,negated_conjecture,
    ( ~ b0
    | ~ a0 ),
    c_0_60,
    [final] ).

cnf(c_0_88,negated_conjecture,
    ( ~ a1
    | ~ a0
    | ~ p1 ),
    c_0_66,
    [final] ).

cnf(c_0_89,negated_conjecture,
    ( ~ q1
    | a1
    | b0 ),
    inference(spm,[status(thm)],[c_0_67,c_0_68]),
    [final] ).

cnf(c_0_91,negated_conjecture,
    ( ~ q2
    | b3
    | q3 ),
    c_0_69,
    [final] ).

cnf(c_0_92,negated_conjecture,
    ( ~ q3
    | a3 ),
    inference(spm,[status(thm)],[c_0_70,c_0_71]),
    [final] ).

cnf(c_0_93,negated_conjecture,
    ( ~ b2
    | q1
    | q2 ),
    c_0_72,
    [final] ).

cnf(c_0_94,negated_conjecture,
    ( ~ a2
    | b2 ),
    c_0_73,
    [final] ).

cnf(c_0_96,negated_conjecture,
    ( ~ a1
    | a0
    | p1 ),
    c_0_74,
    [final] ).

cnf(c_0_97,negated_conjecture,
    ( ~ b0
    | a1
    | q1 ),
    inference(spm,[status(thm)],[c_0_67,c_0_75]),
    [final] ).

cnf(c_0_100,negated_conjecture,
    ( ~ b2
    | a2 ),
    c_0_78,
    [final] ).

cnf(c_0_101,negated_conjecture,
    ( ~ q1
    | b2
    | q2 ),
    c_0_79,
    [final] ).

cnf(c_0_103,negated_conjecture,
    ( ~ b4
    | a4 ),
    c_0_80,
    [final] ).

cnf(c_0_104,negated_conjecture,
    ( ~ q4
    | b4 ),
    inference(csr,[status(thm)],[c_0_81,c_0_82]),
    [final] ).

cnf(c_0_105,negated_conjecture,
    ( ~ b3
    | q2
    | q3 ),
    c_0_83,
    [final] ).

cnf(c_0_106,negated_conjecture,
    ( ~ a3
    | b3 ),
    c_0_84,
    [final] ).

cnf(c_0_109,negated_conjecture,
    ( ~ b1
    | ~ b0
    | ~ q1 ),
    c_0_87,
    [final] ).

cnf(c_0_113,negated_conjecture,
    ( ~ q2
    | a3 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_91]),c_0_92]),
    [final] ).

cnf(c_0_114,negated_conjecture,
    ( ~ a2
    | q1
    | q2 ),
    inference(spm,[status(thm)],[c_0_93,c_0_94]),
    [final] ).

cnf(c_0_115,negated_conjecture,
    ( ~ p1
    | a2
    | p2 ),
    c_0_95,
    [final] ).

cnf(c_0_116,negated_conjecture,
    ( p1
    | q1 ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_63]),c_0_98]),
    [final] ).

cnf(c_0_117,negated_conjecture,
    ( ~ a2
    | p1
    | p2 ),
    c_0_99,
    [final] ).

cnf(c_0_118,negated_conjecture,
    ( ~ q1
    | a2
    | q2 ),
    inference(spm,[status(thm)],[c_0_100,c_0_101]),
    [final] ).

cnf(c_0_121,negated_conjecture,
    ( ~ q3
    | b4
    | q4 ),
    c_0_102,
    [final] ).

cnf(c_0_122,negated_conjecture,
    ( ~ q4
    | a4 ),
    inference(spm,[status(thm)],[c_0_103,c_0_104]),
    [final] ).

cnf(c_0_124,negated_conjecture,
    ( ~ a3
    | q2
    | q3 ),
    inference(spm,[status(thm)],[c_0_105,c_0_106]),
    [final] ).

cnf(c_0_125,negated_conjecture,
    ( ~ p3
    | a3 ),
    inference(csr,[status(thm)],[c_0_107,c_0_108]),
    [final] ).

cnf(c_0_126,negated_conjecture,
    ( ~ a1
    | ~ q1
    | ~ b0 ),
    inference(spm,[status(thm)],[c_0_109,c_0_52]),
    [final] ).

cnf(c_0_127,negated_conjecture,
    ( ~ p1
    | a1
    | a0 ),
    c_0_110,
    [final] ).

cnf(c_0_130,negated_conjecture,
    ( p2
    | q1
    | q2 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_116]),
    [final] ).

cnf(c_0_131,negated_conjecture,
    ( p1
    | p2
    | q2 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_116]),
    [final] ).

cnf(c_0_133,negated_conjecture,
    ( ~ q2
    | b2
    | q1 ),
    c_0_119,
    [final] ).

cnf(c_0_135,negated_conjecture,
    ( ~ q3
    | a4 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_121]),c_0_122]),
    [final] ).

cnf(c_0_136,negated_conjecture,
    ( ~ p2
    | a3
    | p3 ),
    c_0_123,
    [final] ).

cnf(c_0_137,negated_conjecture,
    ( ~ p3
    | q2
    | q3 ),
    inference(spm,[status(thm)],[c_0_124,c_0_125]),
    [final] ).

cnf(c_0_138,negated_conjecture,
    ( ~ p1
    | ~ q1 ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_63]),c_0_128]),
    [final] ).

cnf(c_0_142,negated_conjecture,
    ( ~ a2
    | ~ p1
    | ~ p2 ),
    c_0_132,
    [final] ).

cnf(c_0_143,negated_conjecture,
    ( ~ q2
    | a2
    | q1 ),
    inference(spm,[status(thm)],[c_0_100,c_0_133]),
    [final] ).

cnf(c_0_145,negated_conjecture,
    ( ~ p2
    | q2
    | q3 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_136]),c_0_137]),
    [final] ).

cnf(c_0_146,negated_conjecture,
    ( p2
    | p3 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_140]),
    [final] ).

cnf(c_0_152,negated_conjecture,
    ( ~ b2
    | ~ q1
    | ~ q2 ),
    c_0_141,
    [final] ).

cnf(c_0_154,negated_conjecture,
    ( ~ p2
    | ~ q2
    | q1 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_143]),c_0_116]),
    [final] ).

cnf(c_0_156,negated_conjecture,
    ( ~ b4
    | q3
    | q4 ),
    c_0_147,
    [final] ).

cnf(c_0_157,negated_conjecture,
    ( ~ a4
    | b4 ),
    c_0_148,
    [final] ).

cnf(c_0_162,negated_conjecture,
    p5,
    equal_sum_2,
    [final] ).

cnf(c_0_163,negated_conjecture,
    ( ~ a2
    | ~ q1
    | ~ q2 ),
    inference(spm,[status(thm)],[c_0_152,c_0_94]),
    [final] ).

cnf(c_0_164,negated_conjecture,
    ( ~ p2
    | a2
    | p1 ),
    c_0_153,
    [final] ).

cnf(c_0_167,negated_conjecture,
    ( ~ a4
    | q3
    | q4 ),
    inference(spm,[status(thm)],[c_0_156,c_0_157]),
    [final] ).

cnf(c_0_168,negated_conjecture,
    ( ~ p4
    | a4 ),
    inference(csr,[status(thm)],[c_0_158,c_0_159]),
    [final] ).

cnf(c_0_172,negated_conjecture,
    ( ~ p2
    | ~ q2
    | p1 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_163,c_0_164]),c_0_116]),
    [final] ).

cnf(c_0_174,negated_conjecture,
    ( ~ p3
    | a4
    | p4 ),
    c_0_166,
    [final] ).

cnf(c_0_175,negated_conjecture,
    ( ~ p4
    | q3
    | q4 ),
    inference(spm,[status(thm)],[c_0_167,c_0_168]),
    [final] ).

cnf(c_0_177,negated_conjecture,
    a5,
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_170,c_0_162])]),c_0_171]),
    [final] ).

cnf(c_0_178,negated_conjecture,
    ( p3
    | p4 ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_172,c_0_155]),c_0_146]),c_0_173]),
    [final] ).

cnf(c_0_179,negated_conjecture,
    ( ~ p3
    | q3
    | q4 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_174]),c_0_175]),
    [final] ).

cnf(c_0_180,negated_conjecture,
    b5,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_176,c_0_177])]),
    [final] ).

cnf(c_0_181,negated_conjecture,
    q5,
    equal_sum_1,
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : NUM285-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.45  % Computer : n014.cluster.edu
% 0.21/0.45  % Model    : x86_64 x86_64
% 0.21/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.45  % Memory   : 8046.5625MB
% 0.21/0.45  % OS       : Linux 6.8.0-71-generic
% 0.21/0.46  % CPULimit : 300
% 0.21/0.46  % WCLimit  : 300
% 0.21/0.46  % DateTime : Mon Sep 21 02:20:19 UTC 2026
% 0.21/0.46  % CPUTime  : 
% 0.21/0.46  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.53  Running first-order theorem proving
% 0.23/0.53  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.23/0.56  % Version: 3.5.1
% 0.23/0.56  % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.23/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.56  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.23/0.56  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.56  % Starting new_bool_1 with 300s (1) cores
% 0.23/0.56  % Starting sh5l with 300s (1) cores
% 0.23/0.56  % new_bool_3 with pid 2931779 completed with status 1
% 0.23/0.56  % Result found by new_bool_3
% 0.23/0.56  % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.23/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.56  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.23/0.56  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.56  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.56  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.56  % Search class: FGHNF-FFSS00-SFFFFFNN
% 0.23/0.56  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.56  % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.56  % SubtermCWHack with pid 2931782 completed with status 1
% 0.23/0.56  % Result found by SubtermCWHack
% 0.23/0.56  % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.23/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.56  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.23/0.56  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.56  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.56  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.56  % Search class: FGHNF-FFSS00-SFFFFFNN
% 0.23/0.56  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.56  % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.56  % Preprocessing time       : 0.002 s
% 0.23/0.56  
% 0.23/0.56  % No proof found!
% 0.23/0.56  % SZS status Satisfiable
% 0.23/0.56  % SZS output start Saturation
% See solution above
% 0.23/0.56  % Parsed axioms                        : 54
% 0.23/0.56  % Removed by relevancy pruning/SinE    : 0
% 0.23/0.56  % Initial clauses                      : 54
% 0.23/0.56  % Removed in clause preprocessing      : 0
% 0.23/0.56  % Initial clauses in saturation        : 54
% 0.23/0.56  % Processed clauses                    : 103
% 0.23/0.56  % ...of these trivial                  : 5
% 0.23/0.56  % ...subsumed                          : 7
% 0.23/0.56  % ...remaining for further processing  : 91
% 0.23/0.56  % Other redundant clauses eliminated   : 0
% 0.23/0.56  % Clauses deleted for lack of memory   : 0
% 0.23/0.56  % Backward-subsumed                    : 23
% 0.23/0.56  % Backward-rewritten                   : 2
% 0.23/0.56  % Generated clauses                    : 108
% 0.23/0.56  % ...of the previous two non-redundant : 51
% 0.23/0.56  % ...aggressively subsumed             : 0
% 0.23/0.56  % Contextual simplify-reflections      : 24
% 0.23/0.56  % Paramodulations                      : 108
% 0.23/0.56  % Factorizations                       : 0
% 0.23/0.56  % NegExts                              : 0
% 0.23/0.56  % Equation resolutions                 : 0
% 0.23/0.56  % Disequality decompositions           : 0
% 0.23/0.56  % Total rewrite steps                  : 11
% 0.23/0.56  % ...of those cached                   : 7
% 0.23/0.56  % Propositional unsat checks           : 0
% 0.23/0.56  %    Propositional check models        : 0
% 0.23/0.56  %    Propositional check unsatisfiable : 0
% 0.23/0.56  %    Propositional clauses             : 0
% 0.23/0.56  %    Propositional clauses after purity: 0
% 0.23/0.56  %    Propositional unsat core size     : 0
% 0.23/0.56  %    Propositional preprocessing time  : 0.000
% 0.23/0.56  %    Propositional encoding time       : 0.000
% 0.23/0.56  %    Propositional solver time         : 0.000
% 0.23/0.56  %    Success case prop preproc time    : 0.000
% 0.23/0.56  %    Success case prop encoding time   : 0.000
% 0.23/0.56  %    Success case prop solver time     : 0.000
% 0.23/0.56  % Current number of processed clauses  : 66
% 0.23/0.56  %    Positive orientable unit clauses  : 4
% 0.23/0.56  %    Positive unorientable unit clauses: 0
% 0.23/0.56  %    Negative unit clauses             : 0
% 0.23/0.56  %    Non-unit-clauses                  : 62
% 0.23/0.56  % Current number of unprocessed clauses: 0
% 0.23/0.56  % ...number of literals in the above   : 0
% 0.23/0.56  % Current number of archived formulas  : 0
% 0.23/0.56  % Current number of archived clauses   : 25
% 0.23/0.56  % Clause-clause subsumption calls (NU) : 1818
% 0.23/0.56  % Rec. Clause-clause subsumption calls : 1530
% 0.23/0.56  % Non-unit clause-clause subsumptions  : 51
% 0.23/0.56  % Unit Clause-clause subsumption calls : 40
% 0.23/0.56  % Rewrite failures with RHS unbound    : 0
% 0.23/0.56  % BW rewrite match attempts            : 2
% 0.23/0.56  % BW rewrite match successes           : 2
% 0.23/0.56  % Condensation attempts                : 0
% 0.23/0.56  % Condensation successes               : 0
% 0.23/0.56  % Termbank termtop insertions          : 1932
% 0.23/0.56  % Search garbage collected termcells   : 83
% 0.23/0.56  
% 0.23/0.56  % -------------------------------------------------
% 0.23/0.56  % User time                : 0.010 s
% 0.23/0.56  % System time              : 0.002 s
% 0.23/0.56  % Total time               : 0.012 s
% 0.23/0.56  % Maximum resident set size: 3656 pages
% 0.23/0.56  
% 0.23/0.56  % -------------------------------------------------
% 0.23/0.56  % User time                : 0.014 s
% 0.23/0.56  % System time              : 0.008 s
% 0.23/0.56  % Total time               : 0.021 s
% 0.23/0.56  % Maximum resident set size: 4608 pages
% 0.23/0.56  % E exiting
%------------------------------------------------------------------------------