TSTP Solution File: NLP012-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NLP012-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:41:20 EDT 2023
% Result : Satisfiable 0.22s 0.53s
% Output : Saturation 0.22s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause7)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_59,negated_conjecture,
fellow(skc23),
clause7,
[final] ).
cnf(c_0_60,negated_conjecture,
seat(skc25),
clause5,
[final] ).
cnf(c_0_67,negated_conjecture,
young(skc24),
clause6,
[final] ).
cnf(c_0_73,negated_conjecture,
event(skc28),
clause2,
[final] ).
cnf(c_0_74,negated_conjecture,
hollywood(skc29),
clause1,
[final] ).
cnf(c_0_78,negated_conjecture,
lonely(skc26),
clause4,
[final] ).
cnf(c_0_83,negated_conjecture,
chevy(skc27),
clause3,
[final] ).
cnf(c_0_89,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_81,c_0_82]),c_0_83])]),c_0_84]),c_0_85]),c_0_86]),c_0_87]),
[final] ).
cnf(c_0_101,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_88,c_0_89])]),
[final] ).
cnf(c_0_102,negated_conjecture,
in(skc21,skc22),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_89])]),
[final] ).
cnf(c_0_103,negated_conjecture,
in(skc16,skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_89])]),
[final] ).
cnf(c_0_104,negated_conjecture,
furniture(skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_89])]),
[final] ).
cnf(c_0_105,negated_conjecture,
man(skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_89])]),
[final] ).
cnf(c_0_106,negated_conjecture,
front(skc17),
clause13,
[final] ).
cnf(c_0_107,negated_conjecture,
fellow(skc16),
clause14,
[final] ).
cnf(c_0_108,negated_conjecture,
young(skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_89])]),
[final] ).
cnf(c_0_109,negated_conjecture,
seat(skc17),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_89])]),
[final] ).
cnf(c_0_110,negated_conjecture,
in(skc15,skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_89])]),
[final] ).
cnf(c_0_111,negated_conjecture,
furniture(skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_89])]),
[final] ).
cnf(c_0_112,negated_conjecture,
man(skc15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_89])]),
[final] ).
cnf(c_0_113,negated_conjecture,
front(skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_89])]),
[final] ).
cnf(c_0_114,negated_conjecture,
fellow(skc15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_89])]),
[final] ).
cnf(c_0_115,negated_conjecture,
young(skc15),
clause15,
[final] ).
cnf(c_0_116,negated_conjecture,
seat(skc18),
clause12,
[final] ).
cnf(c_0_127,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_101,c_0_102]),
[final] ).
cnf(c_0_128,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_101,c_0_103]),c_0_104]),c_0_105]),c_0_106]),c_0_107]),c_0_108]),c_0_109])]),
[final] ).
cnf(c_0_129,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_101,c_0_110]),c_0_111]),c_0_112]),c_0_113]),c_0_114]),c_0_115]),c_0_116])]),
[final] ).
cnf(c_0_130,negated_conjecture,
skc16 != skc15,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_117,c_0_89])]),
[final] ).
cnf(c_0_131,negated_conjecture,
barrel(skc21,skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_118,c_0_89])]),
[final] ).
cnf(c_0_132,negated_conjecture,
down(skc21,skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_119,c_0_89])]),
[final] ).
cnf(c_0_133,negated_conjecture,
hollywood(skc22),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_120,c_0_89])]),
[final] ).
cnf(c_0_134,negated_conjecture,
street(skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_121,c_0_89])]),
[final] ).
cnf(c_0_135,negated_conjecture,
way(skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_122,c_0_89])]),
[final] ).
cnf(c_0_136,negated_conjecture,
old(skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_123,c_0_89])]),
[final] ).
cnf(c_0_137,negated_conjecture,
dirty(skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_89])]),
[final] ).
cnf(c_0_138,negated_conjecture,
white(skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_125,c_0_89])]),
[final] ).
cnf(c_0_139,negated_conjecture,
car(skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_126,c_0_89])]),
[final] ).
cnf(c_0_140,negated_conjecture,
city(skc22),
clause8,
[final] ).
cnf(c_0_141,negated_conjecture,
lonely(skc20),
clause10,
[final] ).
cnf(c_0_142,negated_conjecture,
chevy(skc19),
clause11,
[final] ).
cnf(c_0_143,negated_conjecture,
event(skc21),
clause9,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NLP012-1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n011.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 11:13:08 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.PV4K1ELyXa/E---3.1_13270.p
% 0.22/0.53 # Version: 3.1pre001
% 0.22/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 13403 completed with status 1
% 0.22/0.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.22/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: FGHSF-FFMM00-SFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.22/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.53 # Starting sh5l with 136s (1) cores
% 0.22/0.53 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 13410 completed with status 1
% 0.22/0.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.22/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: FGHSF-FFMM00-SFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.22/0.53 # Preprocessing time : 0.002 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # No proof found!
% 0.22/0.53 # SZS status Satisfiable
% 0.22/0.53 # SZS output start Saturation
% See solution above
% 0.22/0.53 # Parsed axioms : 57
% 0.22/0.53 # Removed by relevancy pruning/SinE : 0
% 0.22/0.53 # Initial clauses : 57
% 0.22/0.53 # Removed in clause preprocessing : 0
% 0.22/0.53 # Initial clauses in saturation : 57
% 0.22/0.53 # Processed clauses : 145
% 0.22/0.53 # ...of these trivial : 0
% 0.22/0.53 # ...subsumed : 0
% 0.22/0.53 # ...remaining for further processing : 145
% 0.22/0.53 # Other redundant clauses eliminated : 0
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 4
% 0.22/0.53 # Backward-rewritten : 43
% 0.22/0.53 # Generated clauses : 15
% 0.22/0.53 # ...of the previous two non-redundant : 37
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 20
% 0.22/0.53 # Paramodulations : 15
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 0
% 0.22/0.53 # Total rewrite steps : 67
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 41
% 0.22/0.53 # Positive orientable unit clauses : 36
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 1
% 0.22/0.53 # Non-unit-clauses : 4
% 0.22/0.53 # Current number of unprocessed clauses: 0
% 0.22/0.53 # ...number of literals in the above : 0
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 104
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 3574
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 972
% 0.22/0.53 # Non-unit clause-clause subsumptions : 24
% 0.22/0.53 # Unit Clause-clause subsumption calls : 10
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 1
% 0.22/0.53 # BW rewrite match successes : 1
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 2653
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.012 s
% 0.22/0.53 # System time : 0.002 s
% 0.22/0.53 # Total time : 0.014 s
% 0.22/0.53 # Maximum resident set size: 1720 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.053 s
% 0.22/0.53 # System time : 0.012 s
% 0.22/0.53 # Total time : 0.065 s
% 0.22/0.53 # Maximum resident set size: 1728 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------