TSTP Solution File: NLP103-1 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n014.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 18:44:28 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_40,negated_conjecture,
    actual_world(skc20),
    clause1,
    [final] ).

cnf(c_0_70,negated_conjecture,
    actual_world(skc8),
    clause2,
    [final] ).

cnf(c_0_77,negated_conjecture,
    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(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_64]),c_0_65]),c_0_66]),c_0_42]),c_0_67]),
    [final] ).

cnf(c_0_91,negated_conjecture,
    ( in(X1,skf12(X1,X2,X3),X2)
    | ~ agent(X1,X4,X5)
    | ~ patient(X1,X4,X6)
    | ~ restaurant(X1,X2)
    | ~ human_person(X1,X5)
    | ~ coffee(X1,X6)
    | ~ drink(X1,X4)
    | ~ nonreflexive(X1,X4)
    | ~ past(X1,X4)
    | ~ event(X1,X4)
    | ~ actual_world(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_77])]),
    [final] ).

cnf(c_0_92,negated_conjecture,
    ( customer(X1,skf12(X1,X2,X3))
    | ~ agent(X1,X4,X5)
    | ~ patient(X1,X4,X6)
    | ~ restaurant(X1,X7)
    | ~ human_person(X1,X5)
    | ~ coffee(X1,X6)
    | ~ drink(X1,X4)
    | ~ nonreflexive(X1,X4)
    | ~ past(X1,X4)
    | ~ event(X1,X4)
    | ~ actual_world(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_77])]),
    [final] ).

cnf(c_0_93,negated_conjecture,
    ( customer(skc8,skf12(skc8,X1,X2))
    | ~ customer(skc8,X3)
    | ~ in(skc8,X3,skc10)
    | ~ patient(skc8,skf8(X3),X4)
    | ~ restaurant(skc8,X5)
    | ~ human_person(skc8,X3)
    | ~ coffee(skc8,X4)
    | ~ drink(skc8,skf8(X3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_77])]),
    [final] ).

cnf(c_0_94,negated_conjecture,
    ( agent(skc8,skf8(X1),X1)
    | ~ customer(skc8,X1)
    | ~ in(skc8,X1,skc10) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_77])]),
    [final] ).

cnf(c_0_95,negated_conjecture,
    ( patient(skc8,skf8(X1),skf10(X1))
    | ~ customer(skc8,X2)
    | ~ in(skc8,X2,skc10) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_77])]),
    [final] ).

cnf(c_0_96,negated_conjecture,
    ( agent(skc8,skf9(X1),skf10(X1))
    | ~ customer(skc8,X2)
    | ~ in(skc8,X2,skc10) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_77])]),
    [final] ).

cnf(c_0_97,negated_conjecture,
    ( patient(skc8,skf9(X1),skc9)
    | ~ customer(skc8,X2)
    | ~ in(skc8,X2,skc10) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_77])]),
    [final] ).

cnf(c_0_98,negated_conjecture,
    ( event(skc8,skf9(X1))
    | ~ customer(skc8,X2)
    | ~ in(skc8,X2,skc10) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_77])]),
    [final] ).

cnf(c_0_99,negated_conjecture,
    ( in(skc8,skf12(skc8,X1,X2),X1)
    | ~ customer(skc8,X3)
    | ~ in(skc8,X3,skc10)
    | ~ patient(skc8,skf8(X3),X4)
    | ~ restaurant(skc8,X1)
    | ~ human_person(skc8,X3)
    | ~ coffee(skc8,X4)
    | ~ drink(skc8,skf8(X3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_77])]),
    [final] ).

cnf(c_0_100,negated_conjecture,
    ( event(skc8,skf8(X1))
    | ~ customer(skc8,X2)
    | ~ in(skc8,X2,skc10) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_77])]),
    [final] ).

cnf(c_0_101,negated_conjecture,
    ( past(skc8,skf9(X1))
    | ~ customer(skc8,X2)
    | ~ in(skc8,X2,skc10) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_77])]),
    [final] ).

