↑ Up

E---3.5.1.SAT-Sat.s

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

% Computer : n019.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:35:41 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_52,negated_conjecture,
    actual_world(skc29),
    clause1,
    [final] ).

cnf(c_0_120,negated_conjecture,
    ssSkC0,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_57]),c_0_58]),c_0_56]),
    [final] ).

cnf(c_0_141,negated_conjecture,
    ( ~ actual_world(X2)
    | ~ proposition(X2,X1)
    | ~ accessible_world(X2,X1)
    | ~ think_believe_consider(X2,X8)
    | ~ present(X2,X8)
    | ~ event(X2,X8)
    | ~ vincent_forename(X2,X6)
    | ~ forename(X2,X6)
    | ~ forename(X2,X5)
    | ~ man(X2,X7)
    | ~ man(X2,X4)
    | ~ state(X2,X3)
    | ~ jules_forename(X2,X5)
    | ~ theme(X2,X8,X1)
    | ~ agent(X2,X8,X7)
    | ~ of(X2,X6,X7)
    | ~ of(X2,X5,X4)
    | ~ be(X2,X3,X4,X4)
    | man(X1,skf7(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_120])]),
    [final] ).

cnf(c_0_142,negated_conjecture,
    ( ~ man(skc22,X1)
    | agent(skc22,skf5(X1),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_120])]),
    [final] ).

cnf(c_0_143,negated_conjecture,
    ( ~ man(skc22,X2)
    | present(skc22,skf5(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_120])]),
    [final] ).

cnf(c_0_144,negated_conjecture,
    ( ~ man(skc22,X2)
    | event(skc22,skf5(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_120])]),
    [final] ).

cnf(c_0_145,negated_conjecture,
    ( ~ man(skc22,X2)
    | smoke(skc22,skf5(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_121,c_0_120])]),
    [final] ).

cnf(c_0_146,negated_conjecture,
    ( ~ actual_world(X3)
    | ~ proposition(X3,X1)
    | ~ accessible_world(X3,X1)
    | ~ think_believe_consider(X3,X9)
    | ~ present(X3,X9)
    | ~ present(X1,X2)
    | ~ event(X3,X9)
    | ~ event(X1,X2)
    | ~ vincent_forename(X3,X7)
    | ~ forename(X3,X7)
    | ~ forename(X3,X6)
    | ~ man(X3,X8)
    | ~ man(X3,X5)
    | ~ state(X3,X4)
    | ~ jules_forename(X3,X6)
    | ~ theme(X3,X9,X1)
    | ~ agent(X3,X9,X8)
    | ~ agent(X1,X2,skf7(X1))
    | ~ of(X3,X7,X8)
    | ~ of(X3,X6,X5)
    | ~ be(X3,X4,X5,X5)
    | ~ smoke(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_120])]),
    [final] ).

cnf(c_0_147,negated_conjecture,
    ( ~ actual_world(X1)
    | ~ proposition(X1,skc22)
    | ~ accessible_world(X1,skc22)
    | ~ think_believe_consider(X1,X7)
    | ~ present(X1,X7)
    | ~ event(X1,X7)
    | ~ vincent_forename(X1,X5)
    | ~ forename(X1,X5)
    | ~ forename(X1,X4)
    | ~ man(X1,X6)
    | ~ man(X1,X3)
    | ~ state(X1,X2)
    | ~ jules_forename(X1,X4)
    | ~ theme(X1,X7,skc22)
    | ~ agent(X1,X7,X6)
    | ~ of(X1,X5,X6)
    | ~ of(X1,X4,X3)
    | ~ be(X1,X2,X3,X3)
    | ~ smoke(skc22,skf5(skf7(skc22))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_122,c_0_120])]),
    [final] ).

cnf(c_0_148,negated_conjecture,
    be(skc17,skc18,skc21,skc19),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_123,c_0_120])]),
    [final] ).

cnf(c_0_149,negated_conjecture,
    theme(skc17,skc23,skc22),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_120])]),
    [final] ).

cnf(c_0_150,negated_conjecture,
    agent(skc17,skc23,skc25),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_125,c_0_120])]),
    [final] ).

