↑ Up

E---3.5.1.SAT-Sat.s

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_37,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_36,
    [final] ).

cnf(c_0_38,negated_conjecture,
    ( of(skc15,skc18,skc17)
    | ssSkC0 ),
    clause30,
    [final] ).

cnf(c_0_39,negated_conjecture,
    actual_world(skc15),
    clause1,
    [final] ).

cnf(c_0_40,negated_conjecture,
    ( city(skc15,skc17)
    | ssSkC0 ),
    clause12,
    [final] ).

cnf(c_0_41,negated_conjecture,
    ( hollywood_placename(skc15,skc18)
    | ssSkC0 ),
    clause13,
    [final] ).

cnf(c_0_42,negated_conjecture,
    ( placename(skc15,skc18)
    | ssSkC0 ),
    clause14,
    [final] ).

cnf(c_0_43,negated_conjecture,
    ( ~ event(skc15,X1)
    | ~ present(skc15,X1)
    | ~ barrel(skc15,X1)
    | ~ lonely(skc15,skc17)
    | ~ street(skc15,skc17)
    | ~ old(skc15,X2)
    | ~ dirty(skc15,X2)
    | ~ white(skc15,X2)
    | ~ chevy(skc15,X2)
    | ~ down(skc15,X1,skc17)
    | ~ in(skc15,X1,skc17)
    | ~ agent(skc15,X1,X2)
    | ssSkC0 ),
    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_37,c_0_38]),c_0_39])]),c_0_40]),c_0_41]),c_0_42]),
    [final] ).

cnf(c_0_44,negated_conjecture,
    ( agent(skc15,skc16,skc17)
    | ssSkC0 ),
    clause29,
    [final] ).

cnf(c_0_45,negated_conjecture,
    ( event(skc15,skc16)
    | ssSkC0 ),
    clause3,
    [final] ).

cnf(c_0_46,negated_conjecture,
    ( present(skc15,skc16)
    | ssSkC0 ),
    clause4,
    [final] ).

cnf(c_0_47,negated_conjecture,
    ( barrel(skc15,skc16)
    | ssSkC0 ),
    clause5,
    [final] ).

cnf(c_0_48,negated_conjecture,
    ( old(skc15,skc17)
    | ssSkC0 ),
    clause8,
    [final] ).

cnf(c_0_49,negated_conjecture,
    ( dirty(skc15,skc17)
    | ssSkC0 ),
    clause9,
    [final] ).

cnf(c_0_50,negated_conjecture,
    ( white(skc15,skc17)
    | ssSkC0 ),
    clause10,
    [final] ).

cnf(c_0_51,negated_conjecture,
    ( chevy(skc15,skc17)
    | ssSkC0 ),
    clause11,
    [final] ).

cnf(c_0_52,negated_conjecture,
    ( in(skc15,skc16,skc17)
    | ssSkC0 ),
    clause28,
    [final] ).

cnf(c_0_70,negated_conjecture,
    ( ~ lonely(skc15,skc17)
    | ~ street(skc15,skc17)
    | ~ down(skc15,skc16,skc17)
    | ssSkC0 ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46]),c_0_47]),c_0_48]),c_0_49]),c_0_50]),c_0_51]),c_0_52]),
    [final] ).

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

cnf(c_0_72,negated_conjecture,
    ( down(skc15,skc16,skc19)
    | ssSkC0 ),
    clause27,
    [final] ).

cnf(c_0_73,negated_conjecture,
    ( ~ ssSkC0
    | of(skc10,skc14,skc13) ),
    c_0_54,
    [final] ).

cnf(c_0_74,negated_conjecture,
    ( ~ ssSkC0
    | agent(skc10,skc11,skc12) ),
    c_0_55,
    [final] ).

cnf(c_0_75,negated_conjecture,
    ( ~ ssSkC0
    | in(skc10,skc11,skc13) ),
    c_0_56,
    [final] ).

cnf(c_0_76,negated_conjecture,
    ( ~ ssSkC0
    | down(skc10,skc11,skc13) ),
    c_0_57,
    [final] ).

