↑ Up

E---3.5.1.SAT-Sat.s

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_55,plain,
    ( ~ vehicle(X1)
    | transport(X1) ),
    c_0_52,
    [final] ).

cnf(c_0_56,plain,
    ( ~ car(X1)
    | vehicle(X1) ),
    c_0_53,
    [final] ).

cnf(c_0_58,plain,
    ( ~ transport(X1)
    | instrumentality(X1) ),
    c_0_54,
    [final] ).

cnf(c_0_59,plain,
    ( ~ car(X1)
    | transport(X1) ),
    inference(spm,[status(thm)],[c_0_55,c_0_56]),
    [final] ).

cnf(c_0_66,plain,
    ( ~ instrumentality(X1)
    | artifact(X1) ),
    c_0_57,
    [final] ).

cnf(c_0_67,plain,
    ( ~ car(X1)
    | instrumentality(X1) ),
    inference(spm,[status(thm)],[c_0_58,c_0_59]),
    [final] ).

cnf(c_0_70,plain,
    ( ~ object(X1)
    | entity(X1) ),
    c_0_60,
    [final] ).

cnf(c_0_71,plain,
    ( ~ artifact(X1)
    | object(X1) ),
    c_0_61,
    [final] ).

cnf(c_0_73,plain,
    ( ~ location(X1)
    | object(X1) ),
    c_0_62,
    [final] ).

cnf(c_0_74,plain,
    ( ~ city(X1)
    | location(X1) ),
    c_0_63,
    [final] ).

cnf(c_0_77,plain,
    ( ~ have(X3,X2,X1)
    | ~ nonhuman(X2)
    | ~ nonhuman(X1)
    | partof(X1,X2) ),
    c_0_64,
    [final] ).

cnf(c_0_78,plain,
    ( ~ of(X1,X2)
    | have(skf1(X1,X2),X2,X1) ),
    c_0_65,
    [final] ).

cnf(c_0_80,plain,
    ( ~ car(X1)
    | artifact(X1) ),
    inference(spm,[status(thm)],[c_0_66,c_0_67]),
    [final] ).

cnf(c_0_81,negated_conjecture,
    car(skc4),
    clause48,
    [final] ).

cnf(c_0_82,plain,
    ( ~ eventuality(X1)
    | ~ entity(X1) ),
    c_0_68,
    [final] ).

cnf(c_0_83,plain,
    ( ~ event(X1)
    | eventuality(X1) ),
    c_0_69,
    [final] ).

cnf(c_0_84,plain,
    ( ~ artifact(X1)
    | entity(X1) ),
    inference(spm,[status(thm)],[c_0_70,c_0_71]),
    [final] ).

cnf(c_0_85,plain,
    ( ~ way(X1)
    | artifact(X1) ),
    c_0_72,
    [final] ).

cnf(c_0_86,plain,
    ( ~ city(X1)
    | object(X1) ),
    inference(spm,[status(thm)],[c_0_73,c_0_74]),
    [final] ).

cnf(c_0_87,plain,
    ( ~ artifact(X1)
    | ~ location(X1) ),
    c_0_75,
    [final] ).

cnf(c_0_88,plain,
    ( ~ partof(X1,X3)
    | ~ partof(X1,X2)
    | X3 = X2 ),
    c_0_76,
    [final] ).

cnf(c_0_89,plain,
    ( ~ nonhuman(X1)
    | ~ nonhuman(X2)
    | ~ of(X1,X2)
    | partof(X1,X2) ),
    inference(spm,[status(thm)],[c_0_77,c_0_78]),
    [final] ).

cnf(c_0_92,plain,
    ( ~ instrumentality(X1)
    | ~ way(X1) ),
    c_0_79,
    [final] ).

cnf(c_0_93,negated_conjecture,
    artifact(skc4),
    inference(spm,[status(thm)],[c_0_80,c_0_81]),
    [final] ).

cnf(c_0_94,plain,
    ( ~ event(X1)
    | ~ entity(X1) ),
    inference(spm,[status(thm)],[c_0_82,c_0_83]),
    [final] ).

cnf(c_0_95,plain,
    ( ~ way(X1)
    | entity(X1) ),
    inference(spm,[status(thm)],[c_0_84,c_0_85]),
    [final] ).

cnf(c_0_96,plain,
    ( ~ city(X1)
    | entity(X1) ),
    inference(spm,[status(thm)],[c_0_70,c_0_86]),
    [final] ).

cnf(c_0_97,negated_conjecture,
    city(skc7),
    clause40,
    [final] ).

