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

View Problem - Process Solution

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

% Computer : n017.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:45:15 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_51,negated_conjecture,
    actual_world(skc29),
    clause1,
    [final] ).

cnf(c_0_88,negated_conjecture,
    actual_world(skc17),
    clause2,
    [final] ).

cnf(c_0_94,negated_conjecture,
    ssSkC0,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_65]),c_0_66]),c_0_67]),
    [final] ).

cnf(c_0_114,negated_conjecture,
    ( ~ smoke(X1,X2)
    | ~ be(X3,X4,X5,X6)
    | ~ agent(X1,X2,skf7(X1))
    | ~ agent(X3,X7,X5)
    | ~ of(X3,X8,X5)
    | ~ of(X3,X9,X5)
    | ~ theme(X3,X7,X1)
    | ~ jules_forename(X3,X8)
    | ~ vincent_forename(X3,X9)
    | ~ forename(X3,X8)
    | ~ forename(X3,X9)
    | ~ think_believe_consider(X3,X7)
    | ~ present(X1,X2)
    | ~ present(X3,X7)
    | ~ event(X1,X2)
    | ~ event(X3,X7)
    | ~ proposition(X3,X1)
    | ~ accessible_world(X3,X1)
    | ~ man(X3,X5)
    | ~ man(X3,X6)
    | ~ state(X3,X4)
    | ~ actual_world(X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_94])]),
    [final] ).

cnf(c_0_115,negated_conjecture,
    ( man(X1,skf7(X1))
    | ~ be(X2,X3,X4,X5)
    | ~ agent(X2,X6,X4)
    | ~ of(X2,X7,X4)
    | ~ of(X2,X8,X4)
    | ~ theme(X2,X6,X1)
    | ~ jules_forename(X2,X7)
    | ~ vincent_forename(X2,X8)
    | ~ forename(X2,X7)
    | ~ forename(X2,X8)
    | ~ think_believe_consider(X2,X6)
    | ~ present(X2,X6)
    | ~ event(X2,X6)
    | ~ proposition(X2,X1)
    | ~ accessible_world(X2,X1)
    | ~ man(X2,X4)
    | ~ man(X2,X5)
    | ~ state(X2,X3)
    | ~ actual_world(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_94])]),
    [final] ).

cnf(c_0_116,negated_conjecture,
    ( agent(skc22,skf5(X1),X1)
    | ~ man(skc22,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_94])]),
    [final] ).

cnf(c_0_117,negated_conjecture,
    ( event(skc22,skf5(X1))
    | ~ man(skc22,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_94])]),
    [final] ).

cnf(c_0_118,negated_conjecture,
    ( present(skc22,skf5(X1))
    | ~ man(skc22,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_94])]),
    [final] ).

cnf(c_0_119,negated_conjecture,
    ( smoke(skc22,skf5(X1))
    | ~ man(skc22,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_94])]),
    [final] ).

cnf(c_0_120,negated_conjecture,
    ( man(X1,skf7(X1))
    | ~ agent(skc17,X2,skc21)
    | ~ of(skc17,X3,skc21)
    | ~ of(skc17,X4,skc21)
    | ~ theme(skc17,X2,X1)
    | ~ jules_forename(skc17,X3)
    | ~ vincent_forename(skc17,X4)
    | ~ forename(skc17,X3)
    | ~ forename(skc17,X4)
    | ~ think_believe_consider(skc17,X2)
    | ~ present(skc17,X2)
    | ~ event(skc17,X2)
    | ~ proposition(skc17,X1)
    | ~ accessible_world(skc17,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_94])]),
    [final] ).

cnf(c_0_121,negated_conjecture,
    ( ~ smoke(skc22,skf5(skf7(skc22)))
    | ~ be(X1,X2,X3,X4)
    | ~ agent(X1,X5,X3)
    | ~ of(X1,X6,X3)
    | ~ of(X1,X7,X3)
    | ~ theme(X1,X5,skc22)
    | ~ jules_forename(X1,X6)
    | ~ vincent_forename(X1,X7)
    | ~ forename(X1,X6)
    | ~ forename(X1,X7)
    | ~ think_believe_consider(X1,X5)
    | ~ present(skc22,skf5(skf7(skc22)))
    | ~ present(X1,X5)
    | ~ event(skc22,skf5(skf7(skc22)))
    | ~ event(X1,X5)
    | ~ proposition(X1,skc22)
    | ~ accessible_world(X1,skc22)
    | ~ man(X1,X3)
    | ~ man(X1,X4)
    | ~ state(X1,X2)
    | ~ actual_world(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_94])]),
    [final] ).