cnf(c_0_102,negated_conjecture,
    ( past(skc8,skf8(X1))
    | ~ customer(skc8,X2)
    | ~ in(skc8,X2,skc10) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_77])]),
    [final] ).

cnf(c_0_103,negated_conjecture,
    ( nonreflexive(skc8,skf9(X1))
    | ~ customer(skc8,X2)
    | ~ in(skc8,X2,skc10) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_77])]),
    [final] ).

cnf(c_0_104,negated_conjecture,
    ( nonreflexive(skc8,skf8(X1))
    | ~ customer(skc8,X2)
    | ~ in(skc8,X2,skc10) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_77])]),
    [final] ).

cnf(c_0_105,negated_conjecture,
    ( drink(skc8,skf9(X1))
    | ~ customer(skc8,X2)
    | ~ in(skc8,X2,skc10) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_77])]),
    [final] ).

cnf(c_0_106,negated_conjecture,
    ( human_person(skc8,skf10(X1))
    | ~ customer(skc8,X2)
    | ~ in(skc8,X2,skc10) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_77])]),
    [final] ).

cnf(c_0_107,negated_conjecture,
    ( see(skc8,skf8(X1))
    | ~ customer(skc8,X2)
    | ~ in(skc8,X2,skc10) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77])]),
    [final] ).

cnf(c_0_108,negated_conjecture,
    ( ~ see(X1,X2)
    | ~ agent(X1,X2,skf12(X1,X3,X4))
    | ~ agent(X1,X5,X4)
    | ~ patient(X1,X2,X4)
    | ~ patient(X1,X5,X6)
    | ~ restaurant(X1,X3)
    | ~ human_person(X1,X4)
    | ~ coffee(X1,X6)
    | ~ drink(X1,X5)
    | ~ nonreflexive(X1,X2)
    | ~ nonreflexive(X1,X5)
    | ~ past(X1,X2)
    | ~ past(X1,X5)
    | ~ event(X1,X2)
    | ~ event(X1,X5)
    | ~ actual_world(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_77])]),
    [final] ).

cnf(c_0_109,negated_conjecture,
    ( ~ customer(skc8,skf12(skc8,X1,X2))
    | ~ in(skc8,skf12(skc8,X1,X2),skc10)
    | ~ agent(skc8,X3,X2)
    | ~ patient(skc8,skf8(skf12(skc8,X1,X2)),X2)
    | ~ patient(skc8,X3,X4)
    | ~ restaurant(skc8,X1)
    | ~ human_person(skc8,X2)
    | ~ coffee(skc8,X4)
    | ~ drink(skc8,X3)
    | ~ nonreflexive(skc8,X3)
    | ~ past(skc8,X3)
    | ~ event(skc8,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_77])]),
    [final] ).

cnf(c_0_110,negated_conjecture,
    coffee(skc8,skc9),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_77])]),
    [final] ).