cnf(c_0_98,plain,
    ( ~ city(X1)
    | ~ artifact(X1) ),
    inference(spm,[status(thm)],[c_0_87,c_0_74]),
    [final] ).

cnf(c_0_99,plain,
    ( ~ nonhuman(X3)
    | ~ nonhuman(X2)
    | ~ of(X3,X2)
    | ~ partof(X3,X1)
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_88,c_0_89]),
    [final] ).

cnf(c_0_101,plain,
    ( ~ event(X1)
    | ~ have(X1,X2,X3)
    | of(X2,X3) ),
    c_0_90,
    [final] ).

cnf(c_0_102,axiom,
    event(skf1(X1,X2)),
    clause1,
    [final] ).

cnf(c_0_103,plain,
    ( ~ have(X2,X1,X3)
    | ~ human(X1)
    | owner(X1) ),
    c_0_91,
    [final] ).

cnf(c_0_122,plain,
    ( ~ way(X1)
    | ~ car(X1) ),
    inference(spm,[status(thm)],[c_0_92,c_0_67]),
    [final] ).

cnf(c_0_123,negated_conjecture,
    entity(skc4),
    inference(spm,[status(thm)],[c_0_84,c_0_93]),
    [final] ).

cnf(c_0_124,plain,
    ( ~ event(X1)
    | ~ way(X1) ),
    inference(spm,[status(thm)],[c_0_94,c_0_95]),
    [final] ).

cnf(c_0_125,negated_conjecture,
    way(skc5),
    clause43,
    [final] ).

cnf(c_0_126,negated_conjecture,
    entity(skc7),
    inference(spm,[status(thm)],[c_0_96,c_0_97]),
    [final] ).

cnf(c_0_127,negated_conjecture,
    ~ artifact(skc7),
    inference(spm,[status(thm)],[c_0_98,c_0_97]),
    [final] ).

cnf(c_0_128,plain,
    ( ~ nonhuman(X1)
    | ~ nonhuman(X3)
    | ~ nonhuman(X2)
    | ~ of(X3,X1)
    | ~ of(X3,X2)
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_99,c_0_89]),
    [final] ).

cnf(c_0_129,plain,
    ( ~ have(X2,X1,X3)
    | ~ human(X1)
    | of(X1,X3) ),
    c_0_100,
    [final] ).

cnf(c_0_130,plain,
    ( ~ of(X2,X1)
    | of(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_78]),c_0_102])]),
    [final] ).

cnf(c_0_131,plain,
    ( ~ human(X1)
    | ~ of(X2,X1)
    | owner(X1) ),
    inference(spm,[status(thm)],[c_0_103,c_0_78]),
    [final] ).

cnf(c_0_132,plain,
    ( ~ of(X1,X2)
    | ~ owner(X1)
    | have(X3,X1,X2) ),
    c_0_104,
    [final] ).

cnf(c_0_133,plain,
    ( ~ of(X1,X2)
    | ~ owner(X1)
    | human(X1) ),
    c_0_105,
    [final] ).

cnf(c_0_134,plain,
    ( ~ old(X1)
    | ~ new(X1) ),
    c_0_106,
    [final] ).

cnf(c_0_135,plain,
    ( ~ abstraction(X1)
    | ~ eventuality(X1) ),
    c_0_107,
    [final] ).

cnf(c_0_136,plain,
    ( ~ male(X1)
    | ~ female(X1) ),
    c_0_108,
    [final] ).

cnf(c_0_137,plain,
    ( ~ man(X1)
    | ~ woman(X1) ),
    c_0_109,
    [final] ).

cnf(c_0_138,plain,
    ( ~ abstraction(X1)
    | ~ entity(X1) ),
    c_0_110,
    [final] ).

cnf(c_0_139,plain,
    ( ~ human(X1)
    | ~ nonhuman(X1) ),
    c_0_111,
    [final] ).

cnf(c_0_140,plain,
    ( ~ chevy(X1)
    | car(X1) ),
    c_0_112,
    [final] ).

cnf(c_0_141,plain,
    ( ~ street(X1)
    | way(X1) ),
    c_0_113,
    [final] ).

cnf(c_0_142,plain,
    ( ~ hollywood(X1)
    | city(X1) ),
    c_0_114,
    [final] ).

cnf(c_0_143,plain,
    ( ~ man(X1)
    | male(X1) ),
    c_0_115,
    [final] ).

cnf(c_0_144,plain,
    ( ~ male(X1)
    | human(X1) ),
    c_0_116,
    [final] ).

cnf(c_0_145,plain,
    ( ~ female(X1)
    | human(X1) ),
    c_0_117,
    [final] ).

