↑ Up

E---3.5.1.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : NLP118-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 : n018.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:03 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_45,negated_conjecture,
    actual_world(skc11),
    clause2,
    [final] ).

cnf(c_0_75,negated_conjecture,
    ~ ssSkC0,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_70]),c_0_71]),c_0_72]),
    [final] ).

cnf(c_0_81,negated_conjecture,
    ( ~ actual_world(X1)
    | ~ chevy(X1,X5)
    | ~ white(X1,X5)
    | ~ dirty(X1,X5)
    | ~ old(X1,X5)
    | ~ agent(X1,X3,X5)
    | ~ barrel(X1,X3)
    | ~ present(X1,X3)
    | ~ event(X1,X3)
    | ~ of(X1,X4,X2)
    | ~ hollywood_placename(X1,X4)
    | ~ placename(X1,X4)
    | ~ in(X1,X3,X2)
    | ~ down(X1,X3,X2)
    | ~ lonely(X1,X2)
    | ~ street(X1,X2)
    | ~ city(X1,X2)
    | ssSkC0 ),
    c_0_73,
    [final] ).

cnf(c_0_82,negated_conjecture,
    down(skc16,skc17,skc18),
    inference(sr,[status(thm)],[c_0_74,c_0_75]),
    [final] ).

cnf(c_0_83,negated_conjecture,
    lonely(skc16,skc18),
    inference(sr,[status(thm)],[c_0_76,c_0_75]),
    [final] ).

cnf(c_0_84,negated_conjecture,
    street(skc16,skc18),
    inference(sr,[status(thm)],[c_0_77,c_0_75]),
    [final] ).

cnf(c_0_85,negated_conjecture,
    event(skc16,skc17),
    inference(sr,[status(thm)],[c_0_78,c_0_75]),
    [final] ).

cnf(c_0_86,negated_conjecture,
    present(skc16,skc17),
    inference(sr,[status(thm)],[c_0_79,c_0_75]),
    [final] ).

cnf(c_0_87,negated_conjecture,
    barrel(skc16,skc17),
    inference(sr,[status(thm)],[c_0_80,c_0_75]),
    [final] ).

cnf(c_0_88,negated_conjecture,
    actual_world(skc16),
    clause1,
    [final] ).

cnf(c_0_99,negated_conjecture,
    ( ~ old(skc16,X2)
    | ~ dirty(skc16,X2)
    | ~ white(skc16,X2)
    | ~ chevy(skc16,X2)
    | ~ hollywood_placename(skc16,X1)
    | ~ placename(skc16,X1)
    | ~ city(skc16,skc18)
    | ~ agent(skc16,skc17,X2)
    | ~ in(skc16,skc17,skc18)
    | ~ of(skc16,X1,skc18) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]),c_0_84]),c_0_85]),c_0_86]),c_0_87]),c_0_88])]),c_0_75]),
    [final] ).

cnf(c_0_100,negated_conjecture,
    of(skc16,skc19,skc20),
    inference(sr,[status(thm)],[c_0_89,c_0_75]),
    [final] ).

cnf(c_0_101,negated_conjecture,
    in(skc16,skc17,skc20),
    inference(sr,[status(thm)],[c_0_90,c_0_75]),
    [final] ).

cnf(c_0_102,negated_conjecture,
    agent(skc16,skc17,skc21),
    inference(sr,[status(thm)],[c_0_91,c_0_75]),
    [final] ).

cnf(c_0_103,negated_conjecture,
    city(skc16,skc20),
    inference(sr,[status(thm)],[c_0_92,c_0_75]),
    [final] ).

cnf(c_0_104,negated_conjecture,
    placename(skc16,skc19),
    inference(sr,[status(thm)],[c_0_93,c_0_75]),
    [final] ).

cnf(c_0_105,negated_conjecture,
    hollywood_placename(skc16,skc19),
    inference(sr,[status(thm)],[c_0_94,c_0_75]),
    [final] ).

cnf(c_0_106,negated_conjecture,
    chevy(skc16,skc21),
    inference(sr,[status(thm)],[c_0_95,c_0_75]),
    [final] ).

cnf(c_0_107,negated_conjecture,
    white(skc16,skc21),
    inference(sr,[status(thm)],[c_0_96,c_0_75]),
    [final] ).

cnf(c_0_108,negated_conjecture,
    dirty(skc16,skc21),
    inference(sr,[status(thm)],[c_0_97,c_0_75]),
    [final] ).

