↑ Up

E-SAT---3.5.1.SAT-Sat.s

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

% Computer : n006.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 12:48:52 PM UTC 2026

% Result   : Satisfiable 0.40s 0.57s
% Output   : Saturation 0.40s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_45ERROR: Could not build tree for root c_0_90ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_90,plain,
    ( ~ value(out(n1,X1),n1)
    | ~ type(X1,or)
    | ~ mode(X1,ok)
    | value(in(n2,X1),n1)
    | value(in(n1,X1),n1) ),
    c_0_45,
    [final] ).

cnf(c_0_91,plain,
    ( ~ value(out(n1,X1),n0)
    | ~ type(X1,and)
    | ~ mode(X1,ok)
    | value(in(n2,X1),n0)
    | value(in(n1,X1),n0) ),
    c_0_46,
    [final] ).

cnf(c_0_92,plain,
    ( ~ value(in(n2,X1),n1)
    | ~ value(in(n1,X1),n1)
    | ~ type(X1,and)
    | ~ mode(X1,ok)
    | value(out(n1,X1),n1) ),
    c_0_47,
    [final] ).

cnf(c_0_93,plain,
    ( ~ value(in(n2,X1),n0)
    | ~ value(in(n1,X1),n0)
    | ~ type(X1,or)
    | ~ mode(X1,ok)
    | value(out(n1,X1),n0) ),
    c_0_48,
    [final] ).

cnf(c_0_94,plain,
    ( ~ value(in(X2,X1),n1)
    | ~ type(X1,or)
    | ~ mode(X1,ok)
    | value(out(n1,X1),n1) ),
    c_0_49,
    [final] ).

cnf(c_0_95,plain,
    ( ~ value(in(X2,X1),n0)
    | ~ type(X1,and)
    | ~ mode(X1,ok)
    | value(out(n1,X1),n0) ),
    c_0_50,
    [final] ).

cnf(c_0_96,plain,
    ( ~ type(X1,fulladder)
    | connection(out(c,h2(X1)),in(n1,or1(X1))) ),
    c_0_51,
    [final] ).

cnf(c_0_97,plain,
    ( ~ type(X1,fulladder)
    | connection(out(c,h1(X1)),in(n2,or1(X1))) ),
    c_0_52,
    [final] ).

cnf(c_0_98,plain,
    ( ~ type(X1,fulladder)
    | connection(out(s,h1(X1)),in(n2,h2(X1))) ),
    c_0_53,
    [final] ).

cnf(c_0_99,plain,
    ( ~ type(X1,halfadder)
    | connection(out(n1,or1(X1)),in(n1,and1(X1))) ),
    c_0_54,
    [final] ).

cnf(c_0_100,plain,
    ( ~ type(X1,halfadder)
    | connection(out(n1,not1(X1)),in(n2,and1(X1))) ),
    c_0_55,
    [final] ).

cnf(c_0_101,plain,
    ( ~ type(X1,halfadder)
    | connection(out(n1,and2(X1)),in(n1,not1(X1))) ),
    c_0_56,
    [final] ).

cnf(c_0_102,plain,
    ( ~ type(X1,fulladder)
    | connection(out(c,X1),out(n1,or1(X1))) ),
    c_0_57,
    [final] ).

cnf(c_0_103,plain,
    ( ~ value(in(n1,X1),n0)
    | ~ type(X1,not)
    | ~ mode(X1,ok)
    | value(out(n1,X1),n1) ),
    c_0_58,
    [final] ).

cnf(c_0_104,plain,
    ( ~ value(in(n1,X1),n1)
    | ~ type(X1,not)
    | ~ mode(X1,ok)
    | value(out(n1,X1),n0) ),
    c_0_59,
    [final] ).

cnf(c_0_105,plain,
    ( ~ value(out(n1,X1),n1)
    | ~ type(X1,and)
    | ~ mode(X1,ok)
    | value(in(n2,X1),n1) ),
    c_0_60,
    [final] ).