cnf(c_0_151,negated_conjecture,
    of(skc17,skc24,skc25),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_126,c_0_120])]),
    [final] ).

cnf(c_0_152,negated_conjecture,
    of(skc17,skc20,skc21),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_127,c_0_120])]),
    [final] ).

cnf(c_0_153,negated_conjecture,
    proposition(skc17,skc22),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_128,c_0_120])]),
    [final] ).

cnf(c_0_154,negated_conjecture,
    accessible_world(skc17,skc22),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_129,c_0_120])]),
    [final] ).

cnf(c_0_155,negated_conjecture,
    think_believe_consider(skc17,skc23),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_130,c_0_120])]),
    [final] ).

cnf(c_0_156,negated_conjecture,
    present(skc17,skc23),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_131,c_0_120])]),
    [final] ).

cnf(c_0_157,negated_conjecture,
    event(skc17,skc23),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_132,c_0_120])]),
    [final] ).

cnf(c_0_158,negated_conjecture,
    vincent_forename(skc17,skc24),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_133,c_0_120])]),
    [final] ).

cnf(c_0_159,negated_conjecture,
    forename(skc17,skc24),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_134,c_0_120])]),
    [final] ).

cnf(c_0_160,negated_conjecture,
    forename(skc17,skc20),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_135,c_0_120])]),
    [final] ).

cnf(c_0_161,negated_conjecture,
    man(skc17,skc25),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_136,c_0_120])]),
    [final] ).

cnf(c_0_162,negated_conjecture,
    man(skc17,skc19),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_137,c_0_120])]),
    [final] ).

cnf(c_0_163,negated_conjecture,
    man(skc17,skc21),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_138,c_0_120])]),
    [final] ).

cnf(c_0_164,negated_conjecture,
    state(skc17,skc18),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_139,c_0_120])]),
    [final] ).

cnf(c_0_165,negated_conjecture,
    jules_forename(skc17,skc20),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_140,c_0_120])]),
    [final] ).