cnf(c_0_146,plain,
    ( ~ woman(X1)
    | female(X1) ),
    c_0_118,
    [final] ).

cnf(c_0_147,plain,
    ( ~ drs(X1)
    | proposition(X1) ),
    c_0_119,
    [final] ).

cnf(c_0_148,plain,
    ( ~ proposition(X1)
    | drs(X1) ),
    c_0_120,
    [final] ).

cnf(c_0_149,plain,
    ( ~ nonhuman(X1)
    | entity(X1) ),
    c_0_121,
    [final] ).

cnf(c_0_150,negated_conjecture,
    ~ way(skc4),
    inference(spm,[status(thm)],[c_0_122,c_0_81]),
    [final] ).

cnf(c_0_151,negated_conjecture,
    ~ event(skc4),
    inference(spm,[status(thm)],[c_0_94,c_0_123]),
    [final] ).

cnf(c_0_152,negated_conjecture,
    ~ event(skc5),
    inference(spm,[status(thm)],[c_0_124,c_0_125]),
    [final] ).

cnf(c_0_153,negated_conjecture,
    ~ event(skc7),
    inference(spm,[status(thm)],[c_0_94,c_0_126]),
    [final] ).

cnf(c_0_154,negated_conjecture,
    ~ way(skc7),
    inference(spm,[status(thm)],[c_0_127,c_0_85]),
    [final] ).

cnf(c_0_155,negated_conjecture,
    barrel(skc6,skc4),
    clause52,
    [final] ).

cnf(c_0_156,negated_conjecture,
    down(skc6,skc5),
    clause51,
    [final] ).

cnf(c_0_157,negated_conjecture,
    in(skc6,skc7),
    clause50,
    [final] ).

cnf(c_0_158,negated_conjecture,
    white(skc4),
    clause47,
    [final] ).

cnf(c_0_159,negated_conjecture,
    dirty(skc4),
    clause46,
    [final] ).

cnf(c_0_160,negated_conjecture,
    lonely(skc5),
    clause44,
    [final] ).

cnf(c_0_161,negated_conjecture,
    old(skc4),
    clause45,
    [final] ).

cnf(c_0_162,negated_conjecture,
    chevy(skc4),
    clause49,
    [final] ).

cnf(c_0_163,negated_conjecture,
    street(skc5),
    clause42,
    [final] ).

cnf(c_0_164,negated_conjecture,
    hollywood(skc7),
    clause39,
    [final] ).