cnf(c_0_109,negated_conjecture,
    old(skc16,skc21),
    inference(sr,[status(thm)],[c_0_98,c_0_75]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NLP118-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36  % Computer : n018.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.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Mon Sep 21 01:43:13 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41  Running first-order theorem proving
% 0.14/0.41  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.14/0.43  % Version: 3.5.1
% 0.14/0.43  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43  % Starting sh5l with 300s (1) cores
% 0.14/0.43  % new_bool_3 with pid 703941 completed with status 1
% 0.14/0.43  % Result found by new_bool_3
% 0.14/0.43  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43  % Search class: FGHNF-FFMM00-SFFFFFNN
% 0.14/0.43  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43  % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.43  % SubtermCWHack with pid 703946 completed with status 1
% 0.14/0.43  % Result found by SubtermCWHack
% 0.14/0.43  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43  % Search class: FGHNF-FFMM00-SFFFFFNN
% 0.14/0.43  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43  % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.43  % Preprocessing time       : 0.001 s
% 0.14/0.43  
% 0.14/0.43  % No proof found!
% 0.14/0.43  % SZS status Satisfiable
% 0.14/0.43  % SZS output start Saturation
% See solution above
% 0.14/0.43  % Parsed axioms                        : 36
% 0.14/0.43  % Removed by relevancy pruning/SinE    : 0
% 0.14/0.43  % Initial clauses                      : 36
% 0.14/0.43  % Removed in clause preprocessing      : 0
% 0.14/0.43  % Initial clauses in saturation        : 36
% 0.14/0.43  % Processed clauses                    : 58
% 0.14/0.43  % ...of these trivial                  : 1
% 0.14/0.43  % ...subsumed                          : 0
% 0.14/0.43  % ...remaining for further processing  : 57
% 0.14/0.43  % Other redundant clauses eliminated   : 0
% 0.14/0.43  % Clauses deleted for lack of memory   : 0
% 0.14/0.43  % Backward-subsumed                    : 20
% 0.14/0.43  % Backward-rewritten                   : 0
% 0.14/0.43  % Generated clauses                    : 23
% 0.14/0.43  % ...of the previous two non-redundant : 23
% 0.14/0.43  % ...aggressively subsumed             : 0
% 0.14/0.43  % Contextual simplify-reflections      : 18
% 0.14/0.43  % Paramodulations                      : 7
% 0.14/0.43  % Factorizations                       : 0
% 0.14/0.43  % NegExts                              : 0
% 0.14/0.43  % Equation resolutions                 : 0
% 0.14/0.43  % Disequality decompositions           : 0
% 0.14/0.43  % Total rewrite steps                  : 10
% 0.14/0.43  % ...of those cached                   : 3
% 0.14/0.43  % Propositional unsat checks           : 0
% 0.14/0.43  %    Propositional check models        : 0
% 0.14/0.43  %    Propositional check unsatisfiable : 0
% 0.14/0.43  %    Propositional clauses             : 0
% 0.14/0.43  %    Propositional clauses after purity: 0
% 0.14/0.43  %    Propositional unsat core size     : 0
% 0.14/0.43  %    Propositional preprocessing time  : 0.000
% 0.14/0.43  %    Propositional encoding time       : 0.000
% 0.14/0.43  %    Propositional solver time         : 0.000
% 0.14/0.43  %    Success case prop preproc time    : 0.000
% 0.14/0.43  %    Success case prop encoding time   : 0.000
% 0.14/0.43  %    Success case prop solver time     : 0.000
% 0.14/0.43  % Current number of processed clauses  : 21
% 0.14/0.43  %    Positive orientable unit clauses  : 18
% 0.14/0.43  %    Positive unorientable unit clauses: 0
% 0.14/0.43  %    Negative unit clauses             : 1
% 0.14/0.43  %    Non-unit-clauses                  : 2
% 0.14/0.43  % Current number of unprocessed clauses: 0
% 0.14/0.43  % ...number of literals in the above   : 0
% 0.14/0.43  % Current number of archived formulas  : 0
% 0.14/0.43  % Current number of archived clauses   : 36
% 0.14/0.43  % Clause-clause subsumption calls (NU) : 203
% 0.14/0.43  % Rec. Clause-clause subsumption calls : 98
% 0.14/0.43  % Non-unit clause-clause subsumptions  : 20
% 0.14/0.43  % Unit Clause-clause subsumption calls : 19
% 0.14/0.43  % Rewrite failures with RHS unbound    : 0
% 0.14/0.43  % BW rewrite match attempts            : 2
% 0.14/0.43  % BW rewrite match successes           : 0
% 0.14/0.43  % Condensation attempts                : 0
% 0.14/0.43  % Condensation successes               : 0
% 0.14/0.43  % Termbank termtop insertions          : 1733
% 0.14/0.43  % Search garbage collected termcells   : 113
% 0.14/0.43  
% 0.14/0.43  % -------------------------------------------------
% 0.14/0.43  % User time                : 0.004 s
% 0.14/0.43  % System time              : 0.002 s
% 0.14/0.43  % Total time               : 0.006 s
% 0.14/0.43  % Maximum resident set size: 3664 pages
% 0.14/0.43  
% 0.14/0.43  % -------------------------------------------------
% 0.14/0.43  % User time                : 0.005 s
% 0.14/0.43  % System time              : 0.006 s
% 0.14/0.43  % Total time               : 0.011 s
% 0.14/0.43  % Maximum resident set size: 4608 pages
% 0.14/0.43  % E exiting
%------------------------------------------------------------------------------