cnf(c_0_77,negated_conjecture,
    ( street(skc15,skc19)
    | ssSkC0 ),
    clause7,
    [final] ).

cnf(c_0_78,negated_conjecture,
    ( lonely(skc15,skc19)
    | ssSkC0 ),
    clause6,
    [final] ).

cnf(c_0_79,negated_conjecture,
    ( ~ ssSkC0
    | placename(skc10,skc14) ),
    c_0_58,
    [final] ).

cnf(c_0_80,negated_conjecture,
    ( ~ ssSkC0
    | hollywood_placename(skc10,skc14) ),
    c_0_59,
    [final] ).

cnf(c_0_81,negated_conjecture,
    ( ~ ssSkC0
    | city(skc10,skc13) ),
    c_0_60,
    [final] ).

cnf(c_0_82,negated_conjecture,
    ( ~ ssSkC0
    | chevy(skc10,skc12) ),
    c_0_61,
    [final] ).

cnf(c_0_83,negated_conjecture,
    ( ~ ssSkC0
    | white(skc10,skc12) ),
    c_0_62,
    [final] ).

cnf(c_0_84,negated_conjecture,
    ( ~ ssSkC0
    | dirty(skc10,skc12) ),
    c_0_63,
    [final] ).

cnf(c_0_85,negated_conjecture,
    ( ~ ssSkC0
    | old(skc10,skc12) ),
    c_0_64,
    [final] ).

cnf(c_0_86,negated_conjecture,
    ( ~ ssSkC0
    | street(skc10,skc13) ),
    c_0_65,
    [final] ).

cnf(c_0_87,negated_conjecture,
    ( ~ ssSkC0
    | lonely(skc10,skc13) ),
    c_0_66,
    [final] ).

cnf(c_0_88,negated_conjecture,
    ( ~ ssSkC0
    | barrel(skc10,skc11) ),
    c_0_67,
    [final] ).

cnf(c_0_89,negated_conjecture,
    ( ~ ssSkC0
    | present(skc10,skc11) ),
    c_0_68,
    [final] ).

cnf(c_0_90,negated_conjecture,
    ( ~ ssSkC0
    | event(skc10,skc11) ),
    c_0_69,
    [final] ).