cnf(c_0_122,negated_conjecture,
    be(skc17,skc18,skc21,skc19),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_94])]),
    [final] ).

cnf(c_0_123,negated_conjecture,
    theme(skc17,skc23,skc22),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_94])]),
    [final] ).

cnf(c_0_124,negated_conjecture,
    of(skc17,skc24,skc25),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_94])]),
    [final] ).

cnf(c_0_125,negated_conjecture,
    of(skc17,skc20,skc21),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_94])]),
    [final] ).

cnf(c_0_126,negated_conjecture,
    agent(skc17,skc23,skc25),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_94])]),
    [final] ).

cnf(c_0_127,negated_conjecture,
    state(skc17,skc18),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_94])]),
    [final] ).

cnf(c_0_128,negated_conjecture,
    man(skc17,skc25),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_94])]),
    [final] ).

cnf(c_0_129,negated_conjecture,
    man(skc17,skc19),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_94])]),
    [final] ).

cnf(c_0_130,negated_conjecture,
    man(skc17,skc21),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_94])]),
    [final] ).

cnf(c_0_131,negated_conjecture,
    accessible_world(skc17,skc22),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_94])]),
    [final] ).

cnf(c_0_132,negated_conjecture,
    proposition(skc17,skc22),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_94])]),
    [final] ).

cnf(c_0_133,negated_conjecture,
    event(skc17,skc23),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_94])]),
    [final] ).

cnf(c_0_134,negated_conjecture,
    present(skc17,skc23),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_108,c_0_94])]),
    [final] ).

cnf(c_0_135,negated_conjecture,
    think_believe_consider(skc17,skc23),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_94])]),
    [final] ).

cnf(c_0_136,negated_conjecture,
    forename(skc17,skc24),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_110,c_0_94])]),
    [final] ).

cnf(c_0_137,negated_conjecture,
    forename(skc17,skc20),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_111,c_0_94])]),
    [final] ).

cnf(c_0_138,negated_conjecture,
    vincent_forename(skc17,skc24),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_112,c_0_94])]),
    [final] ).

cnf(c_0_139,negated_conjecture,
    jules_forename(skc17,skc20),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_113,c_0_94])]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem    : NLP221-1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.11  % Command    : run_E %s %d THM
