TSTP Solution File: NLP012-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NLP012-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:55:58 EDT 2024
% Result : Satisfiable 0.19s 0.50s
% Output : Saturation 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause7)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_60,negated_conjecture,
fellow(skc23),
clause7,
[final] ).
cnf(c_0_61,negated_conjecture,
seat(skc25),
clause5,
[final] ).
cnf(c_0_69,negated_conjecture,
young(skc24),
clause6,
[final] ).
cnf(c_0_75,negated_conjecture,
event(skc28),
clause2,
[final] ).
cnf(c_0_76,negated_conjecture,
hollywood(skc29),
clause1,
[final] ).
cnf(c_0_80,negated_conjecture,
lonely(skc26),
clause4,
[final] ).
cnf(c_0_86,negated_conjecture,
chevy(skc27),
clause3,
[final] ).
cnf(c_0_103,negated_conjecture,
ssSkC0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86])]),c_0_87]),c_0_88]),c_0_89]),c_0_90]),
[final] ).
cnf(c_0_125,negated_conjecture,
( X1 = X2
| ~ in(X2,X3)
| ~ in(X1,X3)
| ~ in(X4,X5)
| ~ down(X4,X6)
| ~ barrel(X4,X7)
| ~ furniture(X3)
| ~ man(X2)
| ~ man(X1)
| ~ car(X7)
| ~ white(X7)
| ~ dirty(X7)
| ~ old(X7)
| ~ way(X6)
| ~ street(X6)
| ~ front(X3)
| ~ city(X5)
| ~ fellow(X2)
| ~ fellow(X1)
| ~ young(X2)
| ~ young(X1)
| ~ seat(X3)
| ~ lonely(X6)
| ~ chevy(X7)
| ~ event(X4)
| ~ hollywood(X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_103])]),
[final] ).
cnf(c_0_126,negated_conjecture,
in(skc21,skc22),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_103])]),
[final] ).
cnf(c_0_127,negated_conjecture,
in(skc16,skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_103])]),
[final] ).
cnf(c_0_128,negated_conjecture,
furniture(skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_103])]),
[final] ).
cnf(c_0_129,negated_conjecture,
man(skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_103])]),
[final] ).
cnf(c_0_130,negated_conjecture,
front(skc17),
clause13,
[final] ).
cnf(c_0_131,negated_conjecture,
fellow(skc16),
clause14,
[final] ).
cnf(c_0_132,negated_conjecture,
young(skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_108,c_0_103])]),
[final] ).
cnf(c_0_133,negated_conjecture,
seat(skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_103])]),
[final] ).
cnf(c_0_134,negated_conjecture,
in(skc15,skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_110,c_0_103])]),
[final] ).
cnf(c_0_135,negated_conjecture,
furniture(skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_111,c_0_103])]),
[final] ).
cnf(c_0_136,negated_conjecture,
man(skc15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_112,c_0_103])]),
[final] ).
cnf(c_0_137,negated_conjecture,
front(skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_113,c_0_103])]),
[final] ).
cnf(c_0_138,negated_conjecture,
fellow(skc15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_114,c_0_103])]),
[final] ).
cnf(c_0_139,negated_conjecture,
young(skc15),
clause15,
[final] ).
cnf(c_0_140,negated_conjecture,
seat(skc18),
clause12,
[final] ).
cnf(c_0_151,negated_conjecture,
( X1 = skc21
| ~ in(X1,skc22)
| ~ in(X2,X3)
| ~ down(X2,X4)
| ~ barrel(X2,X5)
| ~ furniture(skc22)
| ~ man(skc21)
| ~ man(X1)
| ~ car(X5)
| ~ white(X5)
| ~ dirty(X5)
| ~ old(X5)
| ~ way(X4)
| ~ street(X4)
| ~ front(skc22)
| ~ city(X3)
| ~ fellow(skc21)
| ~ fellow(X1)
| ~ young(skc21)
| ~ young(X1)
| ~ seat(skc22)
| ~ lonely(X4)
| ~ chevy(X5)
| ~ event(X2)
| ~ hollywood(X3) ),
inference(spm,[status(thm)],[c_0_125,c_0_126]),
[final] ).
cnf(c_0_152,negated_conjecture,
( X1 = skc16
| ~ in(X1,skc17)
| ~ in(X2,X3)
| ~ down(X2,X4)
| ~ barrel(X2,X5)
| ~ man(X1)
| ~ car(X5)
| ~ white(X5)
| ~ dirty(X5)
| ~ old(X5)
| ~ way(X4)
| ~ street(X4)
| ~ city(X3)
| ~ fellow(X1)
| ~ young(X1)
| ~ lonely(X4)
| ~ chevy(X5)
| ~ event(X2)
| ~ hollywood(X3) ),
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_125,c_0_127]),c_0_128]),c_0_129]),c_0_130]),c_0_131]),c_0_132]),c_0_133])]),
[final] ).
cnf(c_0_153,negated_conjecture,
( X1 = skc15
| ~ in(X1,skc18)
| ~ in(X2,X3)
| ~ down(X2,X4)
| ~ barrel(X2,X5)
| ~ man(X1)
| ~ car(X5)
| ~ white(X5)
| ~ dirty(X5)
| ~ old(X5)
| ~ way(X4)
| ~ street(X4)
| ~ city(X3)
| ~ fellow(X1)
| ~ young(X1)
| ~ lonely(X4)
| ~ chevy(X5)
| ~ event(X2)
| ~ hollywood(X3) ),
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_125,c_0_134]),c_0_135]),c_0_136]),c_0_137]),c_0_138]),c_0_139]),c_0_140])]),
[final] ).
cnf(c_0_154,negated_conjecture,
skc16 != skc15,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_141,c_0_103])]),
[final] ).
cnf(c_0_155,negated_conjecture,
barrel(skc21,skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_142,c_0_103])]),
[final] ).
cnf(c_0_156,negated_conjecture,
down(skc21,skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_143,c_0_103])]),
[final] ).
cnf(c_0_157,negated_conjecture,
hollywood(skc22),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_144,c_0_103])]),
[final] ).
cnf(c_0_158,negated_conjecture,
street(skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_145,c_0_103])]),
[final] ).
cnf(c_0_159,negated_conjecture,
way(skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_146,c_0_103])]),
[final] ).
cnf(c_0_160,negated_conjecture,
old(skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_147,c_0_103])]),
[final] ).
cnf(c_0_161,negated_conjecture,
dirty(skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_148,c_0_103])]),
[final] ).
cnf(c_0_162,negated_conjecture,
white(skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_149,c_0_103])]),
[final] ).
cnf(c_0_163,negated_conjecture,
car(skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_150,c_0_103])]),
[final] ).
cnf(c_0_164,negated_conjecture,
city(skc22),
clause8,
[final] ).
cnf(c_0_165,negated_conjecture,
lonely(skc20),
clause10,
[final] ).
cnf(c_0_166,negated_conjecture,
chevy(skc19),
clause11,
[final] ).
cnf(c_0_167,negated_conjecture,
event(skc21),
clause9,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : NLP012-1 : TPTP v8.2.0. Released v2.4.0.
% 0.08/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n006.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:06:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 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.19/0.50 # Version: 3.1.0
% 0.19/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI 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 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 25721 completed with status 1
% 0.19/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.19/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FGHSF-FFMM00-SFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.19/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.50 # Starting sh5l with 136s (1) cores
% 0.19/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 25726 completed with status 1
% 0.19/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.19/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FGHSF-FFMM00-SFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.19/0.50 # Preprocessing time : 0.002 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 : 57
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 57
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 57
% 0.19/0.50 # Processed clauses : 145
% 0.19/0.50 # ...of these trivial : 0
% 0.19/0.50 # ...subsumed : 0
% 0.19/0.50 # ...remaining for further processing : 145
% 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 : 4
% 0.19/0.50 # Backward-rewritten : 43
% 0.19/0.50 # Generated clauses : 15
% 0.19/0.50 # ...of the previous two non-redundant : 37
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 20
% 0.19/0.50 # Paramodulations : 15
% 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 : 67
% 0.19/0.50 # ...of those cached : 47
% 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 : 41
% 0.19/0.50 # Positive orientable unit clauses : 36
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 1
% 0.19/0.50 # Non-unit-clauses : 4
% 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 : 104
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 3574
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 972
% 0.19/0.50 # Non-unit clause-clause subsumptions : 24
% 0.19/0.50 # Unit Clause-clause subsumption calls : 10
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 1
% 0.19/0.50 # BW rewrite match successes : 1
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 3036
% 0.19/0.50 # Search garbage collected termcells : 173
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.009 s
% 0.19/0.50 # System time : 0.005 s
% 0.19/0.50 # Total time : 0.015 s
% 0.19/0.50 # Maximum resident set size: 1796 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.055 s
% 0.19/0.50 # System time : 0.011 s
% 0.19/0.50 # Total time : 0.066 s
% 0.19/0.50 # Maximum resident set size: 1744 pages
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------