TSTP Solution File: NLP126-10 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NLP126-10 : TPTP v8.1.2. Released v7.5.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:44:37 EDT 2023
% Result : Satisfiable 0.21s 0.52s
% Output : Saturation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named goal)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_56,axiom,
ifeq2(street(X1,X2),true,way(X1,X2),true) = true,
clause8,
[final] ).
cnf(c_0_57,negated_conjecture,
street(skc5,skc9) = true,
clause37,
[final] ).
cnf(c_0_58,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom_001,
[final] ).
cnf(c_0_59,axiom,
ifeq2(way(X1,X2),true,artifact(X1,X2),true) = true,
clause9,
[final] ).
cnf(c_0_60,negated_conjecture,
way(skc5,skc9) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),
[final] ).
cnf(c_0_61,axiom,
ifeq2(chevy(X1,X2),true,car(X1,X2),true) = true,
clause28,
[final] ).
cnf(c_0_62,negated_conjecture,
chevy(skc5,skc7) = true,
clause41,
[final] ).
cnf(c_0_63,axiom,
ifeq2(artifact(X1,X2),true,object(X1,X2),true) = true,
clause10,
[final] ).
cnf(c_0_64,negated_conjecture,
artifact(skc5,skc9) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_58]),
[final] ).
cnf(c_0_65,axiom,
ifeq2(city(X1,X2),true,location(X1,X2),true) = true,
clause26,
[final] ).
cnf(c_0_66,negated_conjecture,
city(skc5,skc7) = true,
clause40,
[final] ).
cnf(c_0_67,axiom,
ifeq2(placename(X1,X2),true,relname(X1,X2),true) = true,
clause18,
[final] ).
cnf(c_0_68,negated_conjecture,
placename(skc5,skc8) = true,
clause38,
[final] ).
cnf(c_0_69,axiom,
ifeq2(car(X1,X2),true,vehicle(X1,X2),true) = true,
clause29,
[final] ).
cnf(c_0_70,negated_conjecture,
car(skc5,skc7) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_58]),
[final] ).
cnf(c_0_71,axiom,
ifeq2(object(X1,X2),true,entity(X1,X2),true) = true,
clause11,
[final] ).
cnf(c_0_72,negated_conjecture,
object(skc5,skc9) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_58]),
[final] ).
cnf(c_0_73,axiom,
ifeq2(location(X1,X2),true,object(X1,X2),true) = true,
clause27,
[final] ).
cnf(c_0_74,negated_conjecture,
location(skc5,skc7) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_58]),
[final] ).
cnf(c_0_75,axiom,
ifeq2(relname(X1,X2),true,relation(X1,X2),true) = true,
clause19,
[final] ).
cnf(c_0_76,negated_conjecture,
relname(skc5,skc8) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_58]),
[final] ).
cnf(c_0_77,axiom,
ifeq2(vehicle(X1,X2),true,transport(X1,X2),true) = true,
clause30,
[final] ).
cnf(c_0_78,negated_conjecture,
vehicle(skc5,skc7) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_58]),
[final] ).
cnf(c_0_79,axiom,
ifeq3(of(X1,X2,X3),true,ifeq3(of(X1,X4,X3),true,ifeq3(placename(X1,X2),true,ifeq3(placename(X1,X4),true,ifeq3(entity(X1,X3),true,X2,X4),X4),X4),X4),X4) = X4,
clause35,
[final] ).
cnf(c_0_80,negated_conjecture,
entity(skc5,skc9) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_58]),
[final] ).
cnf(c_0_81,axiom,
ifeq3(X1,X1,X2,X3) = X2,
ifeq_axiom,
[final] ).
cnf(c_0_82,negated_conjecture,
object(skc5,skc7) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_58]),
[final] ).
cnf(c_0_83,axiom,
ifeq2(relation(X1,X2),true,abstraction(X1,X2),true) = true,
clause20,
[final] ).
cnf(c_0_84,negated_conjecture,
relation(skc5,skc8) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_58]),
[final] ).
cnf(c_0_85,axiom,
ifeq2(event(X1,X2),true,eventuality(X1,X2),true) = true,
clause2,
[final] ).
cnf(c_0_86,negated_conjecture,
event(skc5,skc6) = true,
clause48,
[final] ).
cnf(c_0_87,axiom,
ifeq2(transport(X1,X2),true,instrumentality(X1,X2),true) = true,
clause31,
[final] ).
cnf(c_0_88,negated_conjecture,
transport(skc5,skc7) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_58]),
[final] ).
cnf(c_0_89,negated_conjecture,
ifeq3(of(skc5,X1,skc9),true,ifeq3(of(skc5,X2,skc9),true,ifeq3(placename(skc5,X1),true,ifeq3(placename(skc5,X2),true,X1,X2),X2),X2),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]),
[final] ).
cnf(c_0_90,axiom,
ifeq2(entity(X1,X2),true,existent(X1,X2),true) = true,
clause14,
[final] ).
cnf(c_0_91,negated_conjecture,
entity(skc5,skc7) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_82]),c_0_58]),
[final] ).
cnf(c_0_92,axiom,
ifeq2(entity(X1,X2),true,specific(X1,X2),true) = true,
clause13,
[final] ).
cnf(c_0_93,axiom,
ifeq2(abstraction(X1,X2),true,general(X1,X2),true) = true,
clause23,
[final] ).
cnf(c_0_94,negated_conjecture,
abstraction(skc5,skc8) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_58]),
[final] ).
cnf(c_0_95,axiom,
ifeq2(eventuality(X1,X2),true,nonexistent(X1,X2),true) = true,
clause6,
[final] ).
cnf(c_0_96,negated_conjecture,
eventuality(skc5,skc6) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_58]),
[final] ).
cnf(c_0_97,axiom,
ifeq2(instrumentality(X1,X2),true,artifact(X1,X2),true) = true,
clause32,
[final] ).
cnf(c_0_98,negated_conjecture,
instrumentality(skc5,skc7) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_58]),
[final] ).
cnf(c_0_99,axiom,
ifeq2(object(X1,X2),true,unisex(X1,X2),true) = true,
clause17,
[final] ).
cnf(c_0_100,axiom,
ifeq2(eventuality(X1,X2),true,specific(X1,X2),true) = true,
clause5,
[final] ).
cnf(c_0_101,axiom,
ifeq2(abstraction(X1,X2),true,unisex(X1,X2),true) = true,
clause24,
[final] ).
cnf(c_0_102,axiom,
ifeq2(abstraction(X1,X2),true,thing(X1,X2),true) = true,
clause21,
[final] ).
cnf(c_0_103,axiom,
ifeq2(eventuality(X1,X2),true,thing(X1,X2),true) = true,
clause3,
[final] ).
cnf(c_0_104,axiom,
ifeq2(entity(X1,X2),true,thing(X1,X2),true) = true,
clause12,
[final] ).
cnf(c_0_105,axiom,
ifeq2(eventuality(X1,X2),true,unisex(X1,X2),true) = true,
clause7,
[final] ).
cnf(c_0_106,negated_conjecture,
ifeq3(of(skc5,X1,X2),true,ifeq3(of(skc5,skc8,X2),true,ifeq3(placename(skc5,X1),true,ifeq3(entity(skc5,X2),true,X1,skc8),skc8),skc8),skc8) = skc8,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_68]),c_0_81]),
[final] ).
cnf(c_0_107,negated_conjecture,
ifeq3(of(skc5,skc8,skc9),true,ifeq3(of(skc5,X1,skc9),true,ifeq3(placename(skc5,X1),true,skc8,X1),X1),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_68]),c_0_81]),
[final] ).
cnf(c_0_108,negated_conjecture,
of(skc5,skc8,skc7) = true,
clause49,
[final] ).
cnf(c_0_109,axiom,
ifeq(tuple(nonexistent(X1,X2),existent(X1,X2)),tuple(true,true),a,b) = b,
clause34,
[final] ).
cnf(c_0_110,negated_conjecture,
existent(skc5,skc7) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_58]),
[final] ).
cnf(c_0_111,axiom,
ifeq(tuple(specific(X1,X2),general(X1,X2)),tuple(true,true),a,b) = b,
clause33,
[final] ).
cnf(c_0_112,negated_conjecture,
specific(skc5,skc7) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_91]),c_0_58]),
[final] ).
cnf(c_0_113,negated_conjecture,
general(skc5,skc8) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_58]),
[final] ).
cnf(c_0_114,negated_conjecture,
nonexistent(skc5,skc6) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_58]),
[final] ).
cnf(c_0_115,negated_conjecture,
existent(skc5,skc9) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_80]),c_0_58]),
[final] ).
cnf(c_0_116,negated_conjecture,
specific(skc5,skc9) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_80]),c_0_58]),
[final] ).
cnf(c_0_117,negated_conjecture,
artifact(skc5,skc7) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_58]),
[final] ).
cnf(c_0_118,negated_conjecture,
unisex(skc5,skc7) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_82]),c_0_58]),
[final] ).
cnf(c_0_119,negated_conjecture,
specific(skc5,skc6) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_96]),c_0_58]),
[final] ).
cnf(c_0_120,negated_conjecture,
unisex(skc5,skc8) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_94]),c_0_58]),
[final] ).
cnf(c_0_121,negated_conjecture,
thing(skc5,skc8) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_94]),c_0_58]),
[final] ).
cnf(c_0_122,negated_conjecture,
unisex(skc5,skc9) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_72]),c_0_58]),
[final] ).
cnf(c_0_123,negated_conjecture,
thing(skc5,skc6) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_96]),c_0_58]),
[final] ).
cnf(c_0_124,axiom,
ifeq2(thing(X1,X2),true,singleton(X1,X2),true) = true,
clause4,
[final] ).
cnf(c_0_125,negated_conjecture,
thing(skc5,skc7) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_91]),c_0_58]),
[final] ).
cnf(c_0_126,negated_conjecture,
unisex(skc5,skc6) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_96]),c_0_58]),
[final] ).
cnf(c_0_127,axiom,
ifeq2(object(X1,X2),true,impartial(X1,X2),true) = true,
clause16,
[final] ).
cnf(c_0_128,axiom,
ifeq2(object(X1,X2),true,nonliving(X1,X2),true) = true,
clause15,
[final] ).
cnf(c_0_129,axiom,
ifeq2(abstraction(X1,X2),true,nonhuman(X1,X2),true) = true,
clause22,
[final] ).
cnf(c_0_130,negated_conjecture,
thing(skc5,skc9) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_80]),c_0_58]),
[final] ).
cnf(c_0_131,negated_conjecture,
a != b,
goal,
[final] ).
cnf(c_0_132,negated_conjecture,
ifeq3(of(skc5,skc8,X1),true,ifeq3(of(skc5,X2,X1),true,ifeq3(placename(skc5,X2),true,ifeq3(entity(skc5,X1),true,skc8,X2),X2),X2),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_68]),c_0_81]),
[final] ).
cnf(c_0_133,negated_conjecture,
ifeq3(of(skc5,X1,skc7),true,ifeq3(of(skc5,X2,skc7),true,ifeq3(placename(skc5,X1),true,ifeq3(placename(skc5,X2),true,X1,X2),X2),X2),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_91]),c_0_81]),
[final] ).
cnf(c_0_134,negated_conjecture,
ifeq3(of(skc5,skc8,X1),true,ifeq3(of(skc5,skc8,X1),true,ifeq3(entity(skc5,X1),true,skc8,skc8),skc8),skc8) = skc8,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_68]),c_0_81]),
[final] ).
cnf(c_0_135,negated_conjecture,
ifeq3(of(skc5,X1,skc9),true,ifeq3(of(skc5,skc8,skc9),true,ifeq3(placename(skc5,X1),true,X1,skc8),skc8),skc8) = skc8,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_68]),c_0_81]),
[final] ).
cnf(c_0_136,negated_conjecture,
ifeq3(of(skc5,skc8,skc9),true,ifeq3(of(skc5,skc8,skc9),true,skc8,skc8),skc8) = skc8,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_68]),c_0_81]),
[final] ).
cnf(c_0_137,negated_conjecture,
ifeq3(of(skc5,X1,skc7),true,ifeq3(placename(skc5,X1),true,X1,skc8),skc8) = skc8,
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_79,c_0_108]),c_0_68]),c_0_81]),c_0_81]),c_0_91]),c_0_81]),
[final] ).
cnf(c_0_138,negated_conjecture,
ifeq3(of(skc5,X1,skc7),true,ifeq3(placename(skc5,X1),true,skc8,X1),X1) = X1,
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_79,c_0_108]),c_0_68]),c_0_81]),c_0_81]),c_0_91]),c_0_81]),
[final] ).
cnf(c_0_139,negated_conjecture,
ifeq(tuple(nonexistent(skc5,skc7),true),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_109,c_0_110]),
[final] ).
cnf(c_0_140,negated_conjecture,
ifeq(tuple(true,general(skc5,skc7)),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_111,c_0_112]),
[final] ).
cnf(c_0_141,negated_conjecture,
ifeq(tuple(specific(skc5,skc8),true),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_111,c_0_113]),
[final] ).
cnf(c_0_142,negated_conjecture,
ifeq(tuple(true,existent(skc5,skc6)),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_109,c_0_114]),
[final] ).
cnf(c_0_143,negated_conjecture,
ifeq(tuple(nonexistent(skc5,skc9),true),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_109,c_0_115]),
[final] ).
cnf(c_0_144,negated_conjecture,
ifeq(tuple(true,general(skc5,skc9)),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_111,c_0_116]),
[final] ).
cnf(c_0_145,negated_conjecture,
ifeq2(way(skc5,skc7),true,true,true) = true,
inference(spm,[status(thm)],[c_0_59,c_0_117]),
[final] ).
cnf(c_0_146,negated_conjecture,
ifeq2(abstraction(skc5,skc7),true,true,true) = true,
inference(spm,[status(thm)],[c_0_101,c_0_118]),
[final] ).
cnf(c_0_147,negated_conjecture,
ifeq(tuple(true,general(skc5,skc6)),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_111,c_0_119]),
[final] ).
cnf(c_0_148,negated_conjecture,
ifeq2(eventuality(skc5,skc7),true,true,true) = true,
inference(spm,[status(thm)],[c_0_105,c_0_118]),
[final] ).
cnf(c_0_149,negated_conjecture,
ifeq2(object(skc5,skc8),true,true,true) = true,
inference(spm,[status(thm)],[c_0_99,c_0_120]),
[final] ).
cnf(c_0_150,negated_conjecture,
ifeq2(entity(skc5,skc8),true,true,true) = true,
inference(spm,[status(thm)],[c_0_104,c_0_121]),
[final] ).
cnf(c_0_151,negated_conjecture,
ifeq2(eventuality(skc5,skc8),true,true,true) = true,
inference(spm,[status(thm)],[c_0_103,c_0_121]),
[final] ).
cnf(c_0_152,negated_conjecture,
ifeq2(instrumentality(skc5,skc9),true,true,true) = true,
inference(spm,[status(thm)],[c_0_97,c_0_64]),
[final] ).
cnf(c_0_153,negated_conjecture,
ifeq2(location(skc5,skc9),true,true,true) = true,
inference(spm,[status(thm)],[c_0_73,c_0_72]),
[final] ).
cnf(c_0_154,negated_conjecture,
ifeq2(abstraction(skc5,skc9),true,true,true) = true,
inference(spm,[status(thm)],[c_0_101,c_0_122]),
[final] ).
cnf(c_0_155,negated_conjecture,
ifeq2(abstraction(skc5,skc6),true,true,true) = true,
inference(spm,[status(thm)],[c_0_102,c_0_123]),
[final] ).
cnf(c_0_156,negated_conjecture,
ifeq2(eventuality(skc5,skc9),true,true,true) = true,
inference(spm,[status(thm)],[c_0_105,c_0_122]),
[final] ).
cnf(c_0_157,negated_conjecture,
ifeq2(entity(skc5,skc6),true,true,true) = true,
inference(spm,[status(thm)],[c_0_104,c_0_123]),
[final] ).
cnf(c_0_158,negated_conjecture,
singleton(skc5,skc7) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_58]),
[final] ).
cnf(c_0_159,negated_conjecture,
ifeq2(object(skc5,skc6),true,true,true) = true,
inference(spm,[status(thm)],[c_0_99,c_0_126]),
[final] ).
cnf(c_0_160,negated_conjecture,
singleton(skc5,skc8) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_121]),c_0_58]),
[final] ).
cnf(c_0_161,negated_conjecture,
impartial(skc5,skc7) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_82]),c_0_58]),
[final] ).
cnf(c_0_162,negated_conjecture,
nonliving(skc5,skc7) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_82]),c_0_58]),
[final] ).
cnf(c_0_163,negated_conjecture,
nonhuman(skc5,skc8) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_94]),c_0_58]),
[final] ).
cnf(c_0_164,negated_conjecture,
singleton(skc5,skc9) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_130]),c_0_58]),
[final] ).
cnf(c_0_165,negated_conjecture,
impartial(skc5,skc9) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_72]),c_0_58]),
[final] ).
cnf(c_0_166,negated_conjecture,
nonliving(skc5,skc9) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_72]),c_0_58]),
[final] ).
cnf(c_0_167,negated_conjecture,
singleton(skc5,skc6) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_123]),c_0_58]),
[final] ).
cnf(c_0_168,axiom,
ifeq2(hollywood_placename(X1,X2),true,placename(X1,X2),true) = true,
clause25,
[final] ).
cnf(c_0_169,axiom,
ifeq2(barrel(X1,X2),true,event(X1,X2),true) = true,
clause1,
[final] ).
cnf(c_0_170,negated_conjecture,
down(skc5,skc6,skc9) = true,
clause52,
[final] ).
cnf(c_0_171,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_002,
[final] ).
cnf(c_0_172,negated_conjecture,
in(skc5,skc6,skc7) = true,
clause51,
[final] ).
cnf(c_0_173,negated_conjecture,
agent(skc5,skc6,skc7) = true,
clause50,
[final] ).
cnf(c_0_174,negated_conjecture,
present(skc5,skc6) = true,
clause47,
[final] ).
cnf(c_0_175,negated_conjecture,
lonely(skc5,skc9) = true,
clause45,
[final] ).
cnf(c_0_176,negated_conjecture,
old(skc5,skc7) = true,
clause44,
[final] ).
cnf(c_0_177,negated_conjecture,
dirty(skc5,skc7) = true,
clause43,
[final] ).
cnf(c_0_178,negated_conjecture,
white(skc5,skc7) = true,
clause42,
[final] ).
cnf(c_0_179,negated_conjecture,
hollywood_placename(skc5,skc8) = true,
clause39,
[final] ).
cnf(c_0_180,negated_conjecture,
barrel(skc5,skc6) = true,
clause46,
[final] ).
cnf(c_0_181,negated_conjecture,
actual_world(skc5) = true,
clause36,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NLP126-10 : TPTP v8.1.2. Released v7.5.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n018.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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 11:14:53 EDT 2023
% 0.20/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.frNqybCSlw/E---3.1_22817.p
% 0.21/0.52 # Version: 3.1pre001
% 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 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 23036 completed with status 1
% 0.21/0.52 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 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 # No SInE strategy applied
% 0.21/0.52 # Search class: FUUPM-FFMM32-DFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.52 # Starting sh5l with 136s (1) cores
% 0.21/0.52 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 23040 completed with status 1
% 0.21/0.52 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 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 # No SInE strategy applied
% 0.21/0.52 # Search class: FUUPM-FFMM32-DFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (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 : 56
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 56
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 56
% 0.21/0.52 # Processed clauses : 192
% 0.21/0.52 # ...of these trivial : 10
% 0.21/0.52 # ...subsumed : 0
% 0.21/0.52 # ...remaining for further processing : 182
% 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 : 0
% 0.21/0.52 # Backward-rewritten : 0
% 0.21/0.52 # Generated clauses : 147
% 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 : 0
% 0.21/0.52 # Paramodulations : 147
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Total rewrite steps : 240
% 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 : 126
% 0.21/0.52 # Positive orientable unit clauses : 125
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 1
% 0.21/0.52 # Non-unit-clauses : 0
% 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 : 56
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.52 # Non-unit clause-clause subsumptions : 0
% 0.21/0.52 # Unit Clause-clause subsumption calls : 0
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 96
% 0.21/0.52 # BW rewrite match successes : 0
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 3534
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.008 s
% 0.21/0.52 # System time : 0.005 s
% 0.21/0.52 # Total time : 0.013 s
% 0.21/0.52 # Maximum resident set size: 1696 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.041 s
% 0.21/0.52 # System time : 0.023 s
% 0.21/0.52 # Total time : 0.064 s
% 0.21/0.52 # Maximum resident set size: 1728 pages
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------