% 0.10/0.32  % Computer : n017.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit   : 2400
% 0.10/0.32  % WCLimit    : 300
% 0.10/0.32  % DateTime   : Mon Oct  2 10:39:56 EDT 2023
% 0.10/0.32  % CPUTime    : 
% 0.16/0.44  Running first-order model finding
% 0.16/0.44  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.tRbOQzId05/E---3.1_22472.p
% 0.16/0.46  # Version: 3.1pre001
% 0.16/0.46  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46  # Starting sh5l with 300s (1) cores
% 0.16/0.46  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 22549 completed with status 1
% 0.16/0.46  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.46  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.46  # No SInE strategy applied
% 0.16/0.46  # Search class: FGHNF-FFMM11-SFFFFFNN
% 0.16/0.46  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.46  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.46  # Starting new_bool_3 with 136s (1) cores
% 0.16/0.46  # Starting new_bool_1 with 136s (1) cores
% 0.16/0.46  # Starting sh5l with 136s (1) cores
% 0.16/0.46  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 22556 completed with status 1
% 0.16/0.46  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.46  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.46  # No SInE strategy applied
% 0.16/0.46  # Search class: FGHNF-FFMM11-SFFFFFNN
% 0.16/0.46  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.46  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.46  # Preprocessing time       : 0.001 s
% 0.16/0.46  # Presaturation interreduction done
% 0.16/0.46  
% 0.16/0.46  # No proof found!
% 0.16/0.46  # SZS status Satisfiable
% 0.16/0.46  # SZS output start Saturation
% See solution above
% 0.16/0.46  # Parsed axioms                        : 49
% 0.16/0.46  # Removed by relevancy pruning/SinE    : 0
% 0.16/0.46  # Initial clauses                      : 49
% 0.16/0.46  # Removed in clause preprocessing      : 0
% 0.16/0.46  # Initial clauses in saturation        : 49
% 0.16/0.46  # Processed clauses                    : 147
% 0.16/0.46  # ...of these trivial                  : 3
% 0.16/0.46  # ...subsumed                          : 2
% 0.16/0.46  # ...remaining for further processing  : 142
% 0.16/0.46  # Other redundant clauses eliminated   : 0
% 0.16/0.46  # Clauses deleted for lack of memory   : 0
% 0.16/0.46  # Backward-subsumed                    : 7
% 0.16/0.46  # Backward-rewritten                   : 57
% 0.16/0.46  # Generated clauses                    : 27
% 0.16/0.46  # ...of the previous two non-redundant : 51
% 0.16/0.46  # ...aggressively subsumed             : 0
% 0.16/0.46  # Contextual simplify-reflections      : 36
% 0.16/0.46  # Paramodulations                      : 27
% 0.16/0.46  # Factorizations                       : 0
% 0.16/0.46  # NegExts                              : 0
% 0.16/0.46  # Equation resolutions                 : 0
% 0.16/0.46  # Total rewrite steps                  : 67
% 0.16/0.46  # Propositional unsat checks           : 0
% 0.16/0.46  #    Propositional check models        : 0
% 0.16/0.46  #    Propositional check unsatisfiable : 0
% 0.16/0.46  #    Propositional clauses             : 0
% 0.16/0.46  #    Propositional clauses after purity: 0
% 0.16/0.46  #    Propositional unsat core size     : 0
% 0.16/0.46  #    Propositional preprocessing time  : 0.000
% 0.16/0.46  #    Propositional encoding time       : 0.000
% 0.16/0.46  #    Propositional solver time         : 0.000
% 0.16/0.46  #    Success case prop preproc time    : 0.000
% 0.16/0.46  #    Success case prop encoding time   : 0.000
% 0.16/0.46  #    Success case prop solver time     : 0.000
% 0.16/0.46  # Current number of processed clauses  : 29
% 0.16/0.46  #    Positive orientable unit clauses  : 21
% 0.16/0.46  #    Positive unorientable unit clauses: 0
% 0.16/0.46  #    Negative unit clauses             : 0
% 0.16/0.46  #    Non-unit-clauses                  : 8
% 0.16/0.46  # Current number of unprocessed clauses: 0
% 0.16/0.46  # ...number of literals in the above   : 0
% 0.16/0.46  # Current number of archived formulas  : 0
% 0.16/0.46  # Current number of archived clauses   : 113
% 0.16/0.46  # Clause-clause subsumption calls (NU) : 1655
% 0.16/0.46  # Rec. Clause-clause subsumption calls : 452
% 0.16/0.46  # Non-unit clause-clause subsumptions  : 45
% 0.16/0.46  # Unit Clause-clause subsumption calls : 0
% 0.16/0.46  # Rewrite failures with RHS unbound    : 0
% 0.16/0.46  # BW rewrite match attempts            : 1
% 0.16/0.46  # BW rewrite match successes           : 1
% 0.16/0.46  # Condensation attempts                : 0
% 0.16/0.46  # Condensation successes               : 0
% 0.16/0.46  # Termbank termtop insertions          : 3959
% 0.16/0.46  
% 0.16/0.46  # -------------------------------------------------
% 0.16/0.46  # User time                : 0.008 s
% 0.16/0.46  # System time              : 0.003 s
% 0.16/0.46  # Total time               : 0.012 s
% 0.16/0.46  # Maximum resident set size: 1720 pages
% 0.16/0.46  
% 0.16/0.46  # -------------------------------------------------
% 0.16/0.46  # User time                : 0.044 s
% 0.16/0.46  # System time              : 0.010 s
% 0.16/0.46  # Total time               : 0.054 s
% 0.16/0.46  # Maximum resident set size: 1736 pages
% 0.16/0.46  % E---3.1 exiting
%------------------------------------------------------------------------------