TSTP Solution File: NLP109-1 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : NLP109-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n023.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 00:56:58 EDT 2024

% Result   : Satisfiable 0.20s 0.50s
% Output   : Saturation 0.20s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_91)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_60,plain,
    ( ~ nonexistent(X1,X2)
    | ~ existent(X1,X2) ),
    c_0_50,
    [final] ).

cnf(c_0_61,plain,
    ( existent(X1,X2)
    | ~ entity(X1,X2) ),
    c_0_51,
    [final] ).

cnf(c_0_63,plain,
    ( entity(X1,X2)
    | ~ organism(X1,X2) ),
    c_0_52,
    [final] ).

cnf(c_0_64,plain,
    ( organism(X1,X2)
    | ~ human_person(X1,X2) ),
    c_0_53,
    [final] ).

cnf(c_0_66,plain,
    ( ~ nonliving(X1,X2)
    | ~ animate(X1,X2) ),
    c_0_54,
    [final] ).

cnf(c_0_67,plain,
    ( animate(X1,X2)
    | ~ human_person(X1,X2) ),
    c_0_55,
    [final] ).

cnf(c_0_69,plain,
    ( object(X1,X2)
    | ~ substance_matter(X1,X2) ),
    c_0_56,
    [final] ).

cnf(c_0_70,plain,
    ( substance_matter(X1,X2)
    | ~ food(X1,X2) ),
    c_0_57,
    [final] ).

cnf(c_0_74,plain,
    ( artifact(X1,X2)
    | ~ building(X1,X2) ),
    c_0_58,
    [final] ).

cnf(c_0_75,plain,
    ( building(X1,X2)
    | ~ restaurant(X1,X2) ),
    c_0_59,
    [final] ).

cnf(c_0_78,plain,
    ( ~ entity(X1,X2)
    | ~ nonexistent(X1,X2) ),
    inference(spm,[status(thm)],[c_0_60,c_0_61]),
    [final] ).

cnf(c_0_79,plain,
    ( nonexistent(X1,X2)
    | ~ eventuality(X1,X2) ),
    c_0_62,
    [final] ).

cnf(c_0_81,plain,
    ( entity(X1,X2)
    | ~ human_person(X1,X2) ),
    inference(spm,[status(thm)],[c_0_63,c_0_64]),
    [final] ).

cnf(c_0_82,plain,
    ( human_person(X1,X2)
    | ~ customer(X1,X2) ),
    c_0_65,
    [final] ).

cnf(c_0_83,plain,
    ( ~ human_person(X1,X2)
    | ~ nonliving(X1,X2) ),
    inference(spm,[status(thm)],[c_0_66,c_0_67]),
    [final] ).

cnf(c_0_84,plain,
    ( nonliving(X1,X2)
    | ~ object(X1,X2) ),
    c_0_68,
    [final] ).

cnf(c_0_85,plain,
    ( object(X1,X2)
    | ~ food(X1,X2) ),
    inference(spm,[status(thm)],[c_0_69,c_0_70]),
    [final] ).

cnf(c_0_86,plain,
    ( food(X1,X2)
    | ~ beverage(X1,X2) ),
    c_0_71,
    [final] ).

cnf(c_0_87,plain,
    ( beverage(X1,X2)
    | ~ coffee(X1,X2) ),
    c_0_72,
    [final] ).

cnf(c_0_88,negated_conjecture,
    coffee(skc3,skc5),
    clause36,
    [final] ).

cnf(c_0_89,plain,
    ( object(X1,X2)
    | ~ artifact(X1,X2) ),
    c_0_73,
    [final] ).

cnf(c_0_90,plain,
    ( artifact(X1,X2)
    | ~ restaurant(X1,X2) ),
    inference(spm,[status(thm)],[c_0_74,c_0_75]),
    [final] ).

cnf(c_0_93,plain,
    ( ~ living(X1,X2)
    | ~ nonliving(X1,X2) ),
    c_0_76,
    [final] ).

cnf(c_0_94,plain,
    ( living(X1,X2)
    | ~ organism(X1,X2) ),
    c_0_77,
    [final] ).

cnf(c_0_95,plain,
    ( ~ entity(X1,X2)
    | ~ eventuality(X1,X2) ),
    inference(spm,[status(thm)],[c_0_78,c_0_79]),
    [final] ).

cnf(c_0_96,plain,
    ( entity(X1,X2)
    | ~ object(X1,X2) ),
    c_0_80,
    [final] ).

cnf(c_0_98,plain,
    ( entity(X1,X2)
    | ~ customer(X1,X2) ),
    inference(spm,[status(thm)],[c_0_81,c_0_82]),
    [final] ).

