TSTP Solution File: NLP115-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NLP115-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:57:01 EDT 2024
% Result : Satisfiable 0.21s 0.50s
% Output : Saturation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause1)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_39,negated_conjecture,
actual_world(skc17),
clause1,
[final] ).
cnf(c_0_76,negated_conjecture,
ssSkC0,
inference(spm,[status(thm)],[c_0_69,c_0_70]),
[final] ).
cnf(c_0_93,negated_conjecture,
( ~ of(X1,X2,X3)
| ~ agent(X1,X4,X3)
| ~ in(X1,X4,X3)
| ~ down(X1,X4,X5)
| ~ placename(X1,X2)
| ~ hollywood_placename(X1,X2)
| ~ city(X1,X3)
| ~ chevy(X1,X3)
| ~ white(X1,X3)
| ~ dirty(X1,X3)
| ~ old(X1,X3)
| ~ street(X1,X5)
| ~ lonely(X1,X5)
| ~ barrel(X1,X4)
| ~ present(X1,X4)
| ~ event(X1,X4)
| ~ actual_world(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76])]),
[final] ).
cnf(c_0_94,negated_conjecture,
of(skc11,skc14,skc15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_76])]),
[final] ).
cnf(c_0_95,negated_conjecture,
placename(skc11,skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_76])]),
[final] ).
cnf(c_0_96,negated_conjecture,
hollywood_placename(skc11,skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_76])]),
[final] ).
cnf(c_0_97,negated_conjecture,
city(skc11,skc15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_76])]),
[final] ).
cnf(c_0_98,negated_conjecture,
actual_world(skc11),
clause2,
[final] ).
cnf(c_0_111,negated_conjecture,
( ~ agent(skc11,X1,skc15)
| ~ in(skc11,X1,skc15)
| ~ down(skc11,X1,X2)
| ~ chevy(skc11,skc15)
| ~ white(skc11,skc15)
| ~ dirty(skc11,skc15)
| ~ old(skc11,skc15)
| ~ street(skc11,X2)
| ~ lonely(skc11,X2)
| ~ barrel(skc11,X1)
| ~ present(skc11,X1)
| ~ event(skc11,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95]),c_0_96]),c_0_97]),c_0_98])]),
[final] ).
cnf(c_0_112,negated_conjecture,
down(skc11,skc12,skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_76])]),
[final] ).
cnf(c_0_113,negated_conjecture,
in(skc11,skc12,skc15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_76])]),
[final] ).
cnf(c_0_114,negated_conjecture,
agent(skc11,skc12,skc13),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_76])]),
[final] ).
cnf(c_0_115,negated_conjecture,
event(skc11,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_76])]),
[final] ).
cnf(c_0_116,negated_conjecture,
present(skc11,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_76])]),
[final] ).
cnf(c_0_117,negated_conjecture,
barrel(skc11,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_76])]),
[final] ).
cnf(c_0_118,negated_conjecture,
lonely(skc11,skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_76])]),
[final] ).
cnf(c_0_119,negated_conjecture,
street(skc11,skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_76])]),
[final] ).
cnf(c_0_120,negated_conjecture,
old(skc11,skc13),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_76])]),
[final] ).
cnf(c_0_121,negated_conjecture,
dirty(skc11,skc13),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_108,c_0_76])]),
[final] ).
cnf(c_0_122,negated_conjecture,
white(skc11,skc13),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_76])]),
[final] ).
cnf(c_0_123,negated_conjecture,
chevy(skc11,skc13),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_110,c_0_76])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : NLP115-1 : TPTP v8.2.0. Released v2.4.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n018.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 21:57:38 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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/benchmark/theBenchmark.p
% 0.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # new_bool_3 with pid 3699 completed with status 1
% 0.21/0.50 # Result found by new_bool_3
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGHNF-FFMM00-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting H----_011_C07_F1_PI_AE_OS_S1U with 163s (1) cores
% 0.21/0.50 # H----_011_C07_F1_PI_AE_OS_S1U with pid 3704 completed with status 1
% 0.21/0.50 # Result found by H----_011_C07_F1_PI_AE_OS_S1U
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGHNF-FFMM00-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting H----_011_C07_F1_PI_AE_OS_S1U with 163s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50
% 0.21/0.50 # No proof found!
% 0.21/0.50 # SZS status Satisfiable
% 0.21/0.50 # SZS output start Saturation
% See solution above
% 0.21/0.50 # Parsed axioms : 36
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 36
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 36
% 0.21/0.50 # Processed clauses : 70
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 70
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 12
% 0.21/0.50 # Backward-rewritten : 37
% 0.21/0.50 # Generated clauses : 18
% 0.21/0.50 # ...of the previous two non-redundant : 35
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 18
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 43
% 0.21/0.50 # ...of those cached : 37
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 21
% 0.21/0.50 # Positive orientable unit clauses : 19
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 0
% 0.21/0.50 # Non-unit-clauses : 2
% 0.21/0.50 # Current number of unprocessed clauses: 0
% 0.21/0.50 # ...number of literals in the above : 0
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 49
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 110
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 75
% 0.21/0.50 # Non-unit clause-clause subsumptions : 12
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 1
% 0.21/0.50 # BW rewrite match successes : 1
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 2245
% 0.21/0.50 # Search garbage collected termcells : 105
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.006 s
% 0.21/0.50 # System time : 0.002 s
% 0.21/0.50 # Total time : 0.009 s
% 0.21/0.50 # Maximum resident set size: 1796 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.008 s
% 0.21/0.50 # System time : 0.005 s
% 0.21/0.50 # Total time : 0.013 s
% 0.21/0.50 # Maximum resident set size: 1752 pages
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------