TSTP Solution File: NLP008-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NLP008-1 : TPTP v8.1.2. 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 : Sat May 4 08:44:42 EDT 2024
% Result : Satisfiable 0.21s 0.52s
% Output : Saturation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause7)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_71,negated_conjecture,
fellow(skc23),
clause7,
[final] ).
cnf(c_0_72,negated_conjecture,
seat(skc25),
clause5,
[final] ).
cnf(c_0_81,negated_conjecture,
young(skc15),
clause15,
[final] ).
cnf(c_0_82,negated_conjecture,
seat(skc18),
clause12,
[final] ).
cnf(c_0_89,negated_conjecture,
front(skc17),
clause13,
[final] ).
cnf(c_0_90,negated_conjecture,
fellow(skc16),
clause14,
[final] ).
cnf(c_0_97,negated_conjecture,
young(skc24),
clause6,
[final] ).
cnf(c_0_103,negated_conjecture,
event(skc21),
clause9,
[final] ).
cnf(c_0_104,negated_conjecture,
city(skc22),
clause8,
[final] ).
cnf(c_0_114,negated_conjecture,
event(skc28),
clause2,
[final] ).
cnf(c_0_115,negated_conjecture,
city(skc29),
clause1,
[final] ).
cnf(c_0_120,negated_conjecture,
old(skc20),
clause10,
[final] ).
cnf(c_0_131,negated_conjecture,
chevy(skc26),
clause4,
[final] ).
cnf(c_0_139,negated_conjecture,
street(skc19),
clause11,
[final] ).
cnf(c_0_146,negated_conjecture,
lonely(skc27),
clause3,
[final] ).
cnf(c_0_153,negated_conjecture,
ssSkC0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_145]),c_0_146])]),c_0_147]),c_0_148]),
[final] ).
cnf(c_0_157,negated_conjecture,
( X1 = X2
| ~ in(X2,X3)
| ~ in(X1,X3)
| ~ in(X4,X5)
| ~ barrel(X4,X6)
| ~ down(X4,X7)
| ~ furniture(X3)
| ~ man(X2)
| ~ man(X1)
| ~ hollywood(X5)
| ~ way(X7)
| ~ car(X6)
| ~ white(X6)
| ~ dirty(X6)
| ~ front(X3)
| ~ street(X7)
| ~ old(X6)
| ~ fellow(X2)
| ~ fellow(X1)
| ~ young(X2)
| ~ young(X1)
| ~ seat(X3)
| ~ chevy(X6)
| ~ lonely(X7)
| ~ event(X4)
| ~ city(X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_153])]),
[final] ).
cnf(c_0_158,negated_conjecture,
( X1 = skc15
| ~ in(X1,skc18)
| ~ man(X1)
| ~ fellow(X1)
| ~ young(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_150,c_0_153])]),
[final] ).
cnf(c_0_159,negated_conjecture,
( X1 = skc16
| ~ in(X1,skc17)
| ~ man(X1)
| ~ fellow(X1)
| ~ young(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_152,c_0_153])]),
[final] ).
cnf(c_0_160,negated_conjecture,
( X1 = skc21
| ~ in(X1,skc22)
| ~ furniture(skc22)
| ~ man(skc21)
| ~ man(X1)
| ~ front(skc22)
| ~ fellow(skc21)
| ~ fellow(X1)
| ~ young(skc21)
| ~ young(X1)
| ~ seat(skc22) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_154,c_0_153])]),
[final] ).
cnf(c_0_161,negated_conjecture,
~ in(skc16,skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_155,c_0_153])]),
[final] ).
cnf(c_0_162,negated_conjecture,
~ in(skc15,skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_156,c_0_153])]),
[final] ).
cnf(c_0_163,negated_conjecture,
skc16 != skc15,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_151,c_0_153])]),
[final] ).
cnf(c_0_164,negated_conjecture,
down(skc21,skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_138,c_0_153])]),
[final] ).
cnf(c_0_165,negated_conjecture,
barrel(skc21,skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_119,c_0_153])]),
[final] ).
cnf(c_0_166,negated_conjecture,
in(skc21,skc22),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_153])]),
[final] ).
cnf(c_0_167,negated_conjecture,
in(skc16,skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_153])]),
[final] ).
cnf(c_0_168,negated_conjecture,
in(skc15,skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_153])]),
[final] ).
cnf(c_0_169,negated_conjecture,
lonely(skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_140,c_0_153])]),
[final] ).
cnf(c_0_170,negated_conjecture,
chevy(skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_121,c_0_153])]),
[final] ).
cnf(c_0_171,negated_conjecture,
seat(skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_153])]),
[final] ).
cnf(c_0_172,negated_conjecture,
young(skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_153])]),
[final] ).
cnf(c_0_173,negated_conjecture,
fellow(skc15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_153])]),
[final] ).
cnf(c_0_174,negated_conjecture,
front(skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_153])]),
[final] ).
cnf(c_0_175,negated_conjecture,
dirty(skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_122,c_0_153])]),
[final] ).
cnf(c_0_176,negated_conjecture,
white(skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_123,c_0_153])]),
[final] ).
cnf(c_0_177,negated_conjecture,
car(skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_153])]),
[final] ).
cnf(c_0_178,negated_conjecture,
way(skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_141,c_0_153])]),
[final] ).
cnf(c_0_179,negated_conjecture,
hollywood(skc22),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_153])]),
[final] ).
cnf(c_0_180,negated_conjecture,
man(skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_153])]),
[final] ).
cnf(c_0_181,negated_conjecture,
man(skc15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_153])]),
[final] ).
cnf(c_0_182,negated_conjecture,
furniture(skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_153])]),
[final] ).
cnf(c_0_183,negated_conjecture,
furniture(skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_153])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NLP008-1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/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 : Fri May 3 08:47:31 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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.yDK1R6pA9k/E---3.1_18542.p
% 0.21/0.52 # Version: 3.1.0
% 0.21/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # new_bool_3 with pid 18634 completed with status 1
% 0.21/0.52 # Result found by new_bool_3
% 0.21/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGHSF-FFMM00-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # SAT001_MinMin_p005000_rr_RG with pid 18641 completed with status 1
% 0.21/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGHSF-FFMM00-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # Preprocessing time : 0.002 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # No proof found!
% 0.21/0.52 # SZS status Satisfiable
% 0.21/0.52 # SZS output start Saturation
% See solution above
% 0.21/0.52 # Parsed axioms : 57
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 57
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 57
% 0.21/0.52 # Processed clauses : 167
% 0.21/0.52 # ...of these trivial : 2
% 0.21/0.52 # ...subsumed : 5
% 0.21/0.52 # ...remaining for further processing : 160
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 12
% 0.21/0.52 # Backward-rewritten : 48
% 0.21/0.52 # Generated clauses : 60
% 0.21/0.52 # ...of the previous two non-redundant : 80
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 49
% 0.21/0.52 # Paramodulations : 60
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 115
% 0.21/0.52 # ...of those cached : 91
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 43
% 0.21/0.52 # Positive orientable unit clauses : 36
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 3
% 0.21/0.52 # Non-unit-clauses : 4
% 0.21/0.52 # Current number of unprocessed clauses: 0
% 0.21/0.52 # ...number of literals in the above : 0
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 117
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 3387
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 824
% 0.21/0.52 # Non-unit clause-clause subsumptions : 64
% 0.21/0.52 # Unit Clause-clause subsumption calls : 14
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 1
% 0.21/0.52 # BW rewrite match successes : 1
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 5258
% 0.21/0.52 # Search garbage collected termcells : 173
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.018 s
% 0.21/0.52 # System time : 0.002 s
% 0.21/0.52 # Total time : 0.020 s
% 0.21/0.52 # Maximum resident set size: 1784 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.020 s
% 0.21/0.52 # System time : 0.003 s
% 0.21/0.52 # Total time : 0.024 s
% 0.21/0.52 # Maximum resident set size: 1740 pages
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------