cnf(c_0_99,plain,
    ( ~ human_person(X1,X2)
    | ~ object(X1,X2) ),
    inference(spm,[status(thm)],[c_0_83,c_0_84]),
    [final] ).

cnf(c_0_100,plain,
    ( object(X1,X2)
    | ~ beverage(X1,X2) ),
    inference(spm,[status(thm)],[c_0_85,c_0_86]),
    [final] ).

cnf(c_0_101,negated_conjecture,
    beverage(skc3,skc5),
    inference(spm,[status(thm)],[c_0_87,c_0_88]),
    [final] ).

cnf(c_0_102,plain,
    ( object(X1,X2)
    | ~ restaurant(X1,X2) ),
    inference(spm,[status(thm)],[c_0_89,c_0_90]),
    [final] ).

cnf(c_0_103,negated_conjecture,
    restaurant(skc3,skc4),
    clause37,
    [final] ).

cnf(c_0_104,plain,
    ( beverage(X1,X3)
    | ~ drink(X1,X2)
    | ~ patient(X1,X2,X3)
    | ~ agent(X1,X2,X4) ),
    c_0_91,
    [final] ).

cnf(c_0_105,negated_conjecture,
    ( agent(skc3,skf3(X1),X1)
    | ~ in(skc3,X1,skc4)
    | ~ customer(skc3,X1) ),
    c_0_92,
    [final] ).

cnf(c_0_107,plain,
    ( ~ organism(X1,X2)
    | ~ nonliving(X1,X2) ),
    inference(spm,[status(thm)],[c_0_93,c_0_94]),
    [final] ).

cnf(c_0_109,plain,
    ( ~ object(X1,X2)
    | ~ eventuality(X1,X2) ),
    inference(spm,[status(thm)],[c_0_95,c_0_96]),
    [final] ).

cnf(c_0_110,plain,
    ( eventuality(X1,X2)
    | ~ event(X1,X2) ),
    c_0_97,
    [final] ).

cnf(c_0_111,plain,
    ( ~ customer(X1,X2)
    | ~ eventuality(X1,X2) ),
    inference(spm,[status(thm)],[c_0_95,c_0_98]),
    [final] ).

cnf(c_0_135,plain,
    ( ~ customer(X1,X2)
    | ~ object(X1,X2) ),
    inference(spm,[status(thm)],[c_0_99,c_0_82]),
    [final] ).

cnf(c_0_136,negated_conjecture,
    object(skc3,skc5),
    inference(spm,[status(thm)],[c_0_100,c_0_101]),
    [final] ).

cnf(c_0_137,negated_conjecture,
    object(skc3,skc4),
    inference(spm,[status(thm)],[c_0_102,c_0_103]),
    [final] ).

cnf(c_0_138,negated_conjecture,
    ( beverage(skc3,X1)
    | ~ in(skc3,X2,skc4)
    | ~ patient(skc3,skf3(X2),X1)
    | ~ customer(skc3,X2)
    | ~ drink(skc3,skf3(X2)) ),
    inference(spm,[status(thm)],[c_0_104,c_0_105]),
    [final] ).

cnf(c_0_139,plain,
    ( ~ nonreflexive(X1,X2)
    | ~ patient(X1,X2,X3)
    | ~ agent(X1,X2,X3) ),
    c_0_106,
    [final] ).

cnf(c_0_140,plain,
    ( ~ organism(X1,X2)
    | ~ object(X1,X2) ),
    inference(spm,[status(thm)],[c_0_107,c_0_84]),
    [final] ).

cnf(c_0_141,plain,
    ( impartial(X1,X2)
    | ~ organism(X1,X2) ),
    c_0_108,
    [final] ).

cnf(c_0_142,plain,
    ( ~ object(X1,X2)
    | ~ event(X1,X2) ),
    inference(spm,[status(thm)],[c_0_109,c_0_110]),
    [final] ).

cnf(c_0_143,plain,
    ( ~ customer(X1,X2)
    | ~ event(X1,X2) ),
    inference(spm,[status(thm)],[c_0_111,c_0_110]),
    [final] ).

cnf(c_0_144,plain,
    ( impartial(X1,X2)
    | ~ object(X1,X2) ),
    c_0_112,
    [final] ).

cnf(c_0_145,plain,
    ( unisex(X1,X2)
    | ~ object(X1,X2) ),
    c_0_113,
    [final] ).

cnf(c_0_146,plain,
    ( unisex(X1,X2)
    | ~ eventuality(X1,X2) ),
    c_0_114,
    [final] ).

cnf(c_0_147,negated_conjecture,
    ( agent(skc3,skf4(X2),skf5(X2))
    | ~ in(skc3,X1,skc4)
    | ~ customer(skc3,X1) ),
    c_0_115,
    [final] ).

