TSTP Solution File: NLP257-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NLP257-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : Sat May 4 08:44:33 EDT 2024
% Result : Unsatisfiable 0.54s 0.55s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 25
% Syntax : Number of clauses : 76 ( 37 unt; 0 nHn; 66 RR)
% Number of literals : 468 ( 0 equ; 405 neg)
% Maximal clause size : 37 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-1 aty)
% Number of variables : 201 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause52,axiom,
( man(X2,X3)
| ~ accessible_world(X1,X2)
| ~ man(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause52) ).
cnf(clause91,negated_conjecture,
( present(skc12,skf2(X2))
| ~ man(skc12,X1) ),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause91) ).
cnf(clause83,negated_conjecture,
accessible_world(skc8,skc12),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause83) ).
cnf(clause90,negated_conjecture,
( smoke(skc12,skf2(X2))
| ~ man(skc12,X1) ),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause90) ).
cnf(clause95,negated_conjecture,
( ~ state(X1,X2)
| ~ be(X1,X2,X3,X3)
| ~ man(X1,X3)
| ~ of(X1,X4,X3)
| ~ jules_forename(X1,X4)
| ~ forename(X1,X4)
| ~ jules_forename(X1,X5)
| ~ forename(X1,X5)
| ~ smoke(X6,X7)
| ~ present(X6,X7)
| ~ agent(X6,X7,X8)
| ~ event(X6,X7)
| ~ man(X1,X8)
| ~ of(X1,X5,X8)
| ~ proposition(X1,X6)
| ~ accessible_world(X1,X6)
| ~ smoke(X9,X10)
| ~ present(X9,X10)
| ~ agent(X9,X10,skf4(X9))
| ~ event(X9,X10)
| ~ accessible_world(X1,X9)
| ~ proposition(X1,X9)
| ~ theme(X1,X11,X9)
| ~ event(X1,X11)
| ~ present(X1,X11)
| ~ think_believe_consider(X1,X11)
| ~ man(X1,X12)
| ~ agent(X1,X11,X12)
| ~ agent(X1,X13,X12)
| ~ forename(X1,X14)
| ~ vincent_forename(X1,X14)
| ~ of(X1,X14,X12)
| ~ think_believe_consider(X1,X13)
| ~ present(X1,X13)
| ~ event(X1,X13)
| ~ theme(X1,X13,X6)
| ~ actual_world(X1) ),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause95) ).
cnf(clause1,axiom,
( event(X1,X2)
| ~ smoke(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause1) ).
cnf(clause30,axiom,
( forename(X1,X2)
| ~ jules_forename(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause30) ).
cnf(clause29,axiom,
( forename(X1,X2)
| ~ vincent_forename(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause29) ).
cnf(clause94,negated_conjecture,
( man(X9,skf4(X9))
| ~ state(X1,X2)
| ~ be(X1,X2,X3,X3)
| ~ man(X1,X3)
| ~ of(X1,X4,X3)
| ~ jules_forename(X1,X4)
| ~ forename(X1,X4)
| ~ jules_forename(X1,X5)
| ~ forename(X1,X5)
| ~ smoke(X6,X7)
| ~ present(X6,X7)
| ~ agent(X6,X7,X8)
| ~ event(X6,X7)
| ~ man(X1,X8)
| ~ of(X1,X5,X8)
| ~ proposition(X1,X6)
| ~ accessible_world(X1,X6)
| ~ accessible_world(X1,X9)
| ~ proposition(X1,X9)
| ~ theme(X1,X10,X9)
| ~ event(X1,X10)
| ~ present(X1,X10)
| ~ think_believe_consider(X1,X10)
| ~ man(X1,X11)
| ~ agent(X1,X10,X11)
| ~ agent(X1,X12,X11)
| ~ forename(X1,X13)
| ~ vincent_forename(X1,X13)
| ~ of(X1,X13,X11)
| ~ think_believe_consider(X1,X12)
| ~ present(X1,X12)
| ~ event(X1,X12)
| ~ theme(X1,X12,X6)
| ~ actual_world(X1) ),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause94) ).
cnf(clause93,negated_conjecture,
( agent(skc12,skf2(X1),X1)
| ~ man(skc12,X1) ),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause93) ).
cnf(clause81,negated_conjecture,
man(skc8,skc10),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause81) ).
cnf(clause87,negated_conjecture,
theme(skc8,skc13,skc12),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause87) ).
cnf(clause72,negated_conjecture,
actual_world(skc8),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause72) ).
cnf(clause78,negated_conjecture,
think_believe_consider(skc8,skc13),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause78) ).
cnf(clause77,negated_conjecture,
present(skc8,skc13),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause77) ).
cnf(clause84,negated_conjecture,
proposition(skc8,skc12),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause84) ).
cnf(clause76,negated_conjecture,
event(skc8,skc13),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause76) ).
cnf(clause89,negated_conjecture,
be(skc8,skc9,skc10,skc10),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause89) ).
cnf(clause82,negated_conjecture,
state(skc8,skc9),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause82) ).
cnf(clause85,negated_conjecture,
of(skc8,skc14,skc15),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause85) ).
cnf(clause86,negated_conjecture,
agent(skc8,skc13,skc15),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause86) ).
cnf(clause75,negated_conjecture,
vincent_forename(skc8,skc14),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause75) ).
cnf(clause73,negated_conjecture,
man(skc8,skc15),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause73) ).
cnf(clause88,negated_conjecture,
of(skc8,skc11,skc10),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause88) ).
cnf(clause79,negated_conjecture,
jules_forename(skc8,skc11),
file('/export/starexec/sandbox/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p',clause79) ).
cnf(c_0_25,plain,
( man(X2,X3)
| ~ accessible_world(X1,X2)
| ~ man(X1,X3) ),
inference(fof_simplification,[status(thm)],[clause52]) ).
cnf(c_0_26,negated_conjecture,
( present(skc12,skf2(X2))
| ~ man(skc12,X1) ),
inference(fof_simplification,[status(thm)],[clause91]) ).
cnf(c_0_27,plain,
( man(X2,X3)
| ~ accessible_world(X1,X2)
| ~ man(X1,X3) ),
c_0_25 ).
cnf(c_0_28,negated_conjecture,
accessible_world(skc8,skc12),
clause83 ).
cnf(c_0_29,negated_conjecture,
( smoke(skc12,skf2(X2))
| ~ man(skc12,X1) ),
inference(fof_simplification,[status(thm)],[clause90]) ).
cnf(c_0_30,negated_conjecture,
( ~ state(X1,X2)
| ~ be(X1,X2,X3,X3)
| ~ man(X1,X3)
| ~ of(X1,X4,X3)
| ~ jules_forename(X1,X4)
| ~ forename(X1,X4)
| ~ jules_forename(X1,X5)
| ~ forename(X1,X5)
| ~ smoke(X6,X7)
| ~ present(X6,X7)
| ~ agent(X6,X7,X8)
| ~ event(X6,X7)
| ~ man(X1,X8)
| ~ of(X1,X5,X8)
| ~ proposition(X1,X6)
| ~ accessible_world(X1,X6)
| ~ smoke(X9,X10)
| ~ present(X9,X10)
| ~ agent(X9,X10,skf4(X9))
| ~ event(X9,X10)
| ~ accessible_world(X1,X9)
| ~ proposition(X1,X9)
| ~ theme(X1,X11,X9)
| ~ event(X1,X11)
| ~ present(X1,X11)
| ~ think_believe_consider(X1,X11)
| ~ man(X1,X12)
| ~ agent(X1,X11,X12)
| ~ agent(X1,X13,X12)
| ~ forename(X1,X14)
| ~ vincent_forename(X1,X14)
| ~ of(X1,X14,X12)
| ~ think_believe_consider(X1,X13)
| ~ present(X1,X13)
| ~ event(X1,X13)
| ~ theme(X1,X13,X6)
| ~ actual_world(X1) ),
inference(fof_simplification,[status(thm)],[clause95]) ).
cnf(c_0_31,plain,
( event(X1,X2)
| ~ smoke(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause1]) ).
cnf(c_0_32,plain,
( forename(X1,X2)
| ~ jules_forename(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause30]) ).
cnf(c_0_33,plain,
( forename(X1,X2)
| ~ vincent_forename(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause29]) ).
cnf(c_0_34,negated_conjecture,
( present(skc12,skf2(X2))
| ~ man(skc12,X1) ),
c_0_26 ).
cnf(c_0_35,negated_conjecture,
( man(skc12,X1)
| ~ man(skc8,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
( smoke(skc12,skf2(X2))
| ~ man(skc12,X1) ),
c_0_29 ).
cnf(c_0_37,negated_conjecture,
( man(X9,skf4(X9))
| ~ state(X1,X2)
| ~ be(X1,X2,X3,X3)
| ~ man(X1,X3)
| ~ of(X1,X4,X3)
| ~ jules_forename(X1,X4)
| ~ forename(X1,X4)
| ~ jules_forename(X1,X5)
| ~ forename(X1,X5)
| ~ smoke(X6,X7)
| ~ present(X6,X7)
| ~ agent(X6,X7,X8)
| ~ event(X6,X7)
| ~ man(X1,X8)
| ~ of(X1,X5,X8)
| ~ proposition(X1,X6)
| ~ accessible_world(X1,X6)
| ~ accessible_world(X1,X9)
| ~ proposition(X1,X9)
| ~ theme(X1,X10,X9)
| ~ event(X1,X10)
| ~ present(X1,X10)
| ~ think_believe_consider(X1,X10)
| ~ man(X1,X11)
| ~ agent(X1,X10,X11)
| ~ agent(X1,X12,X11)
| ~ forename(X1,X13)
| ~ vincent_forename(X1,X13)
| ~ of(X1,X13,X11)
| ~ think_believe_consider(X1,X12)
| ~ present(X1,X12)
| ~ event(X1,X12)
| ~ theme(X1,X12,X6)
| ~ actual_world(X1) ),
inference(fof_simplification,[status(thm)],[clause94]) ).
cnf(c_0_38,negated_conjecture,
( ~ state(X1,X2)
| ~ be(X1,X2,X3,X3)
| ~ man(X1,X3)
| ~ of(X1,X4,X3)
| ~ jules_forename(X1,X4)
| ~ forename(X1,X4)
| ~ jules_forename(X1,X5)
| ~ forename(X1,X5)
| ~ smoke(X6,X7)
| ~ present(X6,X7)
| ~ agent(X6,X7,X8)
| ~ event(X6,X7)
| ~ man(X1,X8)
| ~ of(X1,X5,X8)
| ~ proposition(X1,X6)
| ~ accessible_world(X1,X6)
| ~ smoke(X9,X10)
| ~ present(X9,X10)
| ~ agent(X9,X10,skf4(X9))
| ~ event(X9,X10)
| ~ accessible_world(X1,X9)
| ~ proposition(X1,X9)
| ~ theme(X1,X11,X9)
| ~ event(X1,X11)
| ~ present(X1,X11)
| ~ think_believe_consider(X1,X11)
| ~ man(X1,X12)
| ~ agent(X1,X11,X12)
| ~ agent(X1,X13,X12)
| ~ forename(X1,X14)
| ~ vincent_forename(X1,X14)
| ~ of(X1,X14,X12)
| ~ think_believe_consider(X1,X13)
| ~ present(X1,X13)
| ~ event(X1,X13)
| ~ theme(X1,X13,X6)
| ~ actual_world(X1) ),
c_0_30 ).
cnf(c_0_39,plain,
( event(X1,X2)
| ~ smoke(X1,X2) ),
c_0_31 ).
cnf(c_0_40,plain,
( forename(X1,X2)
| ~ jules_forename(X1,X2) ),
c_0_32 ).
cnf(c_0_41,plain,
( forename(X1,X2)
| ~ vincent_forename(X1,X2) ),
c_0_33 ).
cnf(c_0_42,negated_conjecture,
( agent(skc12,skf2(X1),X1)
| ~ man(skc12,X1) ),
inference(fof_simplification,[status(thm)],[clause93]) ).
cnf(c_0_43,negated_conjecture,
( present(skc12,skf2(X1))
| ~ man(skc8,X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_44,negated_conjecture,
man(skc8,skc10),
clause81 ).
cnf(c_0_45,negated_conjecture,
( smoke(skc12,skf2(X1))
| ~ man(skc8,X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_46,negated_conjecture,
( man(X9,skf4(X9))
| ~ state(X1,X2)
| ~ be(X1,X2,X3,X3)
| ~ man(X1,X3)
| ~ of(X1,X4,X3)
| ~ jules_forename(X1,X4)
| ~ forename(X1,X4)
| ~ jules_forename(X1,X5)
| ~ forename(X1,X5)
| ~ smoke(X6,X7)
| ~ present(X6,X7)
| ~ agent(X6,X7,X8)
| ~ event(X6,X7)
| ~ man(X1,X8)
| ~ of(X1,X5,X8)
| ~ proposition(X1,X6)
| ~ accessible_world(X1,X6)
| ~ accessible_world(X1,X9)
| ~ proposition(X1,X9)
| ~ theme(X1,X10,X9)
| ~ event(X1,X10)
| ~ present(X1,X10)
| ~ think_believe_consider(X1,X10)
| ~ man(X1,X11)
| ~ agent(X1,X10,X11)
| ~ agent(X1,X12,X11)
| ~ forename(X1,X13)
| ~ vincent_forename(X1,X13)
| ~ of(X1,X13,X11)
| ~ think_believe_consider(X1,X12)
| ~ present(X1,X12)
| ~ event(X1,X12)
| ~ theme(X1,X12,X6)
| ~ actual_world(X1) ),
c_0_37 ).
cnf(c_0_47,negated_conjecture,
( ~ actual_world(X1)
| ~ of(X1,X2,X3)
| ~ of(X1,X4,X5)
| ~ of(X1,X6,X7)
| ~ theme(X1,X8,X9)
| ~ theme(X1,X10,X11)
| ~ agent(X11,X12,skf4(X11))
| ~ agent(X9,X13,X5)
| ~ agent(X1,X8,X3)
| ~ agent(X1,X10,X3)
| ~ think_believe_consider(X1,X8)
| ~ think_believe_consider(X1,X10)
| ~ present(X11,X12)
| ~ present(X9,X13)
| ~ present(X1,X8)
| ~ present(X1,X10)
| ~ accessible_world(X1,X11)
| ~ accessible_world(X1,X9)
| ~ be(X1,X14,X7,X7)
| ~ jules_forename(X1,X4)
| ~ jules_forename(X1,X6)
| ~ vincent_forename(X1,X2)
| ~ man(X1,X3)
| ~ man(X1,X5)
| ~ man(X1,X7)
| ~ state(X1,X14)
| ~ proposition(X1,X11)
| ~ proposition(X1,X9)
| ~ event(X1,X8)
| ~ event(X1,X10)
| ~ smoke(X11,X12)
| ~ smoke(X9,X13) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_38,c_0_39]),c_0_39]),c_0_40]),c_0_40]),c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( agent(skc12,skf2(X1),X1)
| ~ man(skc12,X1) ),
c_0_42 ).
cnf(c_0_49,negated_conjecture,
present(skc12,skf2(X1)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,negated_conjecture,
smoke(skc12,skf2(X1)),
inference(spm,[status(thm)],[c_0_45,c_0_44]) ).
cnf(c_0_51,negated_conjecture,
( man(X1,skf4(X1))
| ~ actual_world(X2)
| ~ of(X2,X3,X4)
| ~ of(X2,X5,X6)
| ~ of(X2,X7,X8)
| ~ theme(X2,X9,X10)
| ~ theme(X2,X11,X1)
| ~ agent(X10,X12,X6)
| ~ agent(X2,X9,X4)
| ~ agent(X2,X11,X4)
| ~ think_believe_consider(X2,X9)
| ~ think_believe_consider(X2,X11)
| ~ present(X10,X12)
| ~ present(X2,X9)
| ~ present(X2,X11)
| ~ accessible_world(X2,X1)
| ~ accessible_world(X2,X10)
| ~ be(X2,X13,X8,X8)
| ~ jules_forename(X2,X5)
| ~ jules_forename(X2,X7)
| ~ vincent_forename(X2,X3)
| ~ man(X2,X4)
| ~ man(X2,X6)
| ~ man(X2,X8)
| ~ state(X2,X13)
| ~ proposition(X2,X1)
| ~ proposition(X2,X10)
| ~ event(X2,X9)
| ~ event(X2,X11)
| ~ smoke(X10,X12) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_46,c_0_39]),c_0_40]),c_0_40]),c_0_41]) ).
cnf(c_0_52,negated_conjecture,
( ~ actual_world(X1)
| ~ of(X1,X2,X3)
| ~ of(X1,X4,X5)
| ~ of(X1,X6,X7)
| ~ theme(X1,X8,skc12)
| ~ theme(X1,X9,X10)
| ~ agent(X10,X11,X5)
| ~ agent(X1,X9,X3)
| ~ agent(X1,X8,X3)
| ~ think_believe_consider(X1,X9)
| ~ think_believe_consider(X1,X8)
| ~ present(X10,X11)
| ~ present(X1,X9)
| ~ present(X1,X8)
| ~ accessible_world(X1,skc12)
| ~ accessible_world(X1,X10)
| ~ be(X1,X12,X7,X7)
| ~ jules_forename(X1,X4)
| ~ jules_forename(X1,X6)
| ~ vincent_forename(X1,X2)
| ~ man(X1,X3)
| ~ man(X1,X5)
| ~ man(X1,X7)
| ~ state(X1,X12)
| ~ proposition(X1,skc12)
| ~ proposition(X1,X10)
| ~ event(X1,X9)
| ~ event(X1,X8)
| ~ smoke(X10,X11) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50])]),c_0_51]) ).
cnf(c_0_53,negated_conjecture,
theme(skc8,skc13,skc12),
clause87 ).
cnf(c_0_54,negated_conjecture,
actual_world(skc8),
clause72 ).
cnf(c_0_55,negated_conjecture,
think_believe_consider(skc8,skc13),
clause78 ).
cnf(c_0_56,negated_conjecture,
present(skc8,skc13),
clause77 ).
cnf(c_0_57,negated_conjecture,
proposition(skc8,skc12),
clause84 ).
cnf(c_0_58,negated_conjecture,
event(skc8,skc13),
clause76 ).
cnf(c_0_59,negated_conjecture,
( ~ of(skc8,X1,X2)
| ~ of(skc8,X3,X4)
| ~ of(skc8,X5,X6)
| ~ theme(skc8,X7,X8)
| ~ agent(skc8,skc13,X2)
| ~ agent(skc8,X7,X2)
| ~ agent(X8,X9,X4)
| ~ think_believe_consider(skc8,X7)
| ~ present(skc8,X7)
| ~ present(X8,X9)
| ~ accessible_world(skc8,X8)
| ~ be(skc8,X10,X6,X6)
| ~ jules_forename(skc8,X3)
| ~ jules_forename(skc8,X5)
| ~ vincent_forename(skc8,X1)
| ~ man(skc8,X2)
| ~ man(skc8,X4)
| ~ man(skc8,X6)
| ~ state(skc8,X10)
| ~ proposition(skc8,X8)
| ~ event(skc8,X7)
| ~ smoke(X8,X9) ),
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_52,c_0_53]),c_0_54]),c_0_55]),c_0_56]),c_0_28]),c_0_57]),c_0_58])]) ).
cnf(c_0_60,negated_conjecture,
be(skc8,skc9,skc10,skc10),
clause89 ).
cnf(c_0_61,negated_conjecture,
state(skc8,skc9),
clause82 ).
cnf(c_0_62,negated_conjecture,
( ~ of(skc8,X1,skc10)
| ~ of(skc8,X2,X3)
| ~ of(skc8,X4,X5)
| ~ theme(skc8,X6,X7)
| ~ agent(skc8,skc13,X3)
| ~ agent(skc8,X6,X3)
| ~ agent(X7,X8,X5)
| ~ think_believe_consider(skc8,X6)
| ~ present(skc8,X6)
| ~ present(X7,X8)
| ~ accessible_world(skc8,X7)
| ~ jules_forename(skc8,X4)
| ~ jules_forename(skc8,X1)
| ~ vincent_forename(skc8,X2)
| ~ man(skc8,X3)
| ~ man(skc8,X5)
| ~ proposition(skc8,X7)
| ~ event(skc8,X6)
| ~ smoke(X7,X8) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_44]),c_0_61])]) ).
cnf(c_0_63,negated_conjecture,
of(skc8,skc14,skc15),
clause85 ).
cnf(c_0_64,negated_conjecture,
agent(skc8,skc13,skc15),
clause86 ).
cnf(c_0_65,negated_conjecture,
vincent_forename(skc8,skc14),
clause75 ).
cnf(c_0_66,negated_conjecture,
man(skc8,skc15),
clause73 ).
cnf(c_0_67,negated_conjecture,
( ~ of(skc8,X1,skc10)
| ~ of(skc8,X2,X3)
| ~ theme(skc8,X4,X5)
| ~ agent(skc8,X4,skc15)
| ~ agent(X5,X6,X3)
| ~ think_believe_consider(skc8,X4)
| ~ present(skc8,X4)
| ~ present(X5,X6)
| ~ accessible_world(skc8,X5)
| ~ jules_forename(skc8,X2)
| ~ jules_forename(skc8,X1)
| ~ man(skc8,X3)
| ~ proposition(skc8,X5)
| ~ event(skc8,X4)
| ~ smoke(X5,X6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_65]),c_0_66])]) ).
cnf(c_0_68,negated_conjecture,
of(skc8,skc11,skc10),
clause88 ).
cnf(c_0_69,negated_conjecture,
jules_forename(skc8,skc11),
clause79 ).
cnf(c_0_70,negated_conjecture,
( ~ of(skc8,X1,skc10)
| ~ theme(skc8,X2,X3)
| ~ agent(skc8,X2,skc15)
| ~ agent(X3,X4,skc10)
| ~ think_believe_consider(skc8,X2)
| ~ present(skc8,X2)
| ~ present(X3,X4)
| ~ accessible_world(skc8,X3)
| ~ jules_forename(skc8,X1)
| ~ proposition(skc8,X3)
| ~ event(skc8,X2)
| ~ smoke(X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_44])]) ).
cnf(c_0_71,negated_conjecture,
( ~ of(skc8,X1,skc10)
| ~ agent(skc12,X2,skc10)
| ~ present(skc12,X2)
| ~ jules_forename(skc8,X1)
| ~ smoke(skc12,X2) ),
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_70,c_0_53]),c_0_64]),c_0_55]),c_0_56]),c_0_28]),c_0_57]),c_0_58])]) ).
cnf(c_0_72,negated_conjecture,
( ~ agent(skc12,X1,skc10)
| ~ present(skc12,X1)
| ~ smoke(skc12,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_69]),c_0_68])]) ).
cnf(c_0_73,negated_conjecture,
~ agent(skc12,skf2(X1),skc10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_50]),c_0_49])]) ).
cnf(c_0_74,negated_conjecture,
~ man(skc12,skc10),
inference(spm,[status(thm)],[c_0_73,c_0_48]) ).
cnf(c_0_75,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_35]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : NLP257-1 : TPTP v8.1.2. Released v2.4.0.
% 0.15/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n026.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri May 3 08:49:06 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 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/tmp/tmp.QvAiGgIBzP/E---3.1_24345.p
% 0.54/0.55 # Version: 3.1.0
% 0.54/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.54/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.54/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.54/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.54/0.55 # Starting sh5l with 300s (1) cores
% 0.54/0.55 # new_bool_1 with pid 24454 completed with status 0
% 0.54/0.55 # Result found by new_bool_1
% 0.54/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.54/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.54/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.54/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.54/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.54/0.55 # Search class: FHHSF-FFMM11-SFFFFFNN
% 0.54/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.54/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.54/0.55 # SAT001_MinMin_p005000_rr_RG with pid 24462 completed with status 0
% 0.54/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.54/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.54/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.54/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.54/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.54/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.54/0.55 # Search class: FHHSF-FFMM11-SFFFFFNN
% 0.54/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.54/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.54/0.55 # Preprocessing time : 0.005 s
% 0.54/0.55 # Presaturation interreduction done
% 0.54/0.55
% 0.54/0.55 # Proof found!
% 0.54/0.55 # SZS status Unsatisfiable
% 0.54/0.55 # SZS output start CNFRefutation
% See solution above
% 0.54/0.55 # Parsed axioms : 95
% 0.54/0.55 # Removed by relevancy pruning/SinE : 27
% 0.54/0.55 # Initial clauses : 68
% 0.54/0.55 # Removed in clause preprocessing : 0
% 0.54/0.55 # Initial clauses in saturation : 68
% 0.54/0.55 # Processed clauses : 177
% 0.54/0.55 # ...of these trivial : 0
% 0.54/0.55 # ...subsumed : 0
% 0.54/0.55 # ...remaining for further processing : 177
% 0.54/0.55 # Other redundant clauses eliminated : 0
% 0.54/0.55 # Clauses deleted for lack of memory : 0
% 0.54/0.55 # Backward-subsumed : 1
% 0.54/0.55 # Backward-rewritten : 5
% 0.54/0.55 # Generated clauses : 77
% 0.54/0.55 # ...of the previous two non-redundant : 74
% 0.54/0.55 # ...aggressively subsumed : 0
% 0.54/0.55 # Contextual simplify-reflections : 10
% 0.54/0.55 # Paramodulations : 77
% 0.54/0.55 # Factorizations : 0
% 0.54/0.55 # NegExts : 0
% 0.54/0.55 # Equation resolutions : 0
% 0.54/0.55 # Disequality decompositions : 0
% 0.54/0.55 # Total rewrite steps : 53
% 0.54/0.55 # ...of those cached : 33
% 0.54/0.55 # Propositional unsat checks : 0
% 0.54/0.55 # Propositional check models : 0
% 0.54/0.55 # Propositional check unsatisfiable : 0
% 0.54/0.55 # Propositional clauses : 0
% 0.54/0.55 # Propositional clauses after purity: 0
% 0.54/0.55 # Propositional unsat core size : 0
% 0.54/0.55 # Propositional preprocessing time : 0.000
% 0.54/0.55 # Propositional encoding time : 0.000
% 0.54/0.55 # Propositional solver time : 0.000
% 0.54/0.55 # Success case prop preproc time : 0.000
% 0.54/0.55 # Success case prop encoding time : 0.000
% 0.54/0.55 # Success case prop solver time : 0.000
% 0.54/0.55 # Current number of processed clauses : 103
% 0.54/0.55 # Positive orientable unit clauses : 25
% 0.54/0.55 # Positive unorientable unit clauses: 0
% 0.54/0.55 # Negative unit clauses : 2
% 0.54/0.55 # Non-unit-clauses : 76
% 0.54/0.55 # Current number of unprocessed clauses: 30
% 0.54/0.55 # ...number of literals in the above : 223
% 0.54/0.55 # Current number of archived formulas : 0
% 0.54/0.55 # Current number of archived clauses : 74
% 0.54/0.55 # Clause-clause subsumption calls (NU) : 8798
% 0.54/0.55 # Rec. Clause-clause subsumption calls : 1324
% 0.54/0.55 # Non-unit clause-clause subsumptions : 11
% 0.54/0.55 # Unit Clause-clause subsumption calls : 49
% 0.54/0.55 # Rewrite failures with RHS unbound : 0
% 0.54/0.55 # BW rewrite match attempts : 3
% 0.54/0.55 # BW rewrite match successes : 3
% 0.54/0.55 # Condensation attempts : 0
% 0.54/0.55 # Condensation successes : 0
% 0.54/0.55 # Termbank termtop insertions : 5418
% 0.54/0.55 # Search garbage collected termcells : 451
% 0.54/0.55
% 0.54/0.55 # -------------------------------------------------
% 0.54/0.55 # User time : 0.018 s
% 0.54/0.55 # System time : 0.006 s
% 0.54/0.55 # Total time : 0.024 s
% 0.54/0.55 # Maximum resident set size: 1948 pages
% 0.54/0.55
% 0.54/0.55 # -------------------------------------------------
% 0.54/0.55 # User time : 0.020 s
% 0.54/0.55 # System time : 0.008 s
% 0.54/0.55 # Total time : 0.028 s
% 0.54/0.55 # Maximum resident set size: 1792 pages
% 0.54/0.55 % E---3.1 exiting
% 0.54/0.55 % E exiting
%------------------------------------------------------------------------------