↑ Up

E---3.5.1.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : NLP012-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 : n016.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:34:15 PM UTC 2026

% Result   : Satisfiable 0.15s 0.44s
% Output   : Saturation 0.15s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named clause7ERROR: Could not build tree for root c_0_71ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_71,negated_conjecture,
    fellow(skc23),
    clause7,
    [final] ).

cnf(c_0_72,negated_conjecture,
    seat(skc25),
    clause5,
    [final] ).

cnf(c_0_81,negated_conjecture,
    young(skc15),
    clause15,
    [final] ).

cnf(c_0_82,negated_conjecture,
    seat(skc18),
    clause12,
    [final] ).

cnf(c_0_89,negated_conjecture,
    front(skc17),
    clause13,
    [final] ).

cnf(c_0_90,negated_conjecture,
    fellow(skc16),
    clause14,
    [final] ).

cnf(c_0_97,negated_conjecture,
    young(skc24),
    clause6,
    [final] ).

cnf(c_0_103,negated_conjecture,
    city(skc22),
    clause8,
    [final] ).

cnf(c_0_104,negated_conjecture,
    event(skc21),
    clause9,
    [final] ).

cnf(c_0_112,negated_conjecture,
    event(skc28),
    clause2,
    [final] ).

cnf(c_0_113,negated_conjecture,
    hollywood(skc29),
    clause1,
    [final] ).

cnf(c_0_118,negated_conjecture,
    lonely(skc20),
    clause10,
    [final] ).

cnf(c_0_129,negated_conjecture,
    lonely(skc26),
    clause4,
    [final] ).

cnf(c_0_135,negated_conjecture,
    chevy(skc19),
    clause11,
    [final] ).

cnf(c_0_144,negated_conjecture,
    chevy(skc27),
    clause3,
    [final] ).

cnf(c_0_153,negated_conjecture,
    ssSkC0,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_143]),c_0_144])]),c_0_145]),c_0_146]),c_0_147]),c_0_148]),
    [final] ).

cnf(c_0_157,negated_conjecture,
    ( ~ hollywood(X5)
    | ~ event(X4)
    | ~ chevy(X7)
    | ~ lonely(X6)
    | ~ seat(X3)
    | ~ young(X1)
    | ~ young(X2)
    | ~ fellow(X1)
    | ~ fellow(X2)
    | ~ city(X5)
    | ~ front(X3)
    | ~ street(X6)
    | ~ way(X6)
    | ~ old(X7)
    | ~ dirty(X7)
    | ~ white(X7)
    | ~ car(X7)
    | ~ man(X1)
    | ~ man(X2)
    | ~ furniture(X3)
    | ~ barrel(X4,X7)
    | ~ down(X4,X6)
    | ~ in(X4,X5)
    | ~ in(X1,X3)
    | ~ in(X2,X3)
    | X1 = X2 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_153])]),
    [final] ).

cnf(c_0_158,negated_conjecture,
    ( ~ young(X1)
    | ~ fellow(X1)
    | ~ man(X1)
    | ~ in(X1,skc18)
    | X1 = skc15 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_150,c_0_153])]),
    [final] ).

cnf(c_0_159,negated_conjecture,
    ( ~ young(X1)
    | ~ fellow(X1)
    | ~ man(X1)
    | ~ in(X1,skc17)
    | X1 = skc16 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_152,c_0_153])]),
    [final] ).

cnf(c_0_160,negated_conjecture,
    ( ~ seat(skc22)
    | ~ young(X1)
    | ~ young(skc21)
    | ~ fellow(X1)
    | ~ fellow(skc21)
    | ~ front(skc22)
    | ~ man(X1)
    | ~ man(skc21)
    | ~ furniture(skc22)
    | ~ in(X1,skc22)
    | X1 = skc21 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_154,c_0_153])]),
    [final] ).

cnf(c_0_161,negated_conjecture,
    skc16 != skc15,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_151,c_0_153])]),
    [final] ).