cnf(c_0_166,negated_conjecture,
    actual_world(skc17),
    clause2,
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NLP222-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.58  % Computer : n019.cluster.edu
% 0.12/0.58  % Model    : x86_64 x86_64
% 0.12/0.58  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.58  % Memory   : 8046.5625MB
% 0.12/0.58  % OS       : Linux 6.8.0-71-generic
% 0.12/0.58  % CPULimit : 300
% 0.12/0.58  % WCLimit  : 300
% 0.12/0.58  % DateTime : Mon Sep 21 01:51:36 UTC 2026
% 0.12/0.58  % CPUTime  : 
% 0.12/0.58  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.63  Running first-order theorem proving
% 0.15/0.63  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.15/0.66  % Version: 3.5.1
% 0.15/0.66  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.66  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.66  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.66  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.66  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.66  % Starting sh5l with 300s (1) cores
% 0.15/0.66  % new_bool_3 with pid 1445805 completed with status 1
% 0.15/0.66  % Result found by new_bool_3
% 0.15/0.66  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.66  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.66  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.66  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.66  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.66  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.66  % Search class: FGHNF-FFMM11-SFFFFFNN
% 0.15/0.66  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.66  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.66  % SubtermCWHack with pid 1445812 completed with status 1
% 0.15/0.66  % Result found by SubtermCWHack
% 0.15/0.66  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.66  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.66  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.66  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.66  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.66  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.66  % Search class: FGHNF-FFMM11-SFFFFFNN
% 0.15/0.66  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.66  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.66  % Preprocessing time       : 0.001 s
% 0.15/0.66  
% 0.15/0.66  % No proof found!
% 0.15/0.66  % SZS status Satisfiable
% 0.15/0.66  % SZS output start Saturation
% See solution above
% 0.15/0.66  % Parsed axioms                        : 49
% 0.15/0.66  % Removed by relevancy pruning/SinE    : 0
% 0.15/0.66  % Initial clauses                      : 49
% 0.15/0.66  % Removed in clause preprocessing      : 0
% 0.15/0.66  % Initial clauses in saturation        : 49
% 0.15/0.66  % Processed clauses                    : 97
% 0.15/0.66  % ...of these trivial                  : 2
% 0.15/0.66  % ...subsumed                          : 1
% 0.15/0.66  % ...remaining for further processing  : 94
% 0.15/0.66  % Other redundant clauses eliminated   : 0
% 0.15/0.66  % Clauses deleted for lack of memory   : 0
% 0.15/0.66  % Backward-subsumed                    : 10
% 0.15/0.66  % Backward-rewritten                   : 56
% 0.15/0.66  % Generated clauses                    : 26
% 0.15/0.66  % ...of the previous two non-redundant : 49
% 0.15/0.66  % ...aggressively subsumed             : 0
% 0.15/0.66  % Contextual simplify-reflections      : 41
% 0.15/0.66  % Paramodulations                      : 26
% 0.15/0.66  % Factorizations                       : 0
% 0.15/0.66  % NegExts                              : 0
% 0.15/0.66  % Equation resolutions                 : 0
% 0.15/0.66  % Disequality decompositions           : 0
% 0.15/0.66  % Total rewrite steps                  : 61
% 0.15/0.66  % ...of those cached                   : 58
% 0.15/0.66  % Propositional unsat checks           : 0
% 0.15/0.66  %    Propositional check models        : 0
% 0.15/0.66  %    Propositional check unsatisfiable : 0
% 0.15/0.66  %    Propositional clauses             : 0
% 0.15/0.66  %    Propositional clauses after purity: 0
% 0.15/0.66  %    Propositional unsat core size     : 0
% 0.15/0.66  %    Propositional preprocessing time  : 0.000
% 0.15/0.66  %    Propositional encoding time       : 0.000
% 0.15/0.66  %    Propositional solver time         : 0.000
% 0.15/0.66  %    Success case prop preproc time    : 0.000
% 0.15/0.66  %    Success case prop encoding time   : 0.000
% 0.15/0.66  %    Success case prop solver time     : 0.000
% 0.15/0.66  % Current number of processed clauses  : 28
% 0.15/0.66  %    Positive orientable unit clauses  : 21
% 0.15/0.66  %    Positive unorientable unit clauses: 0
% 0.15/0.66  %    Negative unit clauses             : 0
% 0.15/0.66  %    Non-unit-clauses                  : 7
% 0.15/0.66  % Current number of unprocessed clauses: 0
% 0.15/0.66  % ...number of literals in the above   : 0
% 0.15/0.66  % Current number of archived formulas  : 0
% 0.15/0.66  % Current number of archived clauses   : 66
% 0.15/0.66  % Clause-clause subsumption calls (NU) : 1489
% 0.15/0.66  % Rec. Clause-clause subsumption calls : 373
% 0.15/0.66  % Non-unit clause-clause subsumptions  : 52
% 0.15/0.66  % Unit Clause-clause subsumption calls : 0
% 0.15/0.66  % Rewrite failures with RHS unbound    : 0
% 0.15/0.66  % BW rewrite match attempts            : 1
% 0.15/0.66  % BW rewrite match successes           : 1
% 0.15/0.66  % Condensation attempts                : 0
% 0.15/0.66  % Condensation successes               : 0
% 0.15/0.66  % Termbank termtop insertions          : 4292
% 0.15/0.66  % Search garbage collected termcells   : 206
% 0.15/0.66  
% 0.15/0.66  % -------------------------------------------------
% 0.15/0.66  % User time                : 0.010 s
% 0.15/0.66  % System time              : 0.000 s
% 0.15/0.66  % Total time               : 0.010 s
% 0.15/0.66  % Maximum resident set size: 3688 pages
% 0.15/0.66  
% 0.15/0.66  % -------------------------------------------------
% 0.15/0.66  % User time                : 0.013 s
% 0.15/0.66  % System time              : 0.004 s
% 0.15/0.66  % Total time               : 0.017 s
% 0.15/0.66  % Maximum resident set size: 4864 pages
% 0.15/0.66  % E exiting
%------------------------------------------------------------------------------