TSTP Solution File: NLP231-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NLP231-1 : TPTP v8.1.2. Released v2.4.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:45:21 EDT 2023
% Result : Satisfiable 0.19s 0.52s
% Output : Saturation 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause71)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_84,negated_conjecture,
( ssSkC0
| man(X2,skf11(X2))
| ~ accessible_world(X1,X2)
| ~ proposition(X1,X2)
| ~ theme(X1,X3,X2)
| ~ event(X1,X3)
| ~ present(X1,X3)
| ~ think_believe_consider(X1,X3)
| ~ forename(X1,X4)
| ~ vincent_forename(X1,X4)
| ~ of(X1,X4,X5)
| ~ man(X1,X5)
| ~ agent(X1,X3,X5)
| ~ state(X1,X6)
| ~ be(X1,X6,X7,X7)
| ~ man(X1,X7)
| ~ of(X1,X8,X7)
| ~ jules_forename(X1,X8)
| ~ forename(X1,X8)
| ~ proposition(X1,X9)
| ~ accessible_world(X1,X9)
| ~ forename(X1,X10)
| ~ vincent_forename(X1,X10)
| ~ of(X1,X10,X11)
| ~ man(X1,X11)
| ~ agent(X1,X12,X11)
| ~ smoke(X9,X13)
| ~ present(X9,X13)
| ~ agent(X9,X13,X11)
| ~ event(X9,X13)
| ~ forename(X1,X14)
| ~ jules_forename(X1,X14)
| ~ of(X1,X14,X11)
| ~ think_believe_consider(X1,X12)
| ~ present(X1,X12)
| ~ event(X1,X12)
| ~ theme(X1,X12,X9)
| ~ actual_world(X1) ),
clause82,
[final] ).
cnf(c_0_85,negated_conjecture,
( ssSkC0
| be(skc45,skc50,skc51,skc51) ),
clause71,
[final] ).
cnf(c_0_86,negated_conjecture,
actual_world(skc45),
clause1,
[final] ).
cnf(c_0_87,negated_conjecture,
( ssSkC0
| man(skc45,skc51) ),
clause17,
[final] ).
cnf(c_0_88,negated_conjecture,
( ssSkC0
| state(skc45,skc50) ),
clause11,
[final] ).
cnf(c_0_90,negated_conjecture,
( ssSkC0
| of(skc45,skc52,skc51) ),
clause58,
[final] ).
cnf(c_0_91,negated_conjecture,
( ssSkC0
| forename(skc45,skc52) ),
clause19,
[final] ).
cnf(c_0_92,negated_conjecture,
( ssSkC0
| jules_forename(skc45,skc52) ),
clause18,
[final] ).
cnf(c_0_93,negated_conjecture,
( man(X2,skf7(X2))
| ~ accessible_world(X1,X2)
| ~ proposition(X1,X2)
| ~ theme(X1,X3,X2)
| ~ event(X1,X3)
| ~ present(X1,X3)
| ~ think_believe_consider(X1,X3)
| ~ forename(X1,X4)
| ~ vincent_forename(X1,X4)
| ~ of(X1,X4,X5)
| ~ man(X1,X5)
| ~ agent(X1,X3,X5)
| ~ state(X1,X6)
| ~ smoke(X7,X8)
| ~ present(X7,X8)
| ~ agent(X7,X8,X9)
| ~ event(X7,X8)
| ~ be(X1,X6,X9,X9)
| ~ man(X1,X9)
| ~ of(X1,X10,X9)
| ~ jules_forename(X1,X10)
| ~ forename(X1,X10)
| ~ proposition(X1,X7)
| ~ accessible_world(X1,X7)
| ~ think_believe_consider(X1,X11)
| ~ present(X1,X11)
| ~ event(X1,X11)
| ~ theme(X1,X11,X7)
| ~ vincent_forename(X1,X12)
| ~ forename(X1,X12)
| ~ agent(X1,X11,X13)
| ~ man(X1,X13)
| ~ of(X1,X12,X13)
| ~ actual_world(X1)
| ~ ssSkC0 ),
clause81,
[final] ).
cnf(c_0_94,negated_conjecture,
( be(skc28,skc35,skc36,skc36)
| ~ ssSkC0 ),
clause72,
[final] ).
cnf(c_0_95,negated_conjecture,
actual_world(skc28),
clause2,
[final] ).
cnf(c_0_96,negated_conjecture,
( man(skc28,skc36)
| ~ ssSkC0 ),
clause37,
[final] ).
cnf(c_0_97,negated_conjecture,
( state(skc28,skc35)
| ~ ssSkC0 ),
clause36,
[final] ).
cnf(c_0_98,negated_conjecture,
( man(X1,skf11(X1))
| ssSkC0
| ~ agent(skc45,X2,X3)
| ~ agent(skc45,X4,X5)
| ~ agent(X6,X7,X3)
| ~ of(skc45,X8,X3)
| ~ of(skc45,X9,X3)
| ~ of(skc45,X10,X5)
| ~ theme(skc45,X2,X6)
| ~ theme(skc45,X4,X1)
| ~ smoke(X6,X7)
| ~ jules_forename(skc45,X8)
| ~ man(skc45,X3)
| ~ man(skc45,X5)
| ~ vincent_forename(skc45,X9)
| ~ vincent_forename(skc45,X10)
| ~ forename(skc45,X8)
| ~ forename(skc45,X9)
| ~ forename(skc45,X10)
| ~ think_believe_consider(skc45,X2)
| ~ think_believe_consider(skc45,X4)
| ~ present(skc45,X2)
| ~ present(skc45,X4)
| ~ present(X6,X7)
| ~ event(skc45,X2)
| ~ event(skc45,X4)
| ~ event(X6,X7)
| ~ proposition(skc45,X6)
| ~ proposition(skc45,X1)
| ~ accessible_world(skc45,X6)
| ~ accessible_world(skc45,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91]),c_0_92]),
[final] ).
cnf(c_0_99,negated_conjecture,
( ssSkC0
| agent(skc45,skc56,skc58) ),
clause55,
[final] ).
cnf(c_0_100,negated_conjecture,
( ssSkC0
| event(skc45,skc56) ),
clause5,
[final] ).
cnf(c_0_101,negated_conjecture,
( ssSkC0
| present(skc45,skc56) ),
clause6,
[final] ).
cnf(c_0_102,negated_conjecture,
( ssSkC0
| think_believe_consider(skc45,skc56) ),
clause7,
[final] ).
cnf(c_0_103,negated_conjecture,
( ssSkC0
| man(skc45,skc58) ),
clause10,
[final] ).
cnf(c_0_104,negated_conjecture,
( ssSkC0
| agent(skc45,skc47,skc49) ),
clause60,
[final] ).
cnf(c_0_105,negated_conjecture,
( ssSkC0
| event(skc45,skc47) ),
clause24,
[final] ).
cnf(c_0_106,negated_conjecture,
( ssSkC0
| present(skc45,skc47) ),
clause23,
[final] ).
cnf(c_0_107,negated_conjecture,
( ssSkC0
| think_believe_consider(skc45,skc47) ),
clause22,
[final] ).
cnf(c_0_108,negated_conjecture,
( ssSkC0
| man(skc45,skc49) ),
clause27,
[final] ).
cnf(c_0_110,negated_conjecture,
( of(skc28,skc37,skc36)
| ~ ssSkC0 ),
clause65,
[final] ).
cnf(c_0_111,negated_conjecture,
( forename(skc28,skc37)
| ~ ssSkC0 ),
clause39,
[final] ).
cnf(c_0_112,negated_conjecture,
( jules_forename(skc28,skc37)
| ~ ssSkC0 ),
clause38,
[final] ).
cnf(c_0_113,negated_conjecture,
( ssSkC0
| ~ smoke(X1,X2)
| ~ present(X1,X2)
| ~ agent(X1,X2,skf11(X1))
| ~ event(X1,X2)
| ~ accessible_world(X3,X1)
| ~ proposition(X3,X1)
| ~ theme(X3,X4,X1)
| ~ event(X3,X4)
| ~ present(X3,X4)
| ~ think_believe_consider(X3,X4)
| ~ forename(X3,X5)
| ~ vincent_forename(X3,X5)
| ~ of(X3,X5,X6)
| ~ man(X3,X6)
| ~ agent(X3,X4,X6)
| ~ state(X3,X7)
| ~ be(X3,X7,X8,X8)
| ~ man(X3,X8)
| ~ of(X3,X9,X8)
| ~ jules_forename(X3,X9)
| ~ forename(X3,X9)
| ~ proposition(X3,X10)
| ~ accessible_world(X3,X10)
| ~ forename(X3,X11)
| ~ vincent_forename(X3,X11)
| ~ of(X3,X11,X12)
| ~ man(X3,X12)
| ~ agent(X3,X13,X12)
| ~ smoke(X10,X14)
| ~ present(X10,X14)
| ~ agent(X10,X14,X12)
| ~ event(X10,X14)
| ~ forename(X3,X15)
| ~ jules_forename(X3,X15)
| ~ of(X3,X15,X12)
| ~ think_believe_consider(X3,X13)
| ~ present(X3,X13)
| ~ event(X3,X13)
| ~ theme(X3,X13,X10)
| ~ actual_world(X3) ),
clause84,
[final] ).
cnf(c_0_114,negated_conjecture,
( ssSkC0
| agent(skc55,skf9(X1),X1)
| ~ man(skc55,X1) ),
clause79,
[final] ).
cnf(c_0_115,negated_conjecture,
( ssSkC0
| event(skc55,skf9(X2))
| ~ man(skc55,X1) ),
clause73,
[final] ).
cnf(c_0_116,negated_conjecture,
( ssSkC0
| present(skc55,skf9(X2))
| ~ man(skc55,X1) ),
clause74,
[final] ).
cnf(c_0_117,negated_conjecture,
( ~ smoke(X1,X2)
| ~ present(X1,X2)
| ~ agent(X1,X2,skf7(X1))
| ~ event(X1,X2)
| ~ accessible_world(X3,X1)
| ~ proposition(X3,X1)
| ~ theme(X3,X4,X1)
| ~ event(X3,X4)
| ~ present(X3,X4)
| ~ think_believe_consider(X3,X4)
| ~ forename(X3,X5)
| ~ vincent_forename(X3,X5)
| ~ of(X3,X5,X6)
| ~ man(X3,X6)
| ~ agent(X3,X4,X6)
| ~ state(X3,X7)
| ~ smoke(X8,X9)
| ~ present(X8,X9)
| ~ agent(X8,X9,X10)
| ~ event(X8,X9)
| ~ be(X3,X7,X10,X10)
| ~ man(X3,X10)
| ~ of(X3,X11,X10)
| ~ jules_forename(X3,X11)
| ~ forename(X3,X11)
| ~ proposition(X3,X8)
| ~ accessible_world(X3,X8)
| ~ think_believe_consider(X3,X12)
| ~ present(X3,X12)
| ~ event(X3,X12)
| ~ theme(X3,X12,X8)
| ~ vincent_forename(X3,X13)
| ~ forename(X3,X13)
| ~ agent(X3,X12,X14)
| ~ man(X3,X14)
| ~ of(X3,X13,X14)
| ~ actual_world(X3)
| ~ ssSkC0 ),
clause83,
[final] ).
cnf(c_0_118,negated_conjecture,
( agent(skc38,skf5(X1),X1)
| ~ man(skc38,X1)
| ~ ssSkC0 ),
clause80,
[final] ).
cnf(c_0_119,negated_conjecture,
( event(skc38,skf5(X2))
| ~ man(skc38,X1)
| ~ ssSkC0 ),
clause76,
[final] ).
cnf(c_0_120,negated_conjecture,
( present(skc38,skf5(X2))
| ~ man(skc38,X1)
| ~ ssSkC0 ),
clause77,
[final] ).
cnf(c_0_121,negated_conjecture,
( man(X1,skf11(X1))
| ssSkC0
| ~ agent(skc45,X2,X3)
| ~ agent(X4,X5,skc58)
| ~ of(skc45,X6,skc58)
| ~ of(skc45,X7,skc58)
| ~ of(skc45,X8,X3)
| ~ theme(skc45,skc56,X4)
| ~ theme(skc45,X2,X1)
| ~ smoke(X4,X5)
| ~ jules_forename(skc45,X6)
| ~ man(skc45,X3)
| ~ vincent_forename(skc45,X7)
| ~ vincent_forename(skc45,X8)
| ~ forename(skc45,X6)
| ~ forename(skc45,X7)
| ~ forename(skc45,X8)
| ~ think_believe_consider(skc45,X2)
| ~ present(skc45,X2)
| ~ present(X4,X5)
| ~ event(skc45,X2)
| ~ event(X4,X5)
| ~ proposition(skc45,X4)
| ~ proposition(skc45,X1)
| ~ accessible_world(skc45,X4)
| ~ accessible_world(skc45,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100]),c_0_101]),c_0_102]),c_0_103]),
[final] ).
cnf(c_0_122,negated_conjecture,
( ssSkC0
| of(skc45,skc57,skc58) ),
clause54,
[final] ).
cnf(c_0_123,negated_conjecture,
( ssSkC0
| forename(skc45,skc57) ),
clause8,
[final] ).
cnf(c_0_124,negated_conjecture,
( man(X1,skf11(X1))
| ssSkC0
| ~ agent(skc45,X2,X3)
| ~ agent(X4,X5,skc49)
| ~ of(skc45,X6,skc49)
| ~ of(skc45,X7,skc49)
| ~ of(skc45,X8,X3)
| ~ theme(skc45,skc47,X4)
| ~ theme(skc45,X2,X1)
| ~ smoke(X4,X5)
| ~ jules_forename(skc45,X6)
| ~ man(skc45,X3)
| ~ vincent_forename(skc45,X7)
| ~ vincent_forename(skc45,X8)
| ~ forename(skc45,X6)
| ~ forename(skc45,X7)
| ~ forename(skc45,X8)
| ~ think_believe_consider(skc45,X2)
| ~ present(skc45,X2)
| ~ present(X4,X5)
| ~ event(skc45,X2)
| ~ event(X4,X5)
| ~ proposition(skc45,X4)
| ~ proposition(skc45,X1)
| ~ accessible_world(skc45,X4)
| ~ accessible_world(skc45,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_104]),c_0_105]),c_0_106]),c_0_107]),c_0_108]),
[final] ).
cnf(c_0_125,negated_conjecture,
( ssSkC0
| of(skc45,skc48,skc49) ),
clause61,
[final] ).
cnf(c_0_126,negated_conjecture,
( ssSkC0
| forename(skc45,skc48) ),
clause26,
[final] ).
cnf(c_0_127,negated_conjecture,
( man(X1,skf7(X1))
| ~ agent(X2,X3,skc36)
| ~ agent(skc28,X4,X5)
| ~ agent(skc28,X6,X7)
| ~ of(skc28,X8,X5)
| ~ of(skc28,X9,X7)
| ~ theme(skc28,X4,X2)
| ~ theme(skc28,X6,X1)
| ~ smoke(X2,X3)
| ~ man(skc28,X5)
| ~ man(skc28,X7)
| ~ vincent_forename(skc28,X8)
| ~ vincent_forename(skc28,X9)
| ~ forename(skc28,X8)
| ~ forename(skc28,X9)
| ~ think_believe_consider(skc28,X4)
| ~ think_believe_consider(skc28,X6)
| ~ present(skc28,X4)
| ~ present(skc28,X6)
| ~ present(X2,X3)
| ~ event(skc28,X4)
| ~ event(skc28,X6)
| ~ event(X2,X3)
| ~ proposition(skc28,X2)
| ~ proposition(skc28,X1)
| ~ accessible_world(skc28,X2)
| ~ accessible_world(skc28,X1)
| ~ ssSkC0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111]),c_0_112]),
[final] ).
cnf(c_0_128,negated_conjecture,
( accessible_world(skc28,skc38)
| ~ ssSkC0 ),
clause28,
[final] ).
cnf(c_0_129,negated_conjecture,
( proposition(skc28,skc38)
| ~ ssSkC0 ),
clause29,
[final] ).
cnf(c_0_130,negated_conjecture,
( smoke(skc38,skf5(X2))
| ~ man(skc38,X1)
| ~ ssSkC0 ),
clause78,
[final] ).
cnf(c_0_131,negated_conjecture,
( ssSkC0
| ~ be(X1,X2,X3,X3)
| ~ agent(X4,X5,X6)
| ~ agent(X1,X7,X6)
| ~ agent(X1,X8,X9)
| ~ of(X1,X10,X6)
| ~ of(X1,X11,X6)
| ~ of(X1,X12,X3)
| ~ of(X1,X13,X9)
| ~ theme(X1,X8,skc55)
| ~ theme(X1,X7,X4)
| ~ smoke(skc55,skf9(skf11(skc55)))
| ~ smoke(X4,X5)
| ~ jules_forename(X1,X10)
| ~ jules_forename(X1,X12)
| ~ state(X1,X2)
| ~ man(X1,X6)
| ~ man(X1,X3)
| ~ man(X1,X9)
| ~ vincent_forename(X1,X11)
| ~ vincent_forename(X1,X13)
| ~ forename(X1,X10)
| ~ forename(X1,X11)
| ~ forename(X1,X12)
| ~ forename(X1,X13)
| ~ think_believe_consider(X1,X7)
| ~ think_believe_consider(X1,X8)
| ~ present(X4,X5)
| ~ present(X1,X7)
| ~ present(X1,X8)
| ~ event(X4,X5)
| ~ event(X1,X7)
| ~ event(X1,X8)
| ~ proposition(X1,skc55)
| ~ proposition(X1,X4)
| ~ accessible_world(X1,skc55)
| ~ accessible_world(X1,X4)
| ~ actual_world(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_115]),c_0_116]),c_0_84]),
[final] ).
cnf(c_0_132,negated_conjecture,
( ~ be(X1,X2,X3,X3)
| ~ agent(X4,X5,X3)
| ~ agent(X1,X6,X7)
| ~ agent(X1,X8,X9)
| ~ of(X1,X10,X7)
| ~ of(X1,X11,X3)
| ~ of(X1,X12,X9)
| ~ theme(X1,X8,skc38)
| ~ theme(X1,X6,X4)
| ~ smoke(skc38,skf5(skf7(skc38)))
| ~ smoke(X4,X5)
| ~ jules_forename(X1,X11)
| ~ state(X1,X2)
| ~ man(X1,X7)
| ~ man(X1,X3)
| ~ man(X1,X9)
| ~ vincent_forename(X1,X10)
| ~ vincent_forename(X1,X12)
| ~ forename(X1,X10)
| ~ forename(X1,X11)
| ~ forename(X1,X12)
| ~ think_believe_consider(X1,X6)
| ~ think_believe_consider(X1,X8)
| ~ present(X4,X5)
| ~ present(X1,X6)
| ~ present(X1,X8)
| ~ event(X4,X5)
| ~ event(X1,X6)
| ~ event(X1,X8)
| ~ proposition(X1,skc38)
| ~ proposition(X1,X4)
| ~ accessible_world(X1,skc38)
| ~ accessible_world(X1,X4)
| ~ ssSkC0
| ~ actual_world(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_119]),c_0_120]),c_0_93]),
[final] ).
cnf(c_0_133,negated_conjecture,
( man(X1,skf11(X1))
| ssSkC0
| ~ agent(skc45,X2,X3)
| ~ agent(X4,X5,skc58)
| ~ of(skc45,X6,skc58)
| ~ of(skc45,X7,X3)
| ~ theme(skc45,skc56,X4)
| ~ theme(skc45,X2,X1)
| ~ smoke(X4,X5)
| ~ jules_forename(skc45,skc57)
| ~ man(skc45,X3)
| ~ vincent_forename(skc45,X6)
| ~ vincent_forename(skc45,X7)
| ~ forename(skc45,X6)
| ~ forename(skc45,X7)
| ~ think_believe_consider(skc45,X2)
| ~ present(skc45,X2)
| ~ present(X4,X5)
| ~ event(skc45,X2)
| ~ event(X4,X5)
| ~ proposition(skc45,X4)
| ~ proposition(skc45,X1)
| ~ accessible_world(skc45,X4)
| ~ accessible_world(skc45,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_123]),
[final] ).
cnf(c_0_134,negated_conjecture,
( man(X1,skf11(X1))
| ssSkC0
| ~ agent(skc45,X2,X3)
| ~ agent(X4,X5,skc49)
| ~ of(skc45,X6,skc49)
| ~ of(skc45,X7,X3)
| ~ theme(skc45,skc47,X4)
| ~ theme(skc45,X2,X1)
| ~ smoke(X4,X5)
| ~ jules_forename(skc45,skc48)
| ~ man(skc45,X3)
| ~ vincent_forename(skc45,X6)
| ~ vincent_forename(skc45,X7)
| ~ forename(skc45,X6)
| ~ forename(skc45,X7)
| ~ think_believe_consider(skc45,X2)
| ~ present(skc45,X2)
| ~ present(X4,X5)
| ~ event(skc45,X2)
| ~ event(X4,X5)
| ~ proposition(skc45,X4)
| ~ proposition(skc45,X1)
| ~ accessible_world(skc45,X4)
| ~ accessible_world(skc45,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_126]),
[final] ).
cnf(c_0_135,negated_conjecture,
( man(X1,skf7(X1))
| ~ agent(skc28,X2,X3)
| ~ agent(skc28,X4,X5)
| ~ of(skc28,X6,X3)
| ~ of(skc28,X7,X5)
| ~ theme(skc28,X2,skc38)
| ~ theme(skc28,X4,X1)
| ~ man(skc38,skc36)
| ~ man(skc28,X3)
| ~ man(skc28,X5)
| ~ vincent_forename(skc28,X6)
| ~ vincent_forename(skc28,X7)
| ~ forename(skc28,X6)
| ~ forename(skc28,X7)
| ~ think_believe_consider(skc28,X2)
| ~ think_believe_consider(skc28,X4)
| ~ present(skc28,X2)
| ~ present(skc28,X4)
| ~ event(skc28,X2)
| ~ event(skc28,X4)
| ~ proposition(skc28,X1)
| ~ accessible_world(skc28,X1)
| ~ ssSkC0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_118]),c_0_128]),c_0_129]),c_0_119]),c_0_120]),c_0_130]),
[final] ).
cnf(c_0_136,negated_conjecture,
( ssSkC0
| smoke(skc55,skf9(X2))
| ~ man(skc55,X1) ),
clause75,
[final] ).
cnf(c_0_137,negated_conjecture,
( ssSkC0
| agent(skc46,skc53,skc51) ),
clause57,
[final] ).
cnf(c_0_138,negated_conjecture,
( ssSkC0
| of(skc45,skc54,skc51) ),
clause56,
[final] ).
cnf(c_0_139,negated_conjecture,
( ssSkC0
| theme(skc45,skc47,skc46) ),
clause59,
[final] ).
cnf(c_0_140,negated_conjecture,
( agent(skc29,skc34,skc32)
| ~ ssSkC0 ),
clause68,
[final] ).
cnf(c_0_141,negated_conjecture,
( agent(skc28,skc30,skc32)
| ~ ssSkC0 ),
clause67,
[final] ).
cnf(c_0_142,negated_conjecture,
( ssSkC0
| theme(skc45,skc56,skc55) ),
clause53,
[final] ).
cnf(c_0_143,negated_conjecture,
( agent(skc28,skc39,skc41)
| ~ ssSkC0 ),
clause64,
[final] ).
cnf(c_0_144,negated_conjecture,
( of(skc28,skc33,skc32)
| ~ ssSkC0 ),
clause69,
[final] ).
cnf(c_0_145,negated_conjecture,
( of(skc28,skc31,skc32)
| ~ ssSkC0 ),
clause66,
[final] ).
cnf(c_0_146,negated_conjecture,
( of(skc28,skc40,skc41)
| ~ ssSkC0 ),
clause63,
[final] ).
cnf(c_0_147,negated_conjecture,
( theme(skc28,skc30,skc29)
| ~ ssSkC0 ),
clause70,
[final] ).
cnf(c_0_148,negated_conjecture,
( theme(skc28,skc39,skc38)
| ~ ssSkC0 ),
clause62,
[final] ).
cnf(c_0_149,negated_conjecture,
( ssSkC0
| smoke(skc46,skc53) ),
clause14,
[final] ).
cnf(c_0_150,negated_conjecture,
( ssSkC0
| jules_forename(skc45,skc54) ),
clause13,
[final] ).
cnf(c_0_151,negated_conjecture,
( ssSkC0
| vincent_forename(skc45,skc48) ),
clause25,
[final] ).
cnf(c_0_152,negated_conjecture,
( ssSkC0
| vincent_forename(skc45,skc57) ),
clause9,
[final] ).
cnf(c_0_153,negated_conjecture,
( ssSkC0
| forename(skc45,skc54) ),
clause12,
[final] ).
cnf(c_0_154,negated_conjecture,
( ssSkC0
| present(skc46,skc53) ),
clause15,
[final] ).
cnf(c_0_155,negated_conjecture,
( smoke(skc29,skc34)
| ~ ssSkC0 ),
clause45,
[final] ).
cnf(c_0_156,negated_conjecture,
( jules_forename(skc28,skc33)
| ~ ssSkC0 ),
clause49,
[final] ).
cnf(c_0_157,negated_conjecture,
( ssSkC0
| event(skc46,skc53) ),
clause16,
[final] ).
cnf(c_0_158,negated_conjecture,
( man(skc28,skc32)
| ~ ssSkC0 ),
clause44,
[final] ).
cnf(c_0_159,negated_conjecture,
( man(skc28,skc41)
| ~ ssSkC0 ),
clause35,
[final] ).
cnf(c_0_160,negated_conjecture,
( vincent_forename(skc28,skc31)
| ~ ssSkC0 ),
clause43,
[final] ).
cnf(c_0_161,negated_conjecture,
( vincent_forename(skc28,skc40)
| ~ ssSkC0 ),
clause34,
[final] ).
cnf(c_0_162,negated_conjecture,
( forename(skc28,skc33)
| ~ ssSkC0 ),
clause48,
[final] ).
cnf(c_0_163,negated_conjecture,
( ssSkC0
| proposition(skc45,skc46) ),
clause20,
[final] ).
cnf(c_0_164,negated_conjecture,
( forename(skc28,skc31)
| ~ ssSkC0 ),
clause42,
[final] ).
cnf(c_0_165,negated_conjecture,
( forename(skc28,skc40)
| ~ ssSkC0 ),
clause33,
[final] ).
cnf(c_0_166,negated_conjecture,
( think_believe_consider(skc28,skc30)
| ~ ssSkC0 ),
clause50,
[final] ).
cnf(c_0_167,negated_conjecture,
( ssSkC0
| proposition(skc45,skc55) ),
clause4,
[final] ).
cnf(c_0_168,negated_conjecture,
( think_believe_consider(skc28,skc39)
| ~ ssSkC0 ),
clause32,
[final] ).
cnf(c_0_169,negated_conjecture,
( present(skc29,skc34)
| ~ ssSkC0 ),
clause46,
[final] ).
cnf(c_0_170,negated_conjecture,
( present(skc28,skc30)
| ~ ssSkC0 ),
clause51,
[final] ).
cnf(c_0_171,negated_conjecture,
( present(skc28,skc39)
| ~ ssSkC0 ),
clause31,
[final] ).
cnf(c_0_172,negated_conjecture,
( ssSkC0
| accessible_world(skc45,skc46) ),
clause21,
[final] ).
cnf(c_0_173,negated_conjecture,
( ssSkC0
| accessible_world(skc45,skc55) ),
clause3,
[final] ).
cnf(c_0_174,negated_conjecture,
( event(skc29,skc34)
| ~ ssSkC0 ),
clause47,
[final] ).
cnf(c_0_175,negated_conjecture,
( event(skc28,skc30)
| ~ ssSkC0 ),
clause52,
[final] ).
cnf(c_0_176,negated_conjecture,
( event(skc28,skc39)
| ~ ssSkC0 ),
clause30,
[final] ).
cnf(c_0_177,negated_conjecture,
( proposition(skc28,skc29)
| ~ ssSkC0 ),
clause40,
[final] ).
cnf(c_0_178,negated_conjecture,
( accessible_world(skc28,skc29)
| ~ ssSkC0 ),
clause41,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP231-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.33 % Computer : n018.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 2400
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon Oct 2 11:15:53 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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.Pss9tEROfX/E---3.1_28865.p
% 0.19/0.52 # Version: 3.1pre001
% 0.19/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 29029 completed with status 1
% 0.19/0.52 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.52 # No SInE strategy applied
% 0.19/0.52 # Search class: FGHNF-FFMM11-SFFFFFNN
% 0.19/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.52 # Starting sh5l with 136s (1) cores
% 0.19/0.52 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 29039 completed with status 1
% 0.19/0.52 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.52 # No SInE strategy applied
% 0.19/0.52 # Search class: FGHNF-FFMM11-SFFFFFNN
% 0.19/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.52 # Preprocessing time : 0.006 s
% 0.19/0.52 # Presaturation interreduction done
% 0.19/0.52
% 0.19/0.52 # No proof found!
% 0.19/0.52 # SZS status Satisfiable
% 0.19/0.52 # SZS output start Saturation
% See solution above
% 0.19/0.52 # Parsed axioms : 84
% 0.19/0.52 # Removed by relevancy pruning/SinE : 0
% 0.19/0.52 # Initial clauses : 84
% 0.19/0.52 # Removed in clause preprocessing : 0
% 0.19/0.52 # Initial clauses in saturation : 84
% 0.19/0.52 # Processed clauses : 183
% 0.19/0.52 # ...of these trivial : 4
% 0.19/0.52 # ...subsumed : 0
% 0.19/0.52 # ...remaining for further processing : 179
% 0.19/0.52 # Other redundant clauses eliminated : 0
% 0.19/0.52 # Clauses deleted for lack of memory : 0
% 0.19/0.52 # Backward-subsumed : 2
% 0.19/0.52 # Backward-rewritten : 0
% 0.19/0.52 # Generated clauses : 17
% 0.19/0.52 # ...of the previous two non-redundant : 16
% 0.19/0.52 # ...aggressively subsumed : 0
% 0.19/0.52 # Contextual simplify-reflections : 29
% 0.19/0.52 # Paramodulations : 17
% 0.19/0.52 # Factorizations : 0
% 0.19/0.52 # NegExts : 0
% 0.19/0.52 # Equation resolutions : 0
% 0.19/0.52 # Total rewrite steps : 4
% 0.19/0.52 # Propositional unsat checks : 0
% 0.19/0.52 # Propositional check models : 0
% 0.19/0.52 # Propositional check unsatisfiable : 0
% 0.19/0.52 # Propositional clauses : 0
% 0.19/0.52 # Propositional clauses after purity: 0
% 0.19/0.52 # Propositional unsat core size : 0
% 0.19/0.52 # Propositional preprocessing time : 0.000
% 0.19/0.52 # Propositional encoding time : 0.000
% 0.19/0.52 # Propositional solver time : 0.000
% 0.19/0.52 # Success case prop preproc time : 0.000
% 0.19/0.52 # Success case prop encoding time : 0.000
% 0.19/0.52 # Success case prop solver time : 0.000
% 0.19/0.52 # Current number of processed clauses : 93
% 0.19/0.52 # Positive orientable unit clauses : 2
% 0.19/0.52 # Positive unorientable unit clauses: 0
% 0.19/0.52 # Negative unit clauses : 0
% 0.19/0.52 # Non-unit-clauses : 91
% 0.19/0.52 # Current number of unprocessed clauses: 0
% 0.19/0.52 # ...number of literals in the above : 0
% 0.19/0.52 # Current number of archived formulas : 0
% 0.19/0.52 # Current number of archived clauses : 86
% 0.19/0.52 # Clause-clause subsumption calls (NU) : 10315
% 0.19/0.52 # Rec. Clause-clause subsumption calls : 1807
% 0.19/0.52 # Non-unit clause-clause subsumptions : 31
% 0.19/0.52 # Unit Clause-clause subsumption calls : 0
% 0.19/0.52 # Rewrite failures with RHS unbound : 0
% 0.19/0.52 # BW rewrite match attempts : 0
% 0.19/0.52 # BW rewrite match successes : 0
% 0.19/0.52 # Condensation attempts : 0
% 0.19/0.52 # Condensation successes : 0
% 0.19/0.52 # Termbank termtop insertions : 6059
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.034 s
% 0.19/0.52 # System time : 0.008 s
% 0.19/0.52 # Total time : 0.042 s
% 0.19/0.52 # Maximum resident set size: 1824 pages
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.160 s
% 0.19/0.52 # System time : 0.018 s
% 0.19/0.52 # Total time : 0.178 s
% 0.19/0.52 # Maximum resident set size: 1792 pages
% 0.19/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------