cnf(c_0_111,negated_conjecture,
    restaurant(skc8,skc10),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_77])]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : NLP103-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n014.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 2400
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon Oct  2 11:06:34 EDT 2023
% 0.13/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/tmp/tmp.tFG7v0RYqW/E---3.1_3562.p
% 0.20/0.51  # Version: 3.1pre001
% 0.20/0.51  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51  # Starting sh5l with 300s (1) cores
% 0.20/0.51  # new_bool_3 with pid 3640 completed with status 1
% 0.20/0.51  # Result found by new_bool_3
% 0.20/0.51  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51  # Search class: FGHNF-FFMM31-SFFFFFNN
% 0.20/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51  # SAT001_MinMin_p005000_rr_RG with pid 3645 completed with status 1
% 0.20/0.51  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51  # Search class: FGHNF-FFMM31-SFFFFFNN
% 0.20/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51  # Preprocessing time       : 0.002 s
% 0.20/0.51  # Presaturation interreduction done
% 0.20/0.51  
% 0.20/0.51  # No proof found!
% 0.20/0.51  # SZS status Satisfiable
% 0.20/0.51  # SZS output start Saturation
% See solution above
% 0.20/0.51  # Parsed axioms                        : 38
% 0.20/0.51  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.51  # Initial clauses                      : 38
% 0.20/0.51  # Removed in clause preprocessing      : 0
% 0.20/0.51  # Initial clauses in saturation        : 38
% 0.20/0.51  # Processed clauses                    : 116
% 0.20/0.51  # ...of these trivial                  : 1
% 0.20/0.51  # ...subsumed                          : 3
% 0.20/0.51  # ...remaining for further processing  : 112
% 0.20/0.51  # Other redundant clauses eliminated   : 0
% 0.20/0.51  # Clauses deleted for lack of memory   : 0
% 0.20/0.51  # Backward-subsumed                    : 7
% 0.20/0.51  # Backward-rewritten                   : 43
% 0.20/0.51  # Generated clauses                    : 27
% 0.20/0.51  # ...of the previous two non-redundant : 42
% 0.20/0.51  # ...aggressively subsumed             : 0
% 0.20/0.51  # Contextual simplify-reflections      : 33
% 0.20/0.51  # Paramodulations                      : 27
% 0.20/0.51  # Factorizations                       : 0
% 0.20/0.51  # NegExts                              : 0
% 0.20/0.51  # Equation resolutions                 : 0
% 0.20/0.51  # Total rewrite steps                  : 60
% 0.20/0.51  # Propositional unsat checks           : 0
% 0.20/0.51  #    Propositional check models        : 0
% 0.20/0.51  #    Propositional check unsatisfiable : 0
% 0.20/0.51  #    Propositional clauses             : 0
% 0.20/0.51  #    Propositional clauses after purity: 0
% 0.20/0.51  #    Propositional unsat core size     : 0
% 0.20/0.51  #    Propositional preprocessing time  : 0.000
% 0.20/0.51  #    Propositional encoding time       : 0.000
% 0.20/0.51  #    Propositional solver time         : 0.000
% 0.20/0.51  #    Success case prop preproc time    : 0.000
% 0.20/0.51  #    Success case prop encoding time   : 0.000
% 0.20/0.51  #    Success case prop solver time     : 0.000
% 0.20/0.51  # Current number of processed clauses  : 24
% 0.20/0.51  #    Positive orientable unit clauses  : 5
% 0.20/0.51  #    Positive unorientable unit clauses: 0
% 0.20/0.51  #    Negative unit clauses             : 0
% 0.20/0.51  #    Non-unit-clauses                  : 19
% 0.20/0.51  # Current number of unprocessed clauses: 0
% 0.20/0.51  # ...number of literals in the above   : 0
% 0.20/0.51  # Current number of archived formulas  : 0
% 0.20/0.51  # Current number of archived clauses   : 88
% 0.20/0.51  # Clause-clause subsumption calls (NU) : 1992
% 0.20/0.51  # Rec. Clause-clause subsumption calls : 626
% 0.20/0.51  # Non-unit clause-clause subsumptions  : 43
% 0.20/0.51  # Unit Clause-clause subsumption calls : 0
% 0.20/0.51  # Rewrite failures with RHS unbound    : 0
% 0.20/0.51  # BW rewrite match attempts            : 1
% 0.20/0.51  # BW rewrite match successes           : 1
% 0.20/0.51  # Condensation attempts                : 0
% 0.20/0.51  # Condensation successes               : 0
% 0.20/0.51  # Termbank termtop insertions          : 4034
% 0.20/0.51  
% 0.20/0.51  # -------------------------------------------------
% 0.20/0.51  # User time                : 0.011 s
% 0.20/0.51  # System time              : 0.003 s
% 0.20/0.51  # Total time               : 0.015 s
% 0.20/0.51  # Maximum resident set size: 1800 pages
% 0.20/0.51  
% 0.20/0.51  # -------------------------------------------------
% 0.20/0.51  # User time                : 0.014 s
% 0.20/0.51  # System time              : 0.005 s
% 0.20/0.51  # Total time               : 0.019 s
% 0.20/0.51  # Maximum resident set size: 1720 pages
% 0.20/0.51  % E---3.1 exiting
%------------------------------------------------------------------------------