cnf(c_0_106,plain,
    ( ~ value(out(n1,X1),n0)
    | ~ type(X1,or)
    | ~ mode(X1,ok)
    | value(in(n2,X1),n0) ),
    c_0_61,
    [final] ).

cnf(c_0_107,plain,
    ( ~ type(X1,halfadder)
    | connection(out(c,X1),out(n1,and2(X1))) ),
    c_0_62,
    [final] ).

cnf(c_0_108,plain,
    ( ~ type(X1,fulladder)
    | connection(out(s,X1),out(s,h2(X1))) ),
    c_0_63,
    [final] ).

cnf(c_0_109,plain,
    ( ~ type(X1,halfadder)
    | connection(out(s,X1),out(n1,and1(X1))) ),
    c_0_64,
    [final] ).

cnf(c_0_110,plain,
    ( ~ type(X1,fulladder)
    | connection(in(c,X1),in(n2,h1(X1))) ),
    c_0_65,
    [final] ).

cnf(c_0_111,plain,
    ( ~ type(X1,halfadder)
    | connection(in(n2,X1),in(n2,or1(X1))) ),
    c_0_66,
    [final] ).

cnf(c_0_112,plain,
    ( ~ type(X1,halfadder)
    | connection(in(n2,X1),in(n2,and2(X1))) ),
    c_0_67,
    [final] ).

cnf(c_0_113,plain,
    ( ~ type(X1,fulladder)
    | connection(in(n2,X1),in(n1,h1(X1))) ),
    c_0_68,
    [final] ).

cnf(c_0_114,plain,
    ( ~ value(out(n1,X1),n0)
    | ~ type(X1,not)
    | ~ mode(X1,ok)
    | value(in(n1,X1),n1) ),
    c_0_69,
    [final] ).

cnf(c_0_115,plain,
    ( ~ value(out(n1,X1),n1)
    | ~ type(X1,and)
    | ~ mode(X1,ok)
    | value(in(n1,X1),n1) ),
    c_0_70,
    [final] ).

cnf(c_0_116,plain,
    ( ~ value(out(n1,X1),n1)
    | ~ type(X1,not)
    | ~ mode(X1,ok)
    | value(in(n1,X1),n0) ),
    c_0_71,
    [final] ).

cnf(c_0_117,plain,
    ( ~ value(out(n1,X1),n0)
    | ~ type(X1,or)
    | ~ mode(X1,ok)
    | value(in(n1,X1),n0) ),
    c_0_72,
    [final] ).

cnf(c_0_118,plain,
    ( ~ type(X1,fulladder)
    | connection(in(n1,X1),in(n1,h2(X1))) ),
    c_0_73,
    [final] ).

cnf(c_0_119,plain,
    ( ~ type(X1,halfadder)
    | connection(in(n1,X1),in(n1,or1(X1))) ),
    c_0_74,
    [final] ).

cnf(c_0_120,plain,
    ( ~ type(X1,halfadder)
    | connection(in(n1,X1),in(n1,and2(X1))) ),
    c_0_75,
    [final] ).

cnf(c_0_121,plain,
    ( ~ value(X1,X3)
    | ~ value(X1,X2)
    | equal_value(X2,X3) ),
    c_0_76,
    [final] ).

cnf(c_0_122,plain,
    ( ~ value(X2,X3)
    | ~ connection(X1,X2)
    | value(X1,X3) ),
    c_0_77,
    [final] ).

cnf(c_0_123,plain,
    ( ~ value(X1,X3)
    | ~ connection(X1,X2)
    | value(X2,X3) ),
    c_0_78,
    [final] ).

cnf(c_0_124,plain,
    ( ~ type(X1,X2)
    | mode(X1,abnormal)
    | mode(X1,ok) ),
    c_0_79,
    [final] ).

cnf(c_0_125,plain,
    ( ~ type(X1,fulladder)
    | type(h2(X1),halfadder) ),
    c_0_80,
    [final] ).