cnf(c_0_148,negated_conjecture,
    ( patient(skc3,skf3(X2),skf5(X2))
    | ~ in(skc3,X1,skc4)
    | ~ customer(skc3,X1) ),
    c_0_116,
    [final] ).

cnf(c_0_149,plain,
    ( specific(X1,X2)
    | ~ entity(X1,X2) ),
    c_0_117,
    [final] ).

cnf(c_0_150,plain,
    ( specific(X1,X2)
    | ~ eventuality(X1,X2) ),
    c_0_118,
    [final] ).

cnf(c_0_151,plain,
    ( singleton(X1,X2)
    | ~ thing(X1,X2) ),
    c_0_119,
    [final] ).

cnf(c_0_152,plain,
    ( thing(X1,X2)
    | ~ entity(X1,X2) ),
    c_0_120,
    [final] ).

cnf(c_0_153,negated_conjecture,
    ( patient(skc3,skf4(X2),skc5)
    | ~ in(skc3,X1,skc4)
    | ~ customer(skc3,X1) ),
    c_0_121,
    [final] ).

cnf(c_0_154,negated_conjecture,
    ( past(skc3,skf4(X2))
    | ~ in(skc3,X1,skc4)
    | ~ customer(skc3,X1) ),
    c_0_122,
    [final] ).

cnf(c_0_155,negated_conjecture,
    ( past(skc3,skf3(X2))
    | ~ in(skc3,X1,skc4)
    | ~ customer(skc3,X1) ),
    c_0_123,
    [final] ).

cnf(c_0_156,negated_conjecture,
    ( nonreflexive(skc3,skf4(X2))
    | ~ in(skc3,X1,skc4)
    | ~ customer(skc3,X1) ),
    c_0_124,
    [final] ).

cnf(c_0_157,plain,
    ( thing(X1,X2)
    | ~ eventuality(X1,X2) ),
    c_0_125,
    [final] ).

cnf(c_0_158,plain,
    ( human(X1,X2)
    | ~ human_person(X1,X2) ),
    c_0_126,
    [final] ).

cnf(c_0_159,negated_conjecture,
    ( nonreflexive(skc3,skf3(X2))
    | ~ in(skc3,X1,skc4)
    | ~ customer(skc3,X1) ),
    c_0_127,
    [final] ).

cnf(c_0_160,negated_conjecture,
    ( human_person(skc3,skf5(X2))
    | ~ in(skc3,X1,skc4)
    | ~ customer(skc3,X1) ),
    c_0_128,
    [final] ).

cnf(c_0_161,negated_conjecture,
    ( drink(skc3,skf4(X2))
    | ~ in(skc3,X1,skc4)
    | ~ customer(skc3,X1) ),
    c_0_129,
    [final] ).

cnf(c_0_162,plain,
    ( event(X1,X2)
    | ~ drink(X1,X2) ),
    c_0_130,
    [final] ).

cnf(c_0_163,negated_conjecture,
    ( event(skc3,skf4(X2))
    | ~ in(skc3,X1,skc4)
    | ~ customer(skc3,X1) ),
    c_0_131,
    [final] ).

cnf(c_0_164,negated_conjecture,
    ( event(skc3,skf3(X2))
    | ~ in(skc3,X1,skc4)
    | ~ customer(skc3,X1) ),
    c_0_132,
    [final] ).

cnf(c_0_165,negated_conjecture,
    ( see(skc3,skf3(X2))
    | ~ in(skc3,X1,skc4)
    | ~ customer(skc3,X1) ),
    c_0_133,
    [final] ).

cnf(c_0_166,plain,
    ( event(X1,X2)
    | ~ see(X1,X2) ),
    c_0_134,
    [final] ).

cnf(c_0_167,negated_conjecture,
    ~ customer(skc3,skc5),
    inference(spm,[status(thm)],[c_0_135,c_0_136]),
    [final] ).

cnf(c_0_168,negated_conjecture,
    ~ customer(skc3,skc4),
    inference(spm,[status(thm)],[c_0_135,c_0_137]),
    [final] ).

