TSTP Solution File: NLP129-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NLP129-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:08 EDT 2024
% Result : Satisfiable 0.21s 0.54s
% Output : Saturation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_96)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_58,plain,
( instrumentality(X1,X2)
| ~ transport(X1,X2) ),
c_0_52,
[final] ).
cnf(c_0_59,plain,
( transport(X1,X2)
| ~ vehicle(X1,X2) ),
c_0_53,
[final] ).
cnf(c_0_61,plain,
( ~ general(X1,X2)
| ~ specific(X1,X2) ),
c_0_54,
[final] ).
cnf(c_0_62,plain,
( general(X1,X2)
| ~ abstraction(X1,X2) ),
c_0_55,
[final] ).
cnf(c_0_64,plain,
( abstraction(X1,X2)
| ~ relation(X1,X2) ),
c_0_56,
[final] ).
cnf(c_0_65,plain,
( relation(X1,X2)
| ~ relname(X1,X2) ),
c_0_57,
[final] ).
cnf(c_0_69,plain,
( instrumentality(X1,X2)
| ~ vehicle(X1,X2) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]),
[final] ).
cnf(c_0_70,plain,
( vehicle(X1,X2)
| ~ car(X1,X2) ),
c_0_60,
[final] ).
cnf(c_0_72,plain,
( ~ abstraction(X1,X2)
| ~ specific(X1,X2) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]),
[final] ).
cnf(c_0_73,plain,
( specific(X1,X2)
| ~ entity(X1,X2) ),
c_0_63,
[final] ).
cnf(c_0_74,plain,
( abstraction(X1,X2)
| ~ relname(X1,X2) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]),
[final] ).
cnf(c_0_75,plain,
( relname(X1,X2)
| ~ placename(X1,X2) ),
c_0_66,
[final] ).
cnf(c_0_77,plain,
( ~ nonexistent(X1,X2)
| ~ existent(X1,X2) ),
c_0_67,
[final] ).
cnf(c_0_78,plain,
( existent(X1,X2)
| ~ entity(X1,X2) ),
c_0_68,
[final] ).
cnf(c_0_81,plain,
( instrumentality(X1,X2)
| ~ car(X1,X2) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]),
[final] ).
cnf(c_0_82,plain,
( car(X1,X2)
| ~ chevy(X1,X2) ),
c_0_71,
[final] ).
cnf(c_0_85,plain,
( ~ abstraction(X1,X2)
| ~ entity(X1,X2) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]),
[final] ).
cnf(c_0_86,plain,
( abstraction(X1,X2)
| ~ placename(X1,X2) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]),
[final] ).
cnf(c_0_88,plain,
( specific(X1,X2)
| ~ eventuality(X1,X2) ),
c_0_76,
[final] ).
cnf(c_0_90,plain,
( ~ entity(X1,X2)
| ~ nonexistent(X1,X2) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]),
[final] ).
cnf(c_0_91,plain,
( nonexistent(X1,X2)
| ~ eventuality(X1,X2) ),
c_0_79,
[final] ).
cnf(c_0_92,plain,
( artifact(X1,X2)
| ~ instrumentality(X1,X2) ),
c_0_80,
[final] ).
cnf(c_0_93,plain,
( instrumentality(X1,X2)
| ~ chevy(X1,X2) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]),
[final] ).
cnf(c_0_94,plain,
( artifact(X1,X2)
| ~ way(X1,X2) ),
c_0_83,
[final] ).
cnf(c_0_95,plain,
( way(X1,X2)
| ~ street(X1,X2) ),
c_0_84,
[final] ).
cnf(c_0_99,plain,
( ~ placename(X1,X2)
| ~ entity(X1,X2) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]),
[final] ).
cnf(c_0_100,plain,
( entity(X1,X2)
| ~ object(X1,X2) ),
c_0_87,
[final] ).
cnf(c_0_101,plain,
( ~ abstraction(X1,X2)
| ~ eventuality(X1,X2) ),
inference(spm,[status(thm)],[c_0_72,c_0_88]),
[final] ).
cnf(c_0_102,plain,
( eventuality(X1,X2)
| ~ event(X1,X2) ),
c_0_89,
[final] ).
cnf(c_0_103,negated_conjecture,
event(skc5,skc6),
clause48,
[final] ).
cnf(c_0_104,plain,
( ~ entity(X1,X2)
| ~ eventuality(X1,X2) ),
inference(spm,[status(thm)],[c_0_90,c_0_91]),
[final] ).
cnf(c_0_106,plain,
( artifact(X1,X2)
| ~ chevy(X1,X2) ),
inference(spm,[status(thm)],[c_0_92,c_0_93]),
[final] ).
cnf(c_0_107,negated_conjecture,
chevy(skc5,skc9),
clause37,
[final] ).
cnf(c_0_108,plain,
( artifact(X1,X2)
| ~ street(X1,X2) ),
inference(spm,[status(thm)],[c_0_94,c_0_95]),
[final] ).
cnf(c_0_109,negated_conjecture,
street(skc5,skc7),
clause41,
[final] ).
cnf(c_0_110,plain,
( X3 = X2
| ~ placename(X1,X2)
| ~ of(X1,X3,X4)
| ~ placename(X1,X3)
| ~ of(X1,X2,X4)
| ~ entity(X1,X4) ),
c_0_96,
[final] ).
cnf(c_0_111,negated_conjecture,
of(skc5,skc8,skc7),
clause49,
[final] ).
cnf(c_0_112,negated_conjecture,
placename(skc5,skc8),
clause38,
[final] ).
cnf(c_0_120,plain,
( object(X1,X2)
| ~ location(X1,X2) ),
c_0_97,
[final] ).
cnf(c_0_121,plain,
( location(X1,X2)
| ~ city(X1,X2) ),
c_0_98,
[final] ).
cnf(c_0_127,plain,
( ~ placename(X1,X2)
| ~ object(X1,X2) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]),
[final] ).
cnf(c_0_128,plain,
( ~ placename(X1,X2)
| ~ eventuality(X1,X2) ),
inference(spm,[status(thm)],[c_0_101,c_0_86]),
[final] ).
cnf(c_0_129,negated_conjecture,
eventuality(skc5,skc6),
inference(spm,[status(thm)],[c_0_102,c_0_103]),
[final] ).
cnf(c_0_130,plain,
( ~ object(X1,X2)
| ~ eventuality(X1,X2) ),
inference(spm,[status(thm)],[c_0_104,c_0_100]),
[final] ).
cnf(c_0_131,plain,
( object(X1,X2)
| ~ artifact(X1,X2) ),
c_0_105,
[final] ).
cnf(c_0_132,negated_conjecture,
artifact(skc5,skc9),
inference(spm,[status(thm)],[c_0_106,c_0_107]),
[final] ).
cnf(c_0_133,negated_conjecture,
artifact(skc5,skc7),
inference(spm,[status(thm)],[c_0_108,c_0_109]),
[final] ).
cnf(c_0_134,negated_conjecture,
( X1 = skc8
| ~ of(skc5,X1,skc7)
| ~ placename(skc5,X1)
| ~ entity(skc5,skc7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_112])]),
[final] ).
cnf(c_0_135,plain,
( nonhuman(X1,X2)
| ~ abstraction(X1,X2) ),
c_0_113,
[final] ).
cnf(c_0_136,plain,
( impartial(X1,X2)
| ~ object(X1,X2) ),
c_0_114,
[final] ).
cnf(c_0_137,plain,
( nonliving(X1,X2)
| ~ object(X1,X2) ),
c_0_115,
[final] ).
cnf(c_0_138,plain,
( unisex(X1,X2)
| ~ abstraction(X1,X2) ),
c_0_116,
[final] ).
cnf(c_0_139,plain,
( unisex(X1,X2)
| ~ object(X1,X2) ),
c_0_117,
[final] ).
cnf(c_0_140,plain,
( unisex(X1,X2)
| ~ eventuality(X1,X2) ),
c_0_118,
[final] ).
cnf(c_0_141,plain,
( singleton(X1,X2)
| ~ thing(X1,X2) ),
c_0_119,
[final] ).
cnf(c_0_142,plain,
( object(X1,X2)
| ~ city(X1,X2) ),
inference(spm,[status(thm)],[c_0_120,c_0_121]),
[final] ).
cnf(c_0_143,plain,
( thing(X1,X2)
| ~ abstraction(X1,X2) ),
c_0_122,
[final] ).
cnf(c_0_144,plain,
( thing(X1,X2)
| ~ entity(X1,X2) ),
c_0_123,
[final] ).
cnf(c_0_145,plain,
( thing(X1,X2)
| ~ eventuality(X1,X2) ),
c_0_124,
[final] ).
cnf(c_0_146,plain,
( placename(X1,X2)
| ~ hollywood_placename(X1,X2) ),
c_0_125,
[final] ).
cnf(c_0_147,plain,
( event(X1,X2)
| ~ barrel(X1,X2) ),
c_0_126,
[final] ).
cnf(c_0_148,negated_conjecture,
~ object(skc5,skc8),
inference(spm,[status(thm)],[c_0_127,c_0_112]),
[final] ).
cnf(c_0_149,negated_conjecture,
~ placename(skc5,skc6),
inference(spm,[status(thm)],[c_0_128,c_0_129]),
[final] ).
cnf(c_0_150,negated_conjecture,
~ object(skc5,skc6),
inference(spm,[status(thm)],[c_0_130,c_0_129]),
[final] ).
cnf(c_0_151,negated_conjecture,
object(skc5,skc9),
inference(spm,[status(thm)],[c_0_131,c_0_132]),
[final] ).
cnf(c_0_152,negated_conjecture,
object(skc5,skc7),
inference(spm,[status(thm)],[c_0_131,c_0_133]),
[final] ).
cnf(c_0_153,negated_conjecture,
agent(skc5,skc6,skc9),
clause52,
[final] ).
cnf(c_0_154,negated_conjecture,
in(skc5,skc6,skc7),
clause51,
[final] ).
cnf(c_0_155,negated_conjecture,
down(skc5,skc6,skc7),
clause50,
[final] ).
cnf(c_0_156,negated_conjecture,
present(skc5,skc6),
clause47,
[final] ).
cnf(c_0_157,negated_conjecture,
old(skc5,skc9),
clause45,
[final] ).
cnf(c_0_158,negated_conjecture,
dirty(skc5,skc9),
clause44,
[final] ).
cnf(c_0_159,negated_conjecture,
white(skc5,skc9),
clause43,
[final] ).
cnf(c_0_160,negated_conjecture,
lonely(skc5,skc7),
clause42,
[final] ).
cnf(c_0_161,negated_conjecture,
city(skc5,skc7),
clause40,
[final] ).
cnf(c_0_162,negated_conjecture,
hollywood_placename(skc5,skc8),
clause39,
[final] ).
cnf(c_0_163,negated_conjecture,
barrel(skc5,skc6),
clause46,
[final] ).
cnf(c_0_164,negated_conjecture,
actual_world(skc5),
clause36,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP129-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 21:41:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.52 Running first-order model finding
% 0.21/0.52 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.21/0.54 # Version: 3.1.0
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 7566 completed with status 1
% 0.21/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FHHSF-FFMM00-SFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.54 # Starting sh5l with 136s (1) cores
% 0.21/0.54 # SAT001_MinMin_p005000_rr_RG with pid 7569 completed with status 1
% 0.21/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FHHSF-FFMM00-SFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.54 # Preprocessing time : 0.002 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # No proof found!
% 0.21/0.54 # SZS status Satisfiable
% 0.21/0.54 # SZS output start Saturation
% See solution above
% 0.21/0.54 # Parsed axioms : 52
% 0.21/0.54 # Removed by relevancy pruning/SinE : 0
% 0.21/0.54 # Initial clauses : 52
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 52
% 0.21/0.54 # Processed clauses : 130
% 0.21/0.54 # ...of these trivial : 0
% 0.21/0.54 # ...subsumed : 0
% 0.21/0.54 # ...remaining for further processing : 130
% 0.21/0.54 # Other redundant clauses eliminated : 0
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 0
% 0.21/0.54 # Backward-rewritten : 0
% 0.21/0.54 # Generated clauses : 29
% 0.21/0.54 # ...of the previous two non-redundant : 26
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 29
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 0
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 4
% 0.21/0.54 # ...of those cached : 1
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 78
% 0.21/0.54 # Positive orientable unit clauses : 22
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 3
% 0.21/0.54 # Non-unit-clauses : 53
% 0.21/0.54 # Current number of unprocessed clauses: 0
% 0.21/0.54 # ...number of literals in the above : 0
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 52
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 1336
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 1178
% 0.21/0.54 # Non-unit clause-clause subsumptions : 0
% 0.21/0.54 # Unit Clause-clause subsumption calls : 17
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 0
% 0.21/0.54 # BW rewrite match successes : 0
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 1451
% 0.21/0.54 # Search garbage collected termcells : 77
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.007 s
% 0.21/0.54 # System time : 0.003 s
% 0.21/0.54 # Total time : 0.010 s
% 0.21/0.54 # Maximum resident set size: 1700 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.025 s
% 0.21/0.54 # System time : 0.012 s
% 0.21/0.54 # Total time : 0.037 s
% 0.21/0.54 # Maximum resident set size: 1756 pages
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------