cnf(c_0_126,plain,
    ( ~ type(X1,fulladder)
    | type(h1(X1),halfadder) ),
    c_0_81,
    [final] ).

cnf(c_0_127,plain,
    ( ~ type(X1,fulladder)
    | type(or1(X1),or) ),
    c_0_82,
    [final] ).

cnf(c_0_128,plain,
    ( ~ type(X1,halfadder)
    | type(or1(X1),or) ),
    c_0_83,
    [final] ).

cnf(c_0_129,plain,
    ( ~ type(X1,halfadder)
    | type(not1(X1),not) ),
    c_0_84,
    [final] ).

cnf(c_0_130,plain,
    ( ~ type(X1,halfadder)
    | type(and2(X1),and) ),
    c_0_85,
    [final] ).

cnf(c_0_131,plain,
    ( ~ type(X1,halfadder)
    | type(and1(X1),and) ),
    c_0_86,
    [final] ).

cnf(c_0_132,plain,
    ( ~ mode(X1,abnormal)
    | ~ mode(X1,ok) ),
    c_0_87,
    [final] ).

cnf(c_0_133,plain,
    ~ equal_value(n1,n0),
    c_0_88,
    [final] ).

cnf(c_0_134,plain,
    ~ equal_value(n0,n1),
    c_0_89,
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HWV036-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.38  % Computer : n006.cluster.edu
% 0.14/0.38  % Model    : x86_64 x86_64
% 0.14/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38  % Memory   : 8046.5625MB
% 0.14/0.38  % OS       : Linux 6.8.0-71-generic
% 0.14/0.38  % CPULimit : 300
% 0.14/0.39  % WCLimit  : 300
% 0.14/0.39  % DateTime : Sun Sep 20 20:49:27 UTC 2026
% 0.14/0.39  % CPUTime  : 
% 0.14/0.39  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.47  Running first-order theorem proving
% 0.18/0.48  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.40/0.57  % Version: 3.5.1
% 0.40/0.57  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.40/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.57  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.40/0.57  % Starting new_bool_3 with 300s (1) cores
% 0.40/0.57  % Starting new_bool_1 with 300s (1) cores
% 0.40/0.57  % Starting sh5l with 300s (1) cores
% 0.40/0.57  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1241165 completed with status 1
% 0.40/0.57  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.40/0.57  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.40/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.57  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.40/0.57  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.40/0.57  % No SInE strategy applied
% 0.40/0.57  % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.40/0.57  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.40/0.57  % Starting SubtermCWHack with 136s (1) cores
% 0.40/0.57  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.40/0.57  % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.40/0.57  % Starting new_bool_3 with 136s (1) cores
% 0.40/0.57  % Starting new_bool_1 with 136s (1) cores
% 0.40/0.57  % new_bool_3 with pid 1241180 completed with status 1
% 0.40/0.57  % Result found by new_bool_3
% 0.40/0.57  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.40/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.57  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.40/0.57  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.40/0.57  % No SInE strategy applied
% 0.40/0.57  % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.40/0.57  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.40/0.57  % Starting SubtermCWHack with 136s (1) cores
% 0.40/0.57  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.40/0.57  % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.40/0.57  % Starting new_bool_3 with 136s (1) cores
% 0.40/0.57  % Preprocessing time       : 0.003 s
% 0.40/0.57  % Presaturation interreduction done
% 0.40/0.57  
% 0.40/0.57  % No proof found!
% 0.40/0.57  % SZS status Satisfiable
% 0.40/0.57  % SZS output start Saturation
% See solution above
% 0.40/0.57  % Parsed axioms                        : 45
% 0.40/0.57  % Removed by relevancy pruning/SinE    : 0
% 0.40/0.57  % Initial clauses                      : 45
% 0.40/0.57  % Removed in clause preprocessing      : 0
% 0.40/0.57  % Initial clauses in saturation        : 45
% 0.40/0.57  % Processed clauses                    : 90
% 0.40/0.57  % ...of these trivial                  : 0
% 0.40/0.57  % ...subsumed                          : 0
% 0.40/0.57  % ...remaining for further processing  : 90
% 0.40/0.57  % Other redundant clauses eliminated   : 0
% 0.40/0.57  % Clauses deleted for lack of memory   : 0
% 0.40/0.57  % Backward-subsumed                    : 0
% 0.40/0.57  % Backward-rewritten                   : 0
% 0.40/0.57  % Generated clauses                    : 0
% 0.40/0.57  % ...of the previous two non-redundant : 0
% 0.40/0.57  % ...aggressively subsumed             : 0
% 0.40/0.57  % Contextual simplify-reflections      : 0
% 0.40/0.57  % Paramodulations                      : 0
% 0.40/0.57  % Factorizations                       : 0
% 0.40/0.57  % NegExts                              : 0
% 0.40/0.57  % Equation resolutions                 : 0
% 0.40/0.57  % Disequality decompositions           : 0
% 0.40/0.57  % Total rewrite steps                  : 0
% 0.40/0.57  % ...of those cached                   : 0
% 0.40/0.57  % Propositional unsat checks           : 0
% 0.40/0.57  %    Propositional check models        : 0
% 0.40/0.57  %    Propositional check unsatisfiable : 0
% 0.40/0.57  %    Propositional clauses             : 0
% 0.40/0.57  %    Propositional clauses after purity: 0
% 0.40/0.57  %    Propositional unsat core size     : 0
% 0.40/0.57  %    Propositional preprocessing time  : 0.000
% 0.40/0.57  %    Propositional encoding time       : 0.000
% 0.40/0.57  %    Propositional solver time         : 0.000
% 0.40/0.57  %    Success case prop preproc time    : 0.000
% 0.40/0.57  %    Success case prop encoding time   : 0.000
% 0.40/0.57  %    Success case prop solver time     : 0.000
% 0.40/0.57  % Current number of processed clauses  : 45
% 0.40/0.57  %    Positive orientable unit clauses  : 0
% 0.40/0.57  %    Positive unorientable unit clauses: 0
% 0.40/0.57  %    Negative unit clauses             : 2
% 0.40/0.57  %    Non-unit-clauses                  : 43
% 0.40/0.57  % Current number of unprocessed clauses: 0
% 0.40/0.57  % ...number of literals in the above   : 0
% 0.40/0.57  % Current number of archived formulas  : 0
% 0.40/0.57  % Current number of archived clauses   : 45
% 0.40/0.57  % Clause-clause subsumption calls (NU) : 1054
% 0.40/0.57  % Rec. Clause-clause subsumption calls : 588
% 0.40/0.57  % Non-unit clause-clause subsumptions  : 0
% 0.40/0.57  % Unit Clause-clause subsumption calls : 2
% 0.40/0.57  % Rewrite failures with RHS unbound    : 0
% 0.40/0.57  % BW rewrite match attempts            : 0
% 0.40/0.57  % BW rewrite match successes           : 0
% 0.40/0.57  % Condensation attempts                : 0
% 0.40/0.57  % Condensation successes               : 0
% 0.40/0.57  % Termbank termtop insertions          : 3200
% 0.40/0.57  % Search garbage collected termcells   : 104
% 0.40/0.57  
% 0.40/0.57  % -------------------------------------------------
% 0.40/0.57  % User time                : 0.012 s
% 0.40/0.57  % System time              : 0.007 s
% 0.40/0.57  % Total time               : 0.018 s
% 0.40/0.57  % Maximum resident set size: 3620 pages
% 0.40/0.57  
% 0.40/0.57  % -------------------------------------------------
% 0.40/0.57  % User time                : 0.055 s
% 0.40/0.57  % System time              : 0.019 s
% 0.40/0.57  % Total time               : 0.074 s
% 0.40/0.57  % Maximum resident set size: 4864 pages
% 0.40/0.57  % E exiting
%------------------------------------------------------------------------------