TSTP Solution File: NLP036-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NLP036-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:53:40 EDT 2024
% Result : Satisfiable 0.21s 0.55s
% Output : Saturation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_73)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_68,plain,
( set(X1,X2)
| ~ group(X1,X2) ),
c_0_66,
[final] ).
cnf(c_0_69,negated_conjecture,
group(skc2,skc3),
clause54,
[final] ).
cnf(c_0_71,plain,
( multiple(X1,X2)
| ~ set(X1,X2) ),
c_0_67,
[final] ).
cnf(c_0_72,negated_conjecture,
set(skc2,skc3),
inference(spm,[status(thm)],[c_0_68,c_0_69]),
[final] ).
cnf(c_0_133,plain,
( ~ multiple(X1,X2)
| ~ singleton(X1,X2) ),
c_0_70,
[final] ).
cnf(c_0_134,negated_conjecture,
multiple(skc2,skc3),
inference(spm,[status(thm)],[c_0_71,c_0_72]),
[final] ).
cnf(c_0_136,plain,
( three(X6,X7)
| X1 = X9
| X1 = X8
| X8 = X9
| skf18(X1,X2,X3,X4,X5) != X1
| ~ member(X6,X1,X7)
| ~ member(X6,X8,X7)
| ~ member(X6,X9,X7) ),
c_0_73,
[final] ).
cnf(c_0_137,plain,
( three(X1,X3)
| member(X1,skf18(X2,X4,X5,X3,X1),X3)
| X2 = X5
| X2 = X4
| X4 = X5
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X3)
| ~ member(X1,X5,X3) ),
c_0_74,
[final] ).
cnf(c_0_138,plain,
( three(X6,X7)
| X1 = X8
| X1 = X2
| X2 = X8
| skf18(X1,X2,X3,X4,X5) != X2
| ~ member(X6,X1,X7)
| ~ member(X6,X2,X7)
| ~ member(X6,X8,X7) ),
c_0_75,
[final] ).
cnf(c_0_139,plain,
( three(X6,X7)
| X1 = X3
| X1 = X2
| X2 = X3
| skf18(X1,X2,X3,X4,X5) != X3
| ~ member(X6,X1,X7)
| ~ member(X6,X2,X7)
| ~ member(X6,X3,X7) ),
c_0_76,
[final] ).
cnf(c_0_140,negated_conjecture,
( at(skc2,skf10(X3,X4),skf11(X4,X3))
| ~ member(skc2,X1,skf9(X2))
| ~ member(skc2,X2,skc3) ),
c_0_77,
[final] ).
cnf(c_0_141,plain,
( X2 = skf13(X3,X1)
| X2 = skf15(X3,X1)
| X2 = skf17(X3,X1)
| ~ member(X1,X2,X3)
| ~ three(X1,X3) ),
c_0_78,
[final] ).
cnf(c_0_142,negated_conjecture,
( agent(skc2,skf10(X1,X3),X1)
| ~ member(skc2,X1,skf9(X2))
| ~ member(skc2,X2,skc3) ),
c_0_79,
[final] ).
cnf(c_0_143,negated_conjecture,
( present(skc2,skf10(X3,X4))
| ~ member(skc2,X1,skf9(X2))
| ~ member(skc2,X2,skc3) ),
c_0_80,
[final] ).
cnf(c_0_144,negated_conjecture,
( table(skc2,skf11(X3,X4))
| ~ member(skc2,X1,skf9(X2))
| ~ member(skc2,X2,skc3) ),
c_0_81,
[final] ).
cnf(c_0_145,negated_conjecture,
( event(skc2,skf10(X3,X4))
| ~ member(skc2,X1,skf9(X2))
| ~ member(skc2,X2,skc3) ),
c_0_82,
[final] ).
cnf(c_0_146,negated_conjecture,
( sit(skc2,skf10(X3,X4))
| ~ member(skc2,X1,skf9(X2))
| ~ member(skc2,X2,skc3) ),
c_0_83,
[final] ).
cnf(c_0_147,negated_conjecture,
( with(skc2,skf10(X1,X2),X2)
| ~ member(skc2,X1,skf9(X2))
| ~ member(skc2,X2,skc3) ),
c_0_84,
[final] ).
cnf(c_0_148,plain,
( member(X1,skf13(X2,X1),X2)
| ~ three(X1,X2) ),
c_0_85,
[final] ).
cnf(c_0_149,plain,
( member(X1,skf15(X2,X1),X2)
| ~ three(X1,X2) ),
c_0_86,
[final] ).
cnf(c_0_150,plain,
( member(X1,skf17(X2,X1),X2)
| ~ three(X1,X2) ),
c_0_87,
[final] ).
cnf(c_0_151,plain,
( instrumentality(X1,X2)
| ~ furniture(X1,X2) ),
c_0_88,
[final] ).
cnf(c_0_152,plain,
( nonexistent(X1,X2)
| ~ eventuality(X1,X2) ),
c_0_89,
[final] ).
cnf(c_0_153,plain,
( unisex(X1,X2)
| ~ eventuality(X1,X2) ),
c_0_90,
[final] ).
cnf(c_0_154,plain,
( unisex(X1,X2)
| ~ object(X1,X2) ),
c_0_91,
[final] ).
cnf(c_0_155,plain,
( nonliving(X1,X2)
| ~ object(X1,X2) ),
c_0_92,
[final] ).
cnf(c_0_156,plain,
( substance_matter(X1,X2)
| ~ food(X1,X2) ),
c_0_93,
[final] ).
cnf(c_0_157,plain,
( food(X1,X2)
| ~ meat(X1,X2) ),
c_0_94,
[final] ).
cnf(c_0_158,plain,
( meat(X1,X2)
| ~ burger(X1,X2) ),
c_0_95,
[final] ).
cnf(c_0_159,plain,
( male(X1,X2)
| ~ man(X1,X2) ),
c_0_96,
[final] ).
cnf(c_0_160,plain,
( animate(X1,X2)
| ~ human_person(X1,X2) ),
c_0_97,
[final] ).
cnf(c_0_161,plain,
( human(X1,X2)
| ~ human_person(X1,X2) ),
c_0_98,
[final] ).
cnf(c_0_162,plain,
( living(X1,X2)
| ~ organism(X1,X2) ),
c_0_99,
[final] ).
cnf(c_0_163,plain,
( impartial(X1,X2)
| ~ object(X1,X2) ),
c_0_100,
[final] ).
cnf(c_0_164,plain,
( impartial(X1,X2)
| ~ organism(X1,X2) ),
c_0_101,
[final] ).
cnf(c_0_165,plain,
( existent(X1,X2)
| ~ entity(X1,X2) ),
c_0_102,
[final] ).
cnf(c_0_166,plain,
( specific(X1,X2)
| ~ eventuality(X1,X2) ),
c_0_103,
[final] ).
cnf(c_0_167,plain,
( specific(X1,X2)
| ~ entity(X1,X2) ),
c_0_104,
[final] ).
cnf(c_0_168,plain,
( singleton(X1,X2)
| ~ thing(X1,X2) ),
c_0_105,
[final] ).
cnf(c_0_169,plain,
( thing(X1,X2)
| ~ eventuality(X1,X2) ),
c_0_106,
[final] ).
cnf(c_0_170,plain,
( thing(X1,X2)
| ~ entity(X1,X2) ),
c_0_107,
[final] ).
cnf(c_0_171,plain,
( skf15(X1,X2) != skf13(X1,X2)
| ~ three(X2,X1) ),
c_0_108,
[final] ).
cnf(c_0_172,plain,
( entity(X1,X2)
| ~ object(X1,X2) ),
c_0_109,
[final] ).
cnf(c_0_173,plain,
( organism(X1,X2)
| ~ human_person(X1,X2) ),
c_0_110,
[final] ).
cnf(c_0_174,plain,
( skf17(X1,X2) != skf13(X1,X2)
| ~ three(X2,X1) ),
c_0_111,
[final] ).
cnf(c_0_175,plain,
( skf17(X1,X2) != skf15(X1,X2)
| ~ three(X2,X1) ),
c_0_112,
[final] ).
cnf(c_0_176,negated_conjecture,
( young(skc2,X1)
| ~ member(skc2,X1,skf9(X2))
| ~ member(skc2,X3,skc3) ),
c_0_113,
[final] ).
cnf(c_0_177,negated_conjecture,
( guy(skc2,X1)
| ~ member(skc2,X1,skf9(X2))
| ~ member(skc2,X3,skc3) ),
c_0_114,
[final] ).
cnf(c_0_178,plain,
( artifact(X1,X2)
| ~ instrumentality(X1,X2) ),
c_0_115,
[final] ).
cnf(c_0_179,plain,
( object(X1,X2)
| ~ artifact(X1,X2) ),
c_0_116,
[final] ).
cnf(c_0_180,plain,
( object(X1,X2)
| ~ substance_matter(X1,X2) ),
c_0_117,
[final] ).
cnf(c_0_181,plain,
( entity(X1,X2)
| ~ organism(X1,X2) ),
c_0_118,
[final] ).
cnf(c_0_182,plain,
( furniture(X1,X2)
| ~ table(X1,X2) ),
c_0_119,
[final] ).
cnf(c_0_183,plain,
( human_person(X1,X2)
| ~ man(X1,X2) ),
c_0_120,
[final] ).
cnf(c_0_184,plain,
( eventuality(X1,X2)
| ~ event(X1,X2) ),
c_0_121,
[final] ).
cnf(c_0_185,plain,
( burger(X1,X2)
| ~ hamburger(X1,X2) ),
c_0_122,
[final] ).
cnf(c_0_186,plain,
( ~ male(X1,X2)
| ~ unisex(X1,X2) ),
c_0_123,
[final] ).
cnf(c_0_187,negated_conjecture,
( three(skc2,skf9(X2))
| ~ member(skc2,X1,skc3) ),
c_0_124,
[final] ).
cnf(c_0_188,plain,
( event(X1,X2)
| ~ sit(X1,X2) ),
c_0_125,
[final] ).
cnf(c_0_189,plain,
( ~ nonliving(X1,X2)
| ~ animate(X1,X2) ),
c_0_126,
[final] ).
cnf(c_0_190,plain,
( ~ living(X1,X2)
| ~ nonliving(X1,X2) ),
c_0_127,
[final] ).
cnf(c_0_191,plain,
( ~ nonexistent(X1,X2)
| ~ existent(X1,X2) ),
c_0_128,
[final] ).
cnf(c_0_192,plain,
( group(X1,X2)
| ~ three(X1,X2) ),
c_0_129,
[final] ).
cnf(c_0_193,plain,
( man(X1,X2)
| ~ guy(X1,X2) ),
c_0_130,
[final] ).
cnf(c_0_194,negated_conjecture,
( group(skc2,skf9(X2))
| ~ member(skc2,X1,skc3) ),
c_0_131,
[final] ).
cnf(c_0_195,negated_conjecture,
( hamburger(skc2,X1)
| ~ member(skc2,X1,skc3) ),
c_0_132,
[final] ).
cnf(c_0_196,negated_conjecture,
~ singleton(skc2,skc3),
inference(spm,[status(thm)],[c_0_133,c_0_134]),
[final] ).
cnf(c_0_197,plain,
~ member(X1,X2,X2),
c_0_135,
[final] ).
cnf(c_0_198,negated_conjecture,
actual_world(skc2),
clause53,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NLP036-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 21:54:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.53 Running first-order theorem proving
% 0.21/0.53 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.21/0.55 # Version: 3.1.0
% 0.21/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # Starting sh5l with 300s (1) cores
% 0.21/0.55 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 30145 completed with status 1
% 0.21/0.55 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.55 # No SInE strategy applied
% 0.21/0.55 # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.21/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.21/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.55 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.55 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 136s (1) cores
% 0.21/0.55 # G-E--_208_C18_F1_AE_CS_SP_PI_S0a with pid 30156 completed with status 1
% 0.21/0.55 # Result found by G-E--_208_C18_F1_AE_CS_SP_PI_S0a
% 0.21/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.55 # No SInE strategy applied
% 0.21/0.55 # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.21/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.21/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.55 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.55 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 136s (1) cores
% 0.21/0.55 # Preprocessing time : 0.002 s
% 0.21/0.55
% 0.21/0.55 # No proof found!
% 0.21/0.55 # SZS status Satisfiable
% 0.21/0.55 # SZS output start Saturation
% See solution above
% 0.21/0.55 # Parsed axioms : 66
% 0.21/0.55 # Removed by relevancy pruning/SinE : 0
% 0.21/0.55 # Initial clauses : 66
% 0.21/0.55 # Removed in clause preprocessing : 0
% 0.21/0.55 # Initial clauses in saturation : 66
% 0.21/0.55 # Processed clauses : 69
% 0.21/0.55 # ...of these trivial : 0
% 0.21/0.55 # ...subsumed : 0
% 0.21/0.55 # ...remaining for further processing : 69
% 0.21/0.55 # Other redundant clauses eliminated : 0
% 0.21/0.55 # Clauses deleted for lack of memory : 0
% 0.21/0.55 # Backward-subsumed : 0
% 0.21/0.55 # Backward-rewritten : 0
% 0.21/0.55 # Generated clauses : 3
% 0.21/0.55 # ...of the previous two non-redundant : 3
% 0.21/0.55 # ...aggressively subsumed : 0
% 0.21/0.55 # Contextual simplify-reflections : 0
% 0.21/0.55 # Paramodulations : 3
% 0.21/0.55 # Factorizations : 0
% 0.21/0.55 # NegExts : 0
% 0.21/0.55 # Equation resolutions : 0
% 0.21/0.55 # Disequality decompositions : 0
% 0.21/0.55 # Total rewrite steps : 0
% 0.21/0.55 # ...of those cached : 0
% 0.21/0.55 # Propositional unsat checks : 0
% 0.21/0.55 # Propositional check models : 0
% 0.21/0.55 # Propositional check unsatisfiable : 0
% 0.21/0.55 # Propositional clauses : 0
% 0.21/0.55 # Propositional clauses after purity: 0
% 0.21/0.55 # Propositional unsat core size : 0
% 0.21/0.55 # Propositional preprocessing time : 0.000
% 0.21/0.55 # Propositional encoding time : 0.000
% 0.21/0.55 # Propositional solver time : 0.000
% 0.21/0.55 # Success case prop preproc time : 0.000
% 0.21/0.55 # Success case prop encoding time : 0.000
% 0.21/0.55 # Success case prop solver time : 0.000
% 0.21/0.55 # Current number of processed clauses : 69
% 0.21/0.55 # Positive orientable unit clauses : 4
% 0.21/0.55 # Positive unorientable unit clauses: 0
% 0.21/0.55 # Negative unit clauses : 2
% 0.21/0.55 # Non-unit-clauses : 63
% 0.21/0.55 # Current number of unprocessed clauses: 0
% 0.21/0.55 # ...number of literals in the above : 0
% 0.21/0.55 # Current number of archived formulas : 0
% 0.21/0.55 # Current number of archived clauses : 0
% 0.21/0.55 # Clause-clause subsumption calls (NU) : 1678
% 0.21/0.55 # Rec. Clause-clause subsumption calls : 1089
% 0.21/0.55 # Non-unit clause-clause subsumptions : 0
% 0.21/0.55 # Unit Clause-clause subsumption calls : 16
% 0.21/0.55 # Rewrite failures with RHS unbound : 0
% 0.21/0.55 # BW rewrite match attempts : 0
% 0.21/0.55 # BW rewrite match successes : 0
% 0.21/0.55 # Condensation attempts : 0
% 0.21/0.55 # Condensation successes : 0
% 0.21/0.55 # Termbank termtop insertions : 1969
% 0.21/0.55 # Search garbage collected termcells : 161
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.007 s
% 0.21/0.55 # System time : 0.003 s
% 0.21/0.55 # Total time : 0.011 s
% 0.21/0.55 # Maximum resident set size: 1788 pages
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.037 s
% 0.21/0.55 # System time : 0.011 s
% 0.21/0.55 # Total time : 0.048 s
% 0.21/0.55 # Maximum resident set size: 1744 pages
% 0.21/0.55 % E---3.1 exiting
% 0.21/0.55 % E exiting
%------------------------------------------------------------------------------