cnf(c_0_169,negated_conjecture,
    actual_world(skc3),
    clause35,
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : NLP109-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n023.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 19 21:52:23 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order model finding
% 0.20/0.48  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.50  # Version: 3.1.0
% 0.20/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50  # Starting sh5l with 300s (1) cores
% 0.20/0.50  # sh5l with pid 6868 completed with status 1
% 0.20/0.50  # Result found by sh5l
% 0.20/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50  # Starting sh5l with 300s (1) cores
% 0.20/0.50  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.50  # Search class: FHHNF-FFMS11-SFFFFFNN
% 0.20/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50  # SAT001_MinMin_p005000_rr_RG with pid 6876 completed with status 1
% 0.20/0.50  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50  # Starting sh5l with 300s (1) cores
% 0.20/0.50  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.50  # Search class: FHHNF-FFMS11-SFFFFFNN
% 0.20/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50  # Preprocessing time       : 0.002 s
% 0.20/0.50  # Presaturation interreduction done
% 0.20/0.50  
% 0.20/0.50  # No proof found!
% 0.20/0.50  # SZS status Satisfiable
% 0.20/0.50  # SZS output start Saturation
% See solution above
% 0.20/0.50  # Parsed axioms                        : 50
% 0.20/0.50  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.50  # Initial clauses                      : 50
% 0.20/0.50  # Removed in clause preprocessing      : 0
% 0.20/0.50  # Initial clauses in saturation        : 50
% 0.20/0.50  # Processed clauses                    : 124
% 0.20/0.50  # ...of these trivial                  : 0
% 0.20/0.50  # ...subsumed                          : 1
% 0.20/0.50  # ...remaining for further processing  : 123
% 0.20/0.50  # Other redundant clauses eliminated   : 0
% 0.20/0.50  # Clauses deleted for lack of memory   : 0
% 0.20/0.50  # Backward-subsumed                    : 0
% 0.20/0.50  # Backward-rewritten                   : 0
% 0.20/0.50  # Generated clauses                    : 24
% 0.20/0.50  # ...of the previous two non-redundant : 24
% 0.20/0.50  # ...aggressively subsumed             : 0
% 0.20/0.50  # Contextual simplify-reflections      : 0
% 0.20/0.50  # Paramodulations                      : 24
% 0.20/0.50  # Factorizations                       : 0
% 0.20/0.50  # NegExts                              : 0
% 0.20/0.50  # Equation resolutions                 : 0
% 0.20/0.50  # Disequality decompositions           : 0
% 0.20/0.50  # Total rewrite steps                  : 0
% 0.20/0.50  # ...of those cached                   : 0
% 0.20/0.50  # Propositional unsat checks           : 0
% 0.20/0.50  #    Propositional check models        : 0
% 0.20/0.50  #    Propositional check unsatisfiable : 0
% 0.20/0.50  #    Propositional clauses             : 0
% 0.20/0.50  #    Propositional clauses after purity: 0
% 0.20/0.50  #    Propositional unsat core size     : 0
% 0.20/0.50  #    Propositional preprocessing time  : 0.000
% 0.20/0.50  #    Propositional encoding time       : 0.000
% 0.20/0.50  #    Propositional solver time         : 0.000
% 0.20/0.50  #    Success case prop preproc time    : 0.000
% 0.20/0.50  #    Success case prop encoding time   : 0.000
% 0.20/0.50  #    Success case prop solver time     : 0.000
% 0.20/0.50  # Current number of processed clauses  : 73
% 0.20/0.50  #    Positive orientable unit clauses  : 6
% 0.20/0.50  #    Positive unorientable unit clauses: 0
% 0.20/0.50  #    Negative unit clauses             : 2
% 0.20/0.50  #    Non-unit-clauses                  : 65
% 0.20/0.50  # Current number of unprocessed clauses: 0
% 0.20/0.50  # ...number of literals in the above   : 0
% 0.20/0.50  # Current number of archived formulas  : 0
% 0.20/0.50  # Current number of archived clauses   : 50
% 0.20/0.50  # Clause-clause subsumption calls (NU) : 1646
% 0.20/0.50  # Rec. Clause-clause subsumption calls : 1406
% 0.20/0.50  # Non-unit clause-clause subsumptions  : 1
% 0.20/0.50  # Unit Clause-clause subsumption calls : 32
% 0.20/0.50  # Rewrite failures with RHS unbound    : 0
% 0.20/0.50  # BW rewrite match attempts            : 0
% 0.20/0.50  # BW rewrite match successes           : 0
% 0.20/0.50  # Condensation attempts                : 0
% 0.20/0.50  # Condensation successes               : 0
% 0.20/0.50  # Termbank termtop insertions          : 2141
% 0.20/0.50  # Search garbage collected termcells   : 102
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.008 s
% 0.20/0.50  # System time              : 0.002 s
% 0.20/0.50  # Total time               : 0.010 s
% 0.20/0.50  # Maximum resident set size: 1776 pages
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.010 s
% 0.20/0.50  # System time              : 0.004 s
% 0.20/0.50  # Total time               : 0.014 s
% 0.20/0.50  # Maximum resident set size: 1752 pages
% 0.20/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------