cnf(c_0_165,negated_conjecture,
    event(skc6),
    clause41,
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NLP002-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/11.78  % Computer : n008.cluster.edu
% 0.12/11.78  % Model    : x86_64 x86_64
% 0.12/11.78  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/11.78  % Memory   : 8046.5625MB
% 0.12/11.78  % OS       : Linux 6.8.0-71-generic
% 0.12/11.78  % CPULimit : 300
% 0.12/11.78  % WCLimit  : 300
% 0.12/11.78  % DateTime : Mon Sep 21 01:31:24 UTC 2026
% 0.12/11.79  % CPUTime  : 
% 0.12/11.79  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/11.83  Running first-order theorem proving
% 0.15/11.83  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/11.85  % Version: 3.5.1
% 0.15/11.85  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/11.85  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/11.85  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/11.85  % Starting new_bool_3 with 300s (1) cores
% 0.15/11.85  % Starting new_bool_1 with 300s (1) cores
% 0.15/11.85  % Starting sh5l with 300s (1) cores
% 0.15/11.85  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4061735 completed with status 1
% 0.15/11.85  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/11.85  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/11.85  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/11.85  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/11.85  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/11.85  % No SInE strategy applied
% 0.15/11.85  % Search class: FHHSF-FFMM22-SFFFFFNN
% 0.15/11.85  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/11.85  % Starting SubtermCWHack with 136s (1) cores
% 0.15/11.85  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/11.85  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/11.85  % Starting new_bool_3 with 136s (1) cores
% 0.15/11.85  % Starting new_bool_1 with 136s (1) cores
% 0.15/11.85  % SubtermCWHack with pid 4061739 completed with status 1
% 0.15/11.85  % Result found by SubtermCWHack
% 0.15/11.85  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/11.85  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/11.85  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/11.85  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/11.85  % No SInE strategy applied
% 0.15/11.85  % Search class: FHHSF-FFMM22-SFFFFFNN
% 0.15/11.85  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/11.85  % Starting SubtermCWHack with 136s (1) cores
% 0.15/11.85  % Preprocessing time       : 0.001 s
% 0.15/11.85  
% 0.15/11.85  % No proof found!
% 0.15/11.85  % SZS status Satisfiable
% 0.15/11.85  % SZS output start Saturation
% See solution above
% 0.15/11.85  % Parsed axioms                        : 52
% 0.15/11.85  % Removed by relevancy pruning/SinE    : 0
% 0.15/11.85  % Initial clauses                      : 52
% 0.15/11.85  % Removed in clause preprocessing      : 0
% 0.15/11.85  % Initial clauses in saturation        : 52
% 0.15/11.85  % Processed clauses                    : 78
% 0.15/11.85  % ...of these trivial                  : 0
% 0.15/11.85  % ...subsumed                          : 1
% 0.15/11.85  % ...remaining for further processing  : 77
% 0.15/11.85  % Other redundant clauses eliminated   : 0
% 0.15/11.85  % Clauses deleted for lack of memory   : 0
% 0.15/11.85  % Backward-subsumed                    : 0
% 0.15/11.85  % Backward-rewritten                   : 0
% 0.15/11.85  % Generated clauses                    : 30
% 0.15/11.85  % ...of the previous two non-redundant : 26
% 0.15/11.85  % ...aggressively subsumed             : 0
% 0.15/11.85  % Contextual simplify-reflections      : 0
% 0.15/11.85  % Paramodulations                      : 30
% 0.15/11.85  % Factorizations                       : 0
% 0.15/11.85  % NegExts                              : 0
% 0.15/11.85  % Equation resolutions                 : 0
% 0.15/11.85  % Disequality decompositions           : 0
% 0.15/11.85  % Total rewrite steps                  : 4
% 0.15/11.85  % ...of those cached                   : 0
% 0.15/11.85  % Propositional unsat checks           : 0
% 0.15/11.85  %    Propositional check models        : 0
% 0.15/11.85  %    Propositional check unsatisfiable : 0
% 0.15/11.85  %    Propositional clauses             : 0
% 0.15/11.85  %    Propositional clauses after purity: 0
% 0.15/11.85  %    Propositional unsat core size     : 0
% 0.15/11.85  %    Propositional preprocessing time  : 0.000
% 0.15/11.85  %    Propositional encoding time       : 0.000
% 0.15/11.85  %    Propositional solver time         : 0.000
% 0.15/11.85  %    Success case prop preproc time    : 0.000
% 0.15/11.85  %    Success case prop encoding time   : 0.000
% 0.15/11.85  %    Success case prop solver time     : 0.000
% 0.15/11.85  % Current number of processed clauses  : 77
% 0.15/11.85  %    Positive orientable unit clauses  : 18
% 0.15/11.85  %    Positive unorientable unit clauses: 0
% 0.15/11.85  %    Negative unit clauses             : 6
% 0.15/11.85  %    Non-unit-clauses                  : 53
% 0.15/11.85  % Current number of unprocessed clauses: 0
% 0.15/11.85  % ...number of literals in the above   : 0
% 0.15/11.85  % Current number of archived formulas  : 0
% 0.15/11.85  % Current number of archived clauses   : 0
% 0.15/11.85  % Clause-clause subsumption calls (NU) : 1177
% 0.15/11.85  % Rec. Clause-clause subsumption calls : 890
% 0.15/11.85  % Non-unit clause-clause subsumptions  : 1
% 0.15/11.85  % Unit Clause-clause subsumption calls : 240
% 0.15/11.85  % Rewrite failures with RHS unbound    : 0
% 0.15/11.85  % BW rewrite match attempts            : 0
% 0.15/11.85  % BW rewrite match successes           : 0
% 0.15/11.85  % Condensation attempts                : 0
% 0.15/11.85  % Condensation successes               : 0
% 0.15/11.85  % Termbank termtop insertions          : 1446
% 0.15/11.85  % Search garbage collected termcells   : 95
% 0.15/11.85  
% 0.15/11.85  % -------------------------------------------------
% 0.15/11.85  % User time                : 0.003 s
% 0.15/11.85  % System time              : 0.003 s
% 0.15/11.85  % Total time               : 0.007 s
% 0.15/11.85  % Maximum resident set size: 3612 pages
% 0.15/11.85  
% 0.15/11.85  % -------------------------------------------------
% 0.15/11.85  % User time                : 0.015 s
% 0.15/11.85  % System time              : 0.013 s
% 0.15/11.85  % Total time               : 0.028 s
% 0.15/11.85  % Maximum resident set size: 4864 pages
% 0.15/11.85  % E exiting
%------------------------------------------------------------------------------