cnf(c_0_91,negated_conjecture,
    actual_world(skc10),
    clause2,
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NLP116-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.12/0.37  % Computer : n015.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Mon Sep 21 01:43:50 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.42  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.12/0.44  % Version: 3.5.1
% 0.12/0.44  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.12/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.12/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44  % Starting sh5l with 300s (1) cores
% 0.12/0.44  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 289375 completed with status 1
% 0.12/0.44  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.12/0.44  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.12/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.12/0.44  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.44  % No SInE strategy applied
% 0.12/0.44  % Search class: FGHNF-FFMM00-SFFFFFNN
% 0.12/0.44  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.44  % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.44  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.12/0.44  % Starting H----_011_C07_F1_PI_AE_OS_R8_SP_S1U with 136s (1) cores
% 0.12/0.44  % Starting G----_425_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.12/0.44  % Starting G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.12/0.44  % G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 289383 completed with status 1
% 0.12/0.44  % Result found by G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.44  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.12/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.12/0.44  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.44  % No SInE strategy applied
% 0.12/0.44  % Search class: FGHNF-FFMM00-SFFFFFNN
% 0.12/0.44  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.44  % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.44  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.12/0.44  % Starting H----_011_C07_F1_PI_AE_OS_R8_SP_S1U with 136s (1) cores
% 0.12/0.44  % Starting G----_425_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.12/0.44  % Starting G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.12/0.44  % Preprocessing time       : 0.001 s
% 0.12/0.44  % Presaturation interreduction done
% 0.12/0.44  
% 0.12/0.44  % No proof found!
% 0.12/0.44  % SZS status Satisfiable
% 0.12/0.44  % SZS output start Saturation
% See solution above
% 0.12/0.44  % Parsed axioms                        : 36
% 0.12/0.44  % Removed by relevancy pruning/SinE    : 0
% 0.12/0.44  % Initial clauses                      : 36
% 0.12/0.44  % Removed in clause preprocessing      : 0
% 0.12/0.44  % Initial clauses in saturation        : 36
% 0.12/0.44  % Processed clauses                    : 75
% 0.12/0.44  % ...of these trivial                  : 1
% 0.12/0.44  % ...subsumed                          : 0
% 0.12/0.44  % ...remaining for further processing  : 74
% 0.12/0.44  % Other redundant clauses eliminated   : 0
% 0.12/0.44  % Clauses deleted for lack of memory   : 0
% 0.12/0.44  % Backward-subsumed                    : 0
% 0.12/0.44  % Backward-rewritten                   : 0
% 0.12/0.44  % Generated clauses                    : 3
% 0.12/0.44  % ...of the previous two non-redundant : 3
% 0.12/0.44  % ...aggressively subsumed             : 0
% 0.12/0.44  % Contextual simplify-reflections      : 11
% 0.12/0.44  % Paramodulations                      : 3
% 0.12/0.44  % Factorizations                       : 0
% 0.12/0.44  % NegExts                              : 0
% 0.12/0.44  % Equation resolutions                 : 0
% 0.12/0.44  % Disequality decompositions           : 0
% 0.12/0.44  % Total rewrite steps                  : 2
% 0.12/0.44  % ...of those cached                   : 0
% 0.12/0.44  % Propositional unsat checks           : 0
% 0.12/0.44  %    Propositional check models        : 0
% 0.12/0.44  %    Propositional check unsatisfiable : 0
% 0.12/0.44  %    Propositional clauses             : 0
% 0.12/0.44  %    Propositional clauses after purity: 0
% 0.12/0.44  %    Propositional unsat core size     : 0
% 0.12/0.44  %    Propositional preprocessing time  : 0.000
% 0.12/0.44  %    Propositional encoding time       : 0.000
% 0.12/0.44  %    Propositional solver time         : 0.000
% 0.12/0.44  %    Success case prop preproc time    : 0.000
% 0.12/0.44  %    Success case prop encoding time   : 0.000
% 0.12/0.44  %    Success case prop solver time     : 0.000
% 0.12/0.44  % Current number of processed clauses  : 38
% 0.12/0.44  %    Positive orientable unit clauses  : 2
% 0.12/0.44  %    Positive unorientable unit clauses: 0
% 0.12/0.44  %    Negative unit clauses             : 0
% 0.12/0.44  %    Non-unit-clauses                  : 36
% 0.12/0.44  % Current number of unprocessed clauses: 0
% 0.12/0.44  % ...number of literals in the above   : 0
% 0.12/0.44  % Current number of archived formulas  : 0
% 0.12/0.44  % Current number of archived clauses   : 36
% 0.12/0.44  % Clause-clause subsumption calls (NU) : 236
% 0.12/0.44  % Rec. Clause-clause subsumption calls : 177
% 0.12/0.44  % Non-unit clause-clause subsumptions  : 11
% 0.12/0.44  % Unit Clause-clause subsumption calls : 0
% 0.12/0.44  % Rewrite failures with RHS unbound    : 0
% 0.12/0.44  % BW rewrite match attempts            : 0
% 0.12/0.44  % BW rewrite match successes           : 0
% 0.12/0.44  % Condensation attempts                : 0
% 0.12/0.44  % Condensation successes               : 0
% 0.12/0.44  % Termbank termtop insertions          : 1543
% 0.12/0.44  % Search garbage collected termcells   : 117
% 0.12/0.44  
% 0.12/0.44  % -------------------------------------------------
% 0.12/0.44  % User time                : 0.002 s
% 0.12/0.44  % System time              : 0.003 s
% 0.12/0.44  % Total time               : 0.005 s
% 0.12/0.44  % Maximum resident set size: 3664 pages
% 0.12/0.44  
% 0.12/0.44  % -------------------------------------------------
% 0.12/0.44  % User time                : 0.019 s
% 0.12/0.44  % System time              : 0.012 s
% 0.12/0.44  % Total time               : 0.031 s
% 0.12/0.44  % Maximum resident set size: 4864 pages
% 0.12/0.44  % E exiting
%------------------------------------------------------------------------------