cnf(c_0_162,negated_conjecture,
    ~ in(skc16,skc18),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_155,c_0_153])]),
    [final] ).

cnf(c_0_163,negated_conjecture,
    ~ in(skc15,skc17),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_156,c_0_153])]),
    [final] ).

cnf(c_0_164,negated_conjecture,
    barrel(skc21,skc19),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_134,c_0_153])]),
    [final] ).

cnf(c_0_165,negated_conjecture,
    down(skc21,skc20),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_117,c_0_153])]),
    [final] ).

cnf(c_0_166,negated_conjecture,
    in(skc21,skc22),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_153])]),
    [final] ).

cnf(c_0_167,negated_conjecture,
    in(skc16,skc17),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_153])]),
    [final] ).

cnf(c_0_168,negated_conjecture,
    in(skc15,skc18),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_153])]),
    [final] ).

cnf(c_0_169,negated_conjecture,
    hollywood(skc22),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_153])]),
    [final] ).

cnf(c_0_170,negated_conjecture,
    seat(skc17),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_153])]),
    [final] ).

cnf(c_0_171,negated_conjecture,
    young(skc16),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_153])]),
    [final] ).

cnf(c_0_172,negated_conjecture,
    fellow(skc15),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_153])]),
    [final] ).

cnf(c_0_173,negated_conjecture,
    front(skc18),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_153])]),
    [final] ).

cnf(c_0_174,negated_conjecture,
    street(skc20),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_119,c_0_153])]),
    [final] ).

cnf(c_0_175,negated_conjecture,
    way(skc20),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_120,c_0_153])]),
    [final] ).

cnf(c_0_176,negated_conjecture,
    old(skc19),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_136,c_0_153])]),
    [final] ).

cnf(c_0_177,negated_conjecture,
    dirty(skc19),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_137,c_0_153])]),
    [final] ).

cnf(c_0_178,negated_conjecture,
    white(skc19),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_138,c_0_153])]),
    [final] ).

cnf(c_0_179,negated_conjecture,
    car(skc19),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_139,c_0_153])]),
    [final] ).

cnf(c_0_180,negated_conjecture,
    man(skc16),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_153])]),
    [final] ).

cnf(c_0_181,negated_conjecture,
    man(skc15),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_153])]),
    [final] ).

cnf(c_0_182,negated_conjecture,
    furniture(skc18),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_153])]),
    [final] ).

cnf(c_0_183,negated_conjecture,
    furniture(skc17),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_153])]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NLP012-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/0.36  % Computer : n016.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 21 01:36:22 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41  Running first-order theorem proving
