↑ Up

E---3.5.1.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : NLP120-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 : n004.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.15s 5.44s
% Output   : Saturation 0.15s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named clause1ERROR: Could not build tree for root c_0_39ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_39,negated_conjecture,
    actual_world(skc17),
    clause1,
    [final] ).

cnf(c_0_65,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_52,c_0_53]),c_0_54]),c_0_55]),c_0_56]),c_0_57]),
    [final] ).

cnf(c_0_77,negated_conjecture,
    ( ~ actual_world(X1)
    | ~ city(X1,X5)
    | ~ chevy(X1,X5)
    | ~ white(X1,X5)
    | ~ dirty(X1,X5)
    | ~ old(X1,X5)
    | ~ placename(X1,X4)
    | ~ hollywood_placename(X1,X4)
    | ~ event(X1,X2)
    | ~ present(X1,X2)
    | ~ barrel(X1,X2)
    | ~ lonely(X1,X3)
    | ~ street(X1,X3)
    | ~ agent(X1,X2,X5)
    | ~ in(X1,X2,X5)
    | ~ of(X1,X4,X5)
    | ~ down(X1,X2,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]),
    [final] ).

cnf(c_0_78,negated_conjecture,
    down(skc11,skc12,skc16),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_65])]),
    [final] ).

cnf(c_0_79,negated_conjecture,
    street(skc11,skc16),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_65])]),
    [final] ).

cnf(c_0_80,negated_conjecture,
    lonely(skc11,skc16),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_65])]),
    [final] ).

cnf(c_0_81,negated_conjecture,
    barrel(skc11,skc12),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_65])]),
    [final] ).

cnf(c_0_82,negated_conjecture,
    present(skc11,skc12),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_65])]),
    [final] ).

cnf(c_0_83,negated_conjecture,
    event(skc11,skc12),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_65])]),
    [final] ).

cnf(c_0_84,negated_conjecture,
    actual_world(skc11),
    clause2,
    [final] ).

cnf(c_0_95,negated_conjecture,
    ( ~ city(skc11,X2)
    | ~ chevy(skc11,X2)
    | ~ white(skc11,X2)
    | ~ dirty(skc11,X2)
    | ~ old(skc11,X2)
    | ~ placename(skc11,X1)
    | ~ hollywood_placename(skc11,X1)
    | ~ agent(skc11,skc12,X2)
    | ~ in(skc11,skc12,X2)
    | ~ of(skc11,X1,X2) ),
    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_77,c_0_78]),c_0_79]),c_0_80]),c_0_81]),c_0_82]),c_0_83]),c_0_84])]),
    [final] ).

cnf(c_0_96,negated_conjecture,
    of(skc11,skc14,skc15),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_65])]),
    [final] ).

cnf(c_0_97,negated_conjecture,
    in(skc11,skc12,skc15),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_65])]),
    [final] ).

cnf(c_0_98,negated_conjecture,
    hollywood_placename(skc11,skc14),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_65])]),
    [final] ).

cnf(c_0_99,negated_conjecture,
    placename(skc11,skc14),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_65])]),
    [final] ).

cnf(c_0_100,negated_conjecture,
    city(skc11,skc15),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_65])]),
    [final] ).

cnf(c_0_106,negated_conjecture,
    ( ~ chevy(skc11,skc15)
    | ~ white(skc11,skc15)
    | ~ dirty(skc11,skc15)
    | ~ old(skc11,skc15)
    | ~ agent(skc11,skc12,skc15) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97]),c_0_98]),c_0_99]),c_0_100])]),
    [final] ).

cnf(c_0_107,negated_conjecture,
    agent(skc11,skc12,skc13),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_65])]),
    [final] ).

cnf(c_0_108,negated_conjecture,
    chevy(skc11,skc13),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_65])]),
    [final] ).

cnf(c_0_109,negated_conjecture,
    white(skc11,skc13),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_65])]),
    [final] ).

cnf(c_0_110,negated_conjecture,
    dirty(skc11,skc13),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_65])]),
    [final] ).

cnf(c_0_111,negated_conjecture,
    old(skc11,skc13),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_65])]),
    [final] ).

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