TSTP Solution File: NLP138-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NLP138-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:12 EDT 2024
% Result : Satisfiable 0.19s 0.50s
% Output : Saturation 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause2)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_63,negated_conjecture,
actual_world(skc13),
clause2,
[final] ).
cnf(c_0_112,negated_conjecture,
( ssSkC0
| ~ city(X1,X2)
| ~ chevy(X1,X2)
| ~ white(X1,X2)
| ~ dirty(X1,X2)
| ~ old(X1,X2)
| ~ agent(X1,X3,X2)
| ~ in(X1,X3,X2)
| ~ placename(X1,X4)
| ~ hollywood_placename(X1,X4)
| ~ of(X1,X4,X2)
| ~ event(X1,X3)
| ~ present(X1,X3)
| ~ barrel(X1,X3)
| ~ down(X1,X3,X5)
| ~ lonely(X1,X5)
| ~ street(X1,X5)
| ~ young(X1,skf13(X1,X6))
| ~ fellow(X1,skf13(X1,X6))
| ~ group(X1,X7)
| ~ two(X1,X7)
| ~ ssSkP0(X7,X1)
| ~ actual_world(X1) ),
c_0_108,
[final] ).
cnf(c_0_113,negated_conjecture,
( ssSkC0
| young(skc33,X1)
| ~ member(skc33,X1,skc34) ),
c_0_109,
[final] ).
cnf(c_0_114,negated_conjecture,
actual_world(skc33),
clause1,
[final] ).
cnf(c_0_115,negated_conjecture,
~ ssSkC0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_104]),c_0_102]),c_0_103]),
[final] ).
cnf(c_0_117,negated_conjecture,
( ssSkC0
| member(X1,skf13(X1,X6),X6)
| ~ city(X1,X2)
| ~ chevy(X1,X2)
| ~ white(X1,X2)
| ~ dirty(X1,X2)
| ~ old(X1,X2)
| ~ agent(X1,X3,X2)
| ~ in(X1,X3,X2)
| ~ placename(X1,X4)
| ~ hollywood_placename(X1,X4)
| ~ of(X1,X4,X2)
| ~ event(X1,X3)
| ~ present(X1,X3)
| ~ barrel(X1,X3)
| ~ down(X1,X3,X5)
| ~ lonely(X1,X5)
| ~ street(X1,X5)
| ~ group(X1,X6)
| ~ two(X1,X6)
| ~ ssSkP0(X6,X1)
| ~ actual_world(X1) ),
c_0_111,
[final] ).
cnf(c_0_130,negated_conjecture,
( ssSkC0
| fellow(skc33,X1)
| ~ member(skc33,X1,skc34) ),
c_0_116,
[final] ).
cnf(c_0_132,negated_conjecture,
of(skc33,skc37,skc38),
inference(sr,[status(thm)],[c_0_124,c_0_115]),
[final] ).
cnf(c_0_133,negated_conjecture,
in(skc33,skc35,skc38),
inference(sr,[status(thm)],[c_0_125,c_0_115]),
[final] ).
cnf(c_0_134,negated_conjecture,
city(skc33,skc38),
inference(sr,[status(thm)],[c_0_126,c_0_115]),
[final] ).
cnf(c_0_135,negated_conjecture,
placename(skc33,skc37),
inference(sr,[status(thm)],[c_0_127,c_0_115]),
[final] ).
cnf(c_0_136,negated_conjecture,
hollywood_placename(skc33,skc37),
inference(sr,[status(thm)],[c_0_128,c_0_115]),
[final] ).
cnf(c_0_140,negated_conjecture,
( ~ member(skc33,skf13(skc33,X1),skc34)
| ~ down(skc33,X2,X3)
| ~ of(skc33,X4,X5)
| ~ in(skc33,X2,X5)
| ~ agent(skc33,X2,X5)
| ~ group(skc33,X6)
| ~ two(skc33,X6)
| ~ ssSkP0(X6,skc33)
| ~ lonely(skc33,X3)
| ~ street(skc33,X3)
| ~ city(skc33,X5)
| ~ placename(skc33,X4)
| ~ hollywood_placename(skc33,X4)
| ~ event(skc33,X2)
| ~ present(skc33,X2)
| ~ barrel(skc33,X2)
| ~ chevy(skc33,X5)
| ~ white(skc33,X5)
| ~ dirty(skc33,X5)
| ~ old(skc33,X5) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_115]),
[final] ).
cnf(c_0_142,negated_conjecture,
group(skc33,skc34),
inference(sr,[status(thm)],[c_0_137,c_0_115]),
[final] ).
cnf(c_0_143,negated_conjecture,
two(skc33,skc34),
inference(sr,[status(thm)],[c_0_138,c_0_115]),
[final] ).
cnf(c_0_144,negated_conjecture,
ssSkP0(skc34,skc33),
inference(sr,[status(thm)],[c_0_139,c_0_115]),
[final] ).
cnf(c_0_146,negated_conjecture,
down(skc33,skc35,skc36),
inference(sr,[status(thm)],[c_0_118,c_0_115]),
[final] ).
cnf(c_0_147,negated_conjecture,
lonely(skc33,skc36),
inference(sr,[status(thm)],[c_0_123,c_0_115]),
[final] ).
cnf(c_0_148,negated_conjecture,
street(skc33,skc36),
inference(sr,[status(thm)],[c_0_122,c_0_115]),
[final] ).
cnf(c_0_149,negated_conjecture,
event(skc33,skc35),
inference(sr,[status(thm)],[c_0_121,c_0_115]),
[final] ).
cnf(c_0_150,negated_conjecture,
present(skc33,skc35),
inference(sr,[status(thm)],[c_0_120,c_0_115]),
[final] ).
cnf(c_0_151,negated_conjecture,
barrel(skc33,skc35),
inference(sr,[status(thm)],[c_0_119,c_0_115]),
[final] ).
cnf(c_0_162,negated_conjecture,
( ~ agent(skc33,skc35,skc38)
| ~ group(skc33,X1)
| ~ two(skc33,X1)
| ~ ssSkP0(X1,skc33)
| ~ chevy(skc33,skc38)
| ~ white(skc33,skc38)
| ~ dirty(skc33,skc38)
| ~ old(skc33,skc38) ),
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_152,c_0_132]),c_0_133]),c_0_134]),c_0_135]),c_0_136])]),
[final] ).
cnf(c_0_163,negated_conjecture,
( member(skc33,skf13(skc33,X1),X1)
| ~ of(skc33,X2,X3)
| ~ in(skc33,skc35,X3)
| ~ agent(skc33,skc35,X3)
| ~ group(skc33,X1)
| ~ two(skc33,X1)
| ~ ssSkP0(X1,skc33)
| ~ city(skc33,X3)
| ~ placename(skc33,X2)
| ~ hollywood_placename(skc33,X2)
| ~ chevy(skc33,X3)
| ~ white(skc33,X3)
| ~ dirty(skc33,X3)
| ~ old(skc33,X3) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_146]),c_0_147]),c_0_148]),c_0_149]),c_0_150]),c_0_151]),c_0_114])]),c_0_115]),
[final] ).
cnf(c_0_164,negated_conjecture,
( be(X1,skf8(X1,X2),X2,skf7(X2,X1))
| ~ member(X1,X2,X3)
| ~ frontseat(X1,X2)
| ~ ssSkP0(X3,X1) ),
c_0_153,
[final] ).
cnf(c_0_165,negated_conjecture,
( ssSkP0(X5,X1)
| ~ in(X1,X2,skf11(X1,X3))
| ~ be(X1,X4,skf11(X1,X3),X2)
| ~ state(X1,X4) ),
c_0_154,
[final] ).
cnf(c_0_166,negated_conjecture,
( in(X1,skf7(X2,X1),X2)
| ~ member(X1,X2,X3)
| ~ frontseat(X1,X2)
| ~ ssSkP0(X3,X1) ),
c_0_155,
[final] ).
cnf(c_0_167,negated_conjecture,
( state(X1,skf8(X1,X4))
| ~ member(X1,X2,X3)
| ~ frontseat(X1,X2)
| ~ ssSkP0(X3,X1) ),
c_0_156,
[final] ).
cnf(c_0_168,negated_conjecture,
( ssSkP0(X1,X2)
| frontseat(X2,skf11(X2,X3)) ),
clause41,
[final] ).
cnf(c_0_169,negated_conjecture,
( ssSkP0(X1,X2)
| member(X2,skf11(X2,X1),X1) ),
clause42,
[final] ).
cnf(c_0_170,negated_conjecture,
agent(skc33,skc35,skc39),
inference(sr,[status(thm)],[c_0_157,c_0_115]),
[final] ).
cnf(c_0_171,negated_conjecture,
chevy(skc33,skc39),
inference(sr,[status(thm)],[c_0_158,c_0_115]),
[final] ).
cnf(c_0_172,negated_conjecture,
white(skc33,skc39),
inference(sr,[status(thm)],[c_0_159,c_0_115]),
[final] ).
cnf(c_0_173,negated_conjecture,
dirty(skc33,skc39),
inference(sr,[status(thm)],[c_0_160,c_0_115]),
[final] ).
cnf(c_0_174,negated_conjecture,
old(skc33,skc39),
inference(sr,[status(thm)],[c_0_161,c_0_115]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : NLP138-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n002.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 22:37:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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.19/0.50 # Version: 3.1.0
% 0.19/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # new_bool_1 with pid 326 completed with status 1
% 0.19/0.50 # Result found by new_bool_1
% 0.19/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGHNF-FFMM22-SFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.50 # SAT001_MinMin_p005000_rr_RG with pid 333 completed with status 1
% 0.19/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGHNF-FFMM22-SFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.50 # Preprocessing time : 0.004 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # No proof found!
% 0.19/0.50 # SZS status Satisfiable
% 0.19/0.50 # SZS output start Saturation
% See solution above
% 0.19/0.50 # Parsed axioms : 54
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 54
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 54
% 0.19/0.50 # Processed clauses : 153
% 0.19/0.50 # ...of these trivial : 1
% 0.19/0.50 # ...subsumed : 1
% 0.19/0.50 # ...remaining for further processing : 151
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 43
% 0.19/0.50 # Backward-rewritten : 0
% 0.19/0.50 # Generated clauses : 54
% 0.19/0.50 # ...of the previous two non-redundant : 49
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 41
% 0.19/0.50 # Paramodulations : 35
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Disequality decompositions : 0
% 0.19/0.50 # Total rewrite steps : 34
% 0.19/0.50 # ...of those cached : 20
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 35
% 0.19/0.50 # Positive orientable unit clauses : 21
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 1
% 0.19/0.50 # Non-unit-clauses : 13
% 0.19/0.50 # Current number of unprocessed clauses: 0
% 0.19/0.50 # ...number of literals in the above : 0
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 116
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 4669
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 752
% 0.19/0.50 # Non-unit clause-clause subsumptions : 61
% 0.19/0.50 # Unit Clause-clause subsumption calls : 168
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 3
% 0.19/0.50 # BW rewrite match successes : 0
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 5668
% 0.19/0.50 # Search garbage collected termcells : 221
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.016 s
% 0.19/0.50 # System time : 0.005 s
% 0.19/0.50 # Total time : 0.020 s
% 0.19/0.50 # Maximum resident set size: 1916 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.018 s
% 0.19/0.50 # System time : 0.006 s
% 0.19/0.50 # Total time : 0.025 s
% 0.19/0.50 # Maximum resident set size: 1752 pages
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------