% 0.15/0.41  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.15/0.44  % Version: 3.5.1
% 0.15/0.44  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44  % Starting sh5l with 300s (1) cores
% 0.15/0.44  % new_bool_3 with pid 1290701 completed with status 1
% 0.15/0.44  % Result found by new_bool_3
% 0.15/0.44  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.44  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44  % Search class: FGHSF-FFMM00-SFFFFFNN
% 0.15/0.44  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.44  % SubtermCWHack with pid 1290708 completed with status 1
% 0.15/0.44  % Result found by SubtermCWHack
% 0.15/0.44  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.44  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44  % Search class: FGHSF-FFMM00-SFFFFFNN
% 0.15/0.44  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.44  % Preprocessing time       : 0.001 s
% 0.15/0.44  
% 0.15/0.44  % No proof found!
% 0.15/0.44  % SZS status Satisfiable
% 0.15/0.44  % SZS output start Saturation
% See solution above
% 0.15/0.44  % Parsed axioms                        : 57
% 0.15/0.44  % Removed by relevancy pruning/SinE    : 0
% 0.15/0.44  % Initial clauses                      : 57
% 0.15/0.44  % Removed in clause preprocessing      : 0
% 0.15/0.44  % Initial clauses in saturation        : 57
% 0.15/0.44  % Processed clauses                    : 112
% 0.15/0.44  % ...of these trivial                  : 3
% 0.15/0.44  % ...subsumed                          : 5
% 0.15/0.44  % ...remaining for further processing  : 104
% 0.15/0.44  % Other redundant clauses eliminated   : 0
% 0.15/0.44  % Clauses deleted for lack of memory   : 0
% 0.15/0.44  % Backward-subsumed                    : 12
% 0.15/0.44  % Backward-rewritten                   : 49
% 0.15/0.44  % Generated clauses                    : 60
% 0.15/0.44  % ...of the previous two non-redundant : 80
% 0.15/0.44  % ...aggressively subsumed             : 0
% 0.15/0.44  % Contextual simplify-reflections      : 49
% 0.15/0.44  % Paramodulations                      : 60
% 0.15/0.44  % Factorizations                       : 0
% 0.15/0.44  % NegExts                              : 0
% 0.15/0.44  % Equation resolutions                 : 0
% 0.15/0.44  % Disequality decompositions           : 0
% 0.15/0.44  % Total rewrite steps                  : 117
% 0.15/0.44  % ...of those cached                   : 93
% 0.15/0.44  % Propositional unsat checks           : 0
% 0.15/0.44  %    Propositional check models        : 0
% 0.15/0.44  %    Propositional check unsatisfiable : 0
% 0.15/0.44  %    Propositional clauses             : 0
% 0.15/0.44  %    Propositional clauses after purity: 0
% 0.15/0.44  %    Propositional unsat core size     : 0
% 0.15/0.44  %    Propositional preprocessing time  : 0.000
% 0.15/0.44  %    Propositional encoding time       : 0.000
% 0.15/0.44  %    Propositional solver time         : 0.000
% 0.15/0.44  %    Success case prop preproc time    : 0.000
% 0.15/0.44  %    Success case prop encoding time   : 0.000
% 0.15/0.44  %    Success case prop solver time     : 0.000
% 0.15/0.44  % Current number of processed clauses  : 43
% 0.15/0.44  %    Positive orientable unit clauses  : 36
% 0.15/0.44  %    Positive unorientable unit clauses: 0
% 0.15/0.44  %    Negative unit clauses             : 3
% 0.15/0.44  %    Non-unit-clauses                  : 4
% 0.15/0.44  % Current number of unprocessed clauses: 0
% 0.15/0.44  % ...number of literals in the above   : 0
% 0.15/0.44  % Current number of archived formulas  : 0
% 0.15/0.44  % Current number of archived clauses   : 61
% 0.15/0.44  % Clause-clause subsumption calls (NU) : 5122
% 0.15/0.44  % Rec. Clause-clause subsumption calls : 627
% 0.15/0.44  % Non-unit clause-clause subsumptions  : 64
% 0.15/0.44  % Unit Clause-clause subsumption calls : 10
% 0.15/0.44  % Rewrite failures with RHS unbound    : 0
% 0.15/0.44  % BW rewrite match attempts            : 1
% 0.15/0.44  % BW rewrite match successes           : 1
% 0.15/0.44  % Condensation attempts                : 0
% 0.15/0.44  % Condensation successes               : 0
% 0.15/0.44  % Termbank termtop insertions          : 5425
% 0.15/0.44  % Search garbage collected termcells   : 173
% 0.15/0.44  
% 0.15/0.44  % -------------------------------------------------
% 0.15/0.44  % User time                : 0.007 s
% 0.15/0.44  % System time              : 0.004 s
% 0.15/0.44  % Total time               : 0.011 s
% 0.15/0.44  % Maximum resident set size: 3684 pages
% 0.15/0.44  
% 0.15/0.44  % -------------------------------------------------
% 0.15/0.44  % User time                : 0.010 s
% 0.15/0.44  % System time              : 0.009 s
% 0.15/0.44  % Total time               : 0.018 s
% 0.15/0.44  % Maximum resident set size: 4608 pages
% 0.15/0.44  % E exiting
%------------------------------------------------------------------------------