TSTP Solution File: NLP257+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 : n020.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:47:22 EDT 2024
% Result : Theorem 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of formulae : 62 ( 25 unt; 0 def)
% Number of atoms : 685 ( 0 equ)
% Maximal formula atoms : 106 ( 11 avg)
% Number of connectives : 1097 ( 474 ~; 464 |; 151 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 82 ( 11 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-13 aty)
% Number of variables : 253 ( 0 sgn 38 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
~ ( ? [X1] :
( actual_world(X1)
& ? [X2,X3,X4,X5,X6,X7,X8] :
( of(X1,X3,X2)
& man(X1,X2)
& vincent_forename(X1,X3)
& forename(X1,X3)
& proposition(X1,X5)
& agent(X1,X4,X2)
& theme(X1,X4,X5)
& event(X1,X4)
& present(X1,X4)
& think_believe_consider(X1,X4)
& accessible_world(X1,X5)
& ! [X9] :
( man(X5,X9)
=> ? [X10] :
( event(X5,X10)
& agent(X5,X10,X9)
& present(X5,X10)
& smoke(X5,X10) ) )
& of(X1,X6,X7)
& man(X1,X7)
& jules_forename(X1,X6)
& forename(X1,X6)
& man(X1,X7)
& state(X1,X8)
& be(X1,X8,X7,X7) ) )
& ~ ? [X11] :
( actual_world(X11)
& ? [X12,X13,X14,X2,X3,X4,X5,X6,X7,X8,X15,X16] :
( of(X11,X13,X12)
& man(X11,X12)
& jules_forename(X11,X13)
& forename(X11,X13)
& of(X11,X14,X2)
& vincent_forename(X11,X14)
& forename(X11,X14)
& of(X11,X3,X2)
& man(X11,X2)
& vincent_forename(X11,X3)
& forename(X11,X3)
& proposition(X11,X5)
& agent(X11,X4,X2)
& theme(X11,X4,X5)
& event(X11,X4)
& present(X11,X4)
& think_believe_consider(X11,X4)
& accessible_world(X11,X5)
& ! [X9] :
( man(X5,X9)
=> ? [X10] :
( event(X5,X10)
& agent(X5,X10,X9)
& present(X5,X10)
& smoke(X5,X10) ) )
& of(X11,X6,X7)
& man(X11,X7)
& jules_forename(X11,X6)
& forename(X11,X6)
& man(X11,X7)
& state(X11,X8)
& be(X11,X8,X7,X7)
& proposition(X11,X16)
& agent(X11,X15,X2)
& theme(X11,X15,X16)
& event(X11,X15)
& present(X11,X15)
& think_believe_consider(X11,X15)
& accessible_world(X11,X16)
& ? [X17] :
( event(X16,X17)
& agent(X16,X17,X12)
& present(X16,X17)
& smoke(X16,X17) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nZ3s0N1HXH/E---3.1_21118.p',co1) ).
fof(ax1,axiom,
! [X1,X2] :
( jules_forename(X1,X2)
=> forename(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.nZ3s0N1HXH/E---3.1_21118.p',ax1) ).
fof(ax2,axiom,
! [X1,X2] :
( vincent_forename(X1,X2)
=> forename(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.nZ3s0N1HXH/E---3.1_21118.p',ax2) ).
fof(ax30,axiom,
! [X1,X2] :
( smoke(X1,X2)
=> event(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.nZ3s0N1HXH/E---3.1_21118.p',ax30) ).
fof(ax49,axiom,
! [X1,X2,X3] :
( ( accessible_world(X2,X3)
& man(X2,X1) )
=> man(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.nZ3s0N1HXH/E---3.1_21118.p',ax49) ).
fof(c_0_5,negated_conjecture,
~ ~ ( ? [X1] :
( actual_world(X1)
& ? [X2,X3,X4,X5,X6,X7,X8] :
( of(X1,X3,X2)
& man(X1,X2)
& vincent_forename(X1,X3)
& forename(X1,X3)
& proposition(X1,X5)
& agent(X1,X4,X2)
& theme(X1,X4,X5)
& event(X1,X4)
& present(X1,X4)
& think_believe_consider(X1,X4)
& accessible_world(X1,X5)
& ! [X9] :
( man(X5,X9)
=> ? [X10] :
( event(X5,X10)
& agent(X5,X10,X9)
& present(X5,X10)
& smoke(X5,X10) ) )
& of(X1,X6,X7)
& man(X1,X7)
& jules_forename(X1,X6)
& forename(X1,X6)
& man(X1,X7)
& state(X1,X8)
& be(X1,X8,X7,X7) ) )
& ~ ? [X11] :
( actual_world(X11)
& ? [X12,X13,X14,X2,X3,X4,X5,X6,X7,X8,X15,X16] :
( of(X11,X13,X12)
& man(X11,X12)
& jules_forename(X11,X13)
& forename(X11,X13)
& of(X11,X14,X2)
& vincent_forename(X11,X14)
& forename(X11,X14)
& of(X11,X3,X2)
& man(X11,X2)
& vincent_forename(X11,X3)
& forename(X11,X3)
& proposition(X11,X5)
& agent(X11,X4,X2)
& theme(X11,X4,X5)
& event(X11,X4)
& present(X11,X4)
& think_believe_consider(X11,X4)
& accessible_world(X11,X5)
& ! [X9] :
( man(X5,X9)
=> ? [X10] :
( event(X5,X10)
& agent(X5,X10,X9)
& present(X5,X10)
& smoke(X5,X10) ) )
& of(X11,X6,X7)
& man(X11,X7)
& jules_forename(X11,X6)
& forename(X11,X6)
& man(X11,X7)
& state(X11,X8)
& be(X11,X8,X7,X7)
& proposition(X11,X16)
& agent(X11,X15,X2)
& theme(X11,X15,X16)
& event(X11,X15)
& present(X11,X15)
& think_believe_consider(X11,X15)
& accessible_world(X11,X16)
& ? [X17] :
( event(X16,X17)
& agent(X16,X17,X12)
& present(X16,X17)
& smoke(X16,X17) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_6,negated_conjecture,
! [X215,X217,X218,X219,X220,X221,X222,X223,X224,X225,X226,X227,X228,X229,X231,X232] :
( actual_world(esk1_0)
& of(esk1_0,esk3_0,esk2_0)
& man(esk1_0,esk2_0)
& vincent_forename(esk1_0,esk3_0)
& forename(esk1_0,esk3_0)
& proposition(esk1_0,esk5_0)
& agent(esk1_0,esk4_0,esk2_0)
& theme(esk1_0,esk4_0,esk5_0)
& event(esk1_0,esk4_0)
& present(esk1_0,esk4_0)
& think_believe_consider(esk1_0,esk4_0)
& accessible_world(esk1_0,esk5_0)
& ( event(esk5_0,esk9_1(X215))
| ~ man(esk5_0,X215) )
& ( agent(esk5_0,esk9_1(X215),X215)
| ~ man(esk5_0,X215) )
& ( present(esk5_0,esk9_1(X215))
| ~ man(esk5_0,X215) )
& ( smoke(esk5_0,esk9_1(X215))
| ~ man(esk5_0,X215) )
& of(esk1_0,esk6_0,esk7_0)
& man(esk1_0,esk7_0)
& jules_forename(esk1_0,esk6_0)
& forename(esk1_0,esk6_0)
& man(esk1_0,esk7_0)
& state(esk1_0,esk8_0)
& be(esk1_0,esk8_0,esk7_0,esk7_0)
& ( man(X224,esk10_13(X217,X218,X219,X220,X221,X222,X223,X224,X225,X226,X227,X228,X229))
| ~ of(X217,X219,X218)
| ~ man(X217,X218)
| ~ jules_forename(X217,X219)
| ~ forename(X217,X219)
| ~ of(X217,X220,X221)
| ~ vincent_forename(X217,X220)
| ~ forename(X217,X220)
| ~ of(X217,X222,X221)
| ~ man(X217,X221)
| ~ vincent_forename(X217,X222)
| ~ forename(X217,X222)
| ~ proposition(X217,X224)
| ~ agent(X217,X223,X221)
| ~ theme(X217,X223,X224)
| ~ event(X217,X223)
| ~ present(X217,X223)
| ~ think_believe_consider(X217,X223)
| ~ accessible_world(X217,X224)
| ~ of(X217,X225,X226)
| ~ man(X217,X226)
| ~ jules_forename(X217,X225)
| ~ forename(X217,X225)
| ~ man(X217,X226)
| ~ state(X217,X227)
| ~ be(X217,X227,X226,X226)
| ~ proposition(X217,X229)
| ~ agent(X217,X228,X221)
| ~ theme(X217,X228,X229)
| ~ event(X217,X228)
| ~ present(X217,X228)
| ~ think_believe_consider(X217,X228)
| ~ accessible_world(X217,X229)
| ~ event(X229,X232)
| ~ agent(X229,X232,X218)
| ~ present(X229,X232)
| ~ smoke(X229,X232)
| ~ actual_world(X217) )
& ( ~ event(X224,X231)
| ~ agent(X224,X231,esk10_13(X217,X218,X219,X220,X221,X222,X223,X224,X225,X226,X227,X228,X229))
| ~ present(X224,X231)
| ~ smoke(X224,X231)
| ~ of(X217,X219,X218)
| ~ man(X217,X218)
| ~ jules_forename(X217,X219)
| ~ forename(X217,X219)
| ~ of(X217,X220,X221)
| ~ vincent_forename(X217,X220)
| ~ forename(X217,X220)
| ~ of(X217,X222,X221)
| ~ man(X217,X221)
| ~ vincent_forename(X217,X222)
| ~ forename(X217,X222)
| ~ proposition(X217,X224)
| ~ agent(X217,X223,X221)
| ~ theme(X217,X223,X224)
| ~ event(X217,X223)
| ~ present(X217,X223)
| ~ think_believe_consider(X217,X223)
| ~ accessible_world(X217,X224)
| ~ of(X217,X225,X226)
| ~ man(X217,X226)
| ~ jules_forename(X217,X225)
| ~ forename(X217,X225)
| ~ man(X217,X226)
| ~ state(X217,X227)
| ~ be(X217,X227,X226,X226)
| ~ proposition(X217,X229)
| ~ agent(X217,X228,X221)
| ~ theme(X217,X228,X229)
| ~ event(X217,X228)
| ~ present(X217,X228)
| ~ think_believe_consider(X217,X228)
| ~ accessible_world(X217,X229)
| ~ event(X229,X232)
| ~ agent(X229,X232,X218)
| ~ present(X229,X232)
| ~ smoke(X229,X232)
| ~ actual_world(X217) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( man(X1,esk10_13(X2,X3,X4,X5,X6,X7,X8,X1,X9,X10,X11,X12,X13))
| ~ of(X2,X4,X3)
| ~ man(X2,X3)
| ~ jules_forename(X2,X4)
| ~ forename(X2,X4)
| ~ of(X2,X5,X6)
| ~ vincent_forename(X2,X5)
| ~ forename(X2,X5)
| ~ of(X2,X7,X6)
| ~ man(X2,X6)
| ~ vincent_forename(X2,X7)
| ~ forename(X2,X7)
| ~ proposition(X2,X1)
| ~ agent(X2,X8,X6)
| ~ theme(X2,X8,X1)
| ~ event(X2,X8)
| ~ present(X2,X8)
| ~ think_believe_consider(X2,X8)
| ~ accessible_world(X2,X1)
| ~ of(X2,X9,X10)
| ~ man(X2,X10)
| ~ jules_forename(X2,X9)
| ~ forename(X2,X9)
| ~ man(X2,X10)
| ~ state(X2,X11)
| ~ be(X2,X11,X10,X10)
| ~ proposition(X2,X13)
| ~ agent(X2,X12,X6)
| ~ theme(X2,X12,X13)
| ~ event(X2,X12)
| ~ present(X2,X12)
| ~ think_believe_consider(X2,X12)
| ~ accessible_world(X2,X13)
| ~ event(X13,X14)
| ~ agent(X13,X14,X3)
| ~ present(X13,X14)
| ~ smoke(X13,X14)
| ~ actual_world(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X18,X19] :
( ~ jules_forename(X18,X19)
| forename(X18,X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1])])]) ).
fof(c_0_9,plain,
! [X20,X21] :
( ~ vincent_forename(X20,X21)
| forename(X20,X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2])])]) ).
fof(c_0_10,plain,
! [X76,X77] :
( ~ smoke(X76,X77)
| event(X76,X77) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax30])])]) ).
cnf(c_0_11,negated_conjecture,
( man(X1,esk10_13(X2,X3,X4,X5,X6,X7,X8,X1,X9,X10,X11,X12,X13))
| ~ actual_world(X2)
| ~ jules_forename(X2,X9)
| ~ jules_forename(X2,X4)
| ~ forename(X2,X9)
| ~ forename(X2,X7)
| ~ forename(X2,X5)
| ~ forename(X2,X4)
| ~ vincent_forename(X2,X7)
| ~ vincent_forename(X2,X5)
| ~ man(X2,X10)
| ~ man(X2,X6)
| ~ man(X2,X3)
| ~ state(X2,X11)
| ~ event(X13,X14)
| ~ event(X2,X12)
| ~ event(X2,X8)
| ~ proposition(X2,X13)
| ~ proposition(X2,X1)
| ~ smoke(X13,X14)
| ~ accessible_world(X2,X13)
| ~ accessible_world(X2,X1)
| ~ think_believe_consider(X2,X12)
| ~ think_believe_consider(X2,X8)
| ~ present(X13,X14)
| ~ present(X2,X12)
| ~ present(X2,X8)
| ~ of(X2,X9,X10)
| ~ of(X2,X7,X6)
| ~ of(X2,X5,X6)
| ~ of(X2,X4,X3)
| ~ theme(X2,X12,X13)
| ~ theme(X2,X8,X1)
| ~ agent(X13,X14,X3)
| ~ agent(X2,X12,X6)
| ~ agent(X2,X8,X6)
| ~ be(X2,X11,X10,X10) ),
inference(cn,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( forename(X1,X2)
| ~ jules_forename(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( forename(X1,X2)
| ~ vincent_forename(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( event(X1,X2)
| ~ smoke(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( man(X1,esk10_13(X2,X3,X4,X5,X6,X7,X8,X1,X9,X10,X11,X12,X13))
| ~ actual_world(X2)
| ~ present(X13,X14)
| ~ present(X2,X12)
| ~ present(X2,X8)
| ~ agent(X13,X14,X3)
| ~ agent(X2,X12,X6)
| ~ agent(X2,X8,X6)
| ~ think_believe_consider(X2,X12)
| ~ think_believe_consider(X2,X8)
| ~ theme(X2,X12,X13)
| ~ theme(X2,X8,X1)
| ~ be(X2,X11,X10,X10)
| ~ of(X2,X9,X10)
| ~ of(X2,X7,X6)
| ~ of(X2,X5,X6)
| ~ of(X2,X4,X3)
| ~ accessible_world(X2,X13)
| ~ accessible_world(X2,X1)
| ~ smoke(X13,X14)
| ~ proposition(X2,X13)
| ~ proposition(X2,X1)
| ~ event(X2,X12)
| ~ event(X2,X8)
| ~ state(X2,X11)
| ~ man(X2,X10)
| ~ man(X2,X6)
| ~ man(X2,X3)
| ~ vincent_forename(X2,X7)
| ~ vincent_forename(X2,X5)
| ~ jules_forename(X2,X9)
| ~ jules_forename(X2,X4) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_13]),c_0_12]),c_0_14]) ).
cnf(c_0_16,negated_conjecture,
be(esk1_0,esk8_0,esk7_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
actual_world(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
state(esk1_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
man(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_20,plain,
! [X129,X130,X131] :
( ~ accessible_world(X130,X131)
| ~ man(X130,X129)
| man(X131,X129) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax49])])]) ).
cnf(c_0_21,negated_conjecture,
( man(X1,esk10_13(esk1_0,X2,X3,X4,X5,X6,X7,X1,X8,esk7_0,esk8_0,X9,X10))
| ~ present(esk1_0,X9)
| ~ present(esk1_0,X7)
| ~ present(X10,X11)
| ~ agent(esk1_0,X9,X5)
| ~ agent(esk1_0,X7,X5)
| ~ agent(X10,X11,X2)
| ~ think_believe_consider(esk1_0,X9)
| ~ think_believe_consider(esk1_0,X7)
| ~ theme(esk1_0,X9,X10)
| ~ theme(esk1_0,X7,X1)
| ~ of(esk1_0,X8,esk7_0)
| ~ of(esk1_0,X6,X5)
| ~ of(esk1_0,X4,X5)
| ~ of(esk1_0,X3,X2)
| ~ accessible_world(esk1_0,X10)
| ~ accessible_world(esk1_0,X1)
| ~ smoke(X10,X11)
| ~ proposition(esk1_0,X10)
| ~ proposition(esk1_0,X1)
| ~ event(esk1_0,X9)
| ~ event(esk1_0,X7)
| ~ man(esk1_0,X5)
| ~ man(esk1_0,X2)
| ~ vincent_forename(esk1_0,X6)
| ~ vincent_forename(esk1_0,X4)
| ~ jules_forename(esk1_0,X8)
| ~ jules_forename(esk1_0,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
present(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
think_believe_consider(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
event(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,plain,
( man(X2,X3)
| ~ accessible_world(X1,X2)
| ~ man(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
accessible_world(esk1_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_27,negated_conjecture,
( man(X1,esk10_13(esk1_0,X2,X3,X4,X5,X6,X7,X1,X8,esk7_0,esk8_0,esk4_0,X9))
| ~ present(esk1_0,X7)
| ~ present(X9,X10)
| ~ agent(esk1_0,esk4_0,X5)
| ~ agent(esk1_0,X7,X5)
| ~ agent(X9,X10,X2)
| ~ think_believe_consider(esk1_0,X7)
| ~ theme(esk1_0,esk4_0,X9)
| ~ theme(esk1_0,X7,X1)
| ~ of(esk1_0,X8,esk7_0)
| ~ of(esk1_0,X6,X5)
| ~ of(esk1_0,X4,X5)
| ~ of(esk1_0,X3,X2)
| ~ accessible_world(esk1_0,X9)
| ~ accessible_world(esk1_0,X1)
| ~ smoke(X9,X10)
| ~ proposition(esk1_0,X9)
| ~ proposition(esk1_0,X1)
| ~ event(esk1_0,X7)
| ~ man(esk1_0,X5)
| ~ man(esk1_0,X2)
| ~ vincent_forename(esk1_0,X6)
| ~ vincent_forename(esk1_0,X4)
| ~ jules_forename(esk1_0,X8)
| ~ jules_forename(esk1_0,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_28,negated_conjecture,
( man(esk5_0,X1)
| ~ man(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( man(X1,esk10_13(esk1_0,X2,X3,X4,X5,X6,esk4_0,X1,X7,esk7_0,esk8_0,esk4_0,X8))
| ~ present(X8,X9)
| ~ agent(esk1_0,esk4_0,X5)
| ~ agent(X8,X9,X2)
| ~ theme(esk1_0,esk4_0,X8)
| ~ theme(esk1_0,esk4_0,X1)
| ~ of(esk1_0,X7,esk7_0)
| ~ of(esk1_0,X6,X5)
| ~ of(esk1_0,X4,X5)
| ~ of(esk1_0,X3,X2)
| ~ accessible_world(esk1_0,X8)
| ~ accessible_world(esk1_0,X1)
| ~ smoke(X8,X9)
| ~ proposition(esk1_0,X8)
| ~ proposition(esk1_0,X1)
| ~ man(esk1_0,X5)
| ~ man(esk1_0,X2)
| ~ vincent_forename(esk1_0,X6)
| ~ vincent_forename(esk1_0,X4)
| ~ jules_forename(esk1_0,X7)
| ~ jules_forename(esk1_0,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_30,negated_conjecture,
theme(esk1_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_31,negated_conjecture,
proposition(esk1_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_32,negated_conjecture,
( present(esk5_0,esk9_1(X1))
| ~ man(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_33,negated_conjecture,
man(esk5_0,esk7_0),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_34,negated_conjecture,
( smoke(esk5_0,esk9_1(X1))
| ~ man(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_35,negated_conjecture,
( man(X1,esk10_13(esk1_0,X2,X3,X4,X5,X6,esk4_0,X1,X7,esk7_0,esk8_0,esk4_0,esk5_0))
| ~ present(esk5_0,X8)
| ~ agent(esk1_0,esk4_0,X5)
| ~ agent(esk5_0,X8,X2)
| ~ theme(esk1_0,esk4_0,X1)
| ~ of(esk1_0,X7,esk7_0)
| ~ of(esk1_0,X6,X5)
| ~ of(esk1_0,X4,X5)
| ~ of(esk1_0,X3,X2)
| ~ accessible_world(esk1_0,X1)
| ~ smoke(esk5_0,X8)
| ~ proposition(esk1_0,X1)
| ~ man(esk1_0,X5)
| ~ man(esk1_0,X2)
| ~ vincent_forename(esk1_0,X6)
| ~ vincent_forename(esk1_0,X4)
| ~ jules_forename(esk1_0,X7)
| ~ jules_forename(esk1_0,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_26]),c_0_30]),c_0_31])]) ).
cnf(c_0_36,negated_conjecture,
present(esk5_0,esk9_1(esk7_0)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
smoke(esk5_0,esk9_1(esk7_0)),
inference(spm,[status(thm)],[c_0_34,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( man(X1,esk10_13(esk1_0,X2,X3,X4,X5,X6,esk4_0,X1,X7,esk7_0,esk8_0,esk4_0,esk5_0))
| ~ agent(esk5_0,esk9_1(esk7_0),X2)
| ~ agent(esk1_0,esk4_0,X5)
| ~ theme(esk1_0,esk4_0,X1)
| ~ of(esk1_0,X7,esk7_0)
| ~ of(esk1_0,X6,X5)
| ~ of(esk1_0,X4,X5)
| ~ of(esk1_0,X3,X2)
| ~ accessible_world(esk1_0,X1)
| ~ proposition(esk1_0,X1)
| ~ man(esk1_0,X5)
| ~ man(esk1_0,X2)
| ~ vincent_forename(esk1_0,X6)
| ~ vincent_forename(esk1_0,X4)
| ~ jules_forename(esk1_0,X7)
| ~ jules_forename(esk1_0,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_39,negated_conjecture,
( man(esk5_0,esk10_13(esk1_0,X1,X2,X3,X4,X5,esk4_0,esk5_0,X6,esk7_0,esk8_0,esk4_0,esk5_0))
| ~ agent(esk5_0,esk9_1(esk7_0),X1)
| ~ agent(esk1_0,esk4_0,X4)
| ~ of(esk1_0,X6,esk7_0)
| ~ of(esk1_0,X5,X4)
| ~ of(esk1_0,X3,X4)
| ~ of(esk1_0,X2,X1)
| ~ man(esk1_0,X4)
| ~ man(esk1_0,X1)
| ~ vincent_forename(esk1_0,X5)
| ~ vincent_forename(esk1_0,X3)
| ~ jules_forename(esk1_0,X6)
| ~ jules_forename(esk1_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_26]),c_0_30]),c_0_31])]) ).
cnf(c_0_40,negated_conjecture,
vincent_forename(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_41,negated_conjecture,
( man(esk5_0,esk10_13(esk1_0,X1,X2,X3,X4,esk3_0,esk4_0,esk5_0,X5,esk7_0,esk8_0,esk4_0,esk5_0))
| ~ agent(esk5_0,esk9_1(esk7_0),X1)
| ~ agent(esk1_0,esk4_0,X4)
| ~ of(esk1_0,X5,esk7_0)
| ~ of(esk1_0,esk3_0,X4)
| ~ of(esk1_0,X3,X4)
| ~ of(esk1_0,X2,X1)
| ~ man(esk1_0,X4)
| ~ man(esk1_0,X1)
| ~ vincent_forename(esk1_0,X3)
| ~ jules_forename(esk1_0,X5)
| ~ jules_forename(esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
( man(esk5_0,esk10_13(esk1_0,X1,X2,esk3_0,X3,esk3_0,esk4_0,esk5_0,X4,esk7_0,esk8_0,esk4_0,esk5_0))
| ~ agent(esk5_0,esk9_1(esk7_0),X1)
| ~ agent(esk1_0,esk4_0,X3)
| ~ of(esk1_0,X4,esk7_0)
| ~ of(esk1_0,esk3_0,X3)
| ~ of(esk1_0,X2,X1)
| ~ man(esk1_0,X3)
| ~ man(esk1_0,X1)
| ~ jules_forename(esk1_0,X4)
| ~ jules_forename(esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
jules_forename(esk1_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_44,negated_conjecture,
of(esk1_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_45,negated_conjecture,
( man(esk5_0,esk10_13(esk1_0,X1,X2,esk3_0,X3,esk3_0,esk4_0,esk5_0,esk6_0,esk7_0,esk8_0,esk4_0,esk5_0))
| ~ agent(esk5_0,esk9_1(esk7_0),X1)
| ~ agent(esk1_0,esk4_0,X3)
| ~ of(esk1_0,esk3_0,X3)
| ~ of(esk1_0,X2,X1)
| ~ man(esk1_0,X3)
| ~ man(esk1_0,X1)
| ~ jules_forename(esk1_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_46,negated_conjecture,
( man(esk5_0,esk10_13(esk1_0,X1,esk6_0,esk3_0,X2,esk3_0,esk4_0,esk5_0,esk6_0,esk7_0,esk8_0,esk4_0,esk5_0))
| ~ agent(esk5_0,esk9_1(esk7_0),X1)
| ~ agent(esk1_0,esk4_0,X2)
| ~ of(esk1_0,esk3_0,X2)
| ~ of(esk1_0,esk6_0,X1)
| ~ man(esk1_0,X2)
| ~ man(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
man(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_48,negated_conjecture,
agent(esk1_0,esk4_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_49,negated_conjecture,
of(esk1_0,esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_50,negated_conjecture,
( agent(esk5_0,esk9_1(X1),X1)
| ~ man(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_51,negated_conjecture,
( ~ event(X1,X2)
| ~ agent(X1,X2,esk10_13(X3,X4,X5,X6,X7,X8,X9,X1,X10,X11,X12,X13,X14))
| ~ present(X1,X2)
| ~ smoke(X1,X2)
| ~ of(X3,X5,X4)
| ~ man(X3,X4)
| ~ jules_forename(X3,X5)
| ~ forename(X3,X5)
| ~ of(X3,X6,X7)
| ~ vincent_forename(X3,X6)
| ~ forename(X3,X6)
| ~ of(X3,X8,X7)
| ~ man(X3,X7)
| ~ vincent_forename(X3,X8)
| ~ forename(X3,X8)
| ~ proposition(X3,X1)
| ~ agent(X3,X9,X7)
| ~ theme(X3,X9,X1)
| ~ event(X3,X9)
| ~ present(X3,X9)
| ~ think_believe_consider(X3,X9)
| ~ accessible_world(X3,X1)
| ~ of(X3,X10,X11)
| ~ man(X3,X11)
| ~ jules_forename(X3,X10)
| ~ forename(X3,X10)
| ~ man(X3,X11)
| ~ state(X3,X12)
| ~ be(X3,X12,X11,X11)
| ~ proposition(X3,X14)
| ~ agent(X3,X13,X7)
| ~ theme(X3,X13,X14)
| ~ event(X3,X13)
| ~ present(X3,X13)
| ~ think_believe_consider(X3,X13)
| ~ accessible_world(X3,X14)
| ~ event(X14,X15)
| ~ agent(X14,X15,X4)
| ~ present(X14,X15)
| ~ smoke(X14,X15)
| ~ actual_world(X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_52,negated_conjecture,
( man(esk5_0,esk10_13(esk1_0,X1,esk6_0,esk3_0,esk2_0,esk3_0,esk4_0,esk5_0,esk6_0,esk7_0,esk8_0,esk4_0,esk5_0))
| ~ agent(esk5_0,esk9_1(esk7_0),X1)
| ~ of(esk1_0,esk6_0,X1)
| ~ man(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49])]) ).
cnf(c_0_53,negated_conjecture,
agent(esk5_0,esk9_1(esk7_0),esk7_0),
inference(spm,[status(thm)],[c_0_50,c_0_33]) ).
cnf(c_0_54,negated_conjecture,
( ~ actual_world(X3)
| ~ jules_forename(X3,X10)
| ~ jules_forename(X3,X5)
| ~ forename(X3,X10)
| ~ forename(X3,X8)
| ~ forename(X3,X6)
| ~ forename(X3,X5)
| ~ vincent_forename(X3,X8)
| ~ vincent_forename(X3,X6)
| ~ man(X3,X11)
| ~ man(X3,X7)
| ~ man(X3,X4)
| ~ state(X3,X12)
| ~ event(X14,X15)
| ~ event(X3,X13)
| ~ event(X3,X9)
| ~ event(X1,X2)
| ~ proposition(X3,X14)
| ~ proposition(X3,X1)
| ~ smoke(X14,X15)
| ~ smoke(X1,X2)
| ~ accessible_world(X3,X14)
| ~ accessible_world(X3,X1)
| ~ think_believe_consider(X3,X13)
| ~ think_believe_consider(X3,X9)
| ~ present(X14,X15)
| ~ present(X3,X13)
| ~ present(X3,X9)
| ~ present(X1,X2)
| ~ of(X3,X10,X11)
| ~ of(X3,X8,X7)
| ~ of(X3,X6,X7)
| ~ of(X3,X5,X4)
| ~ theme(X3,X13,X14)
| ~ theme(X3,X9,X1)
| ~ agent(X14,X15,X4)
| ~ agent(X3,X13,X7)
| ~ agent(X3,X9,X7)
| ~ be(X3,X12,X11,X11)
| ~ agent(X1,X2,esk10_13(X3,X4,X5,X6,X7,X8,X9,X1,X10,X11,X12,X13,X14)) ),
inference(cn,[status(thm)],[c_0_51]) ).
cnf(c_0_55,negated_conjecture,
man(esk5_0,esk10_13(esk1_0,esk7_0,esk6_0,esk3_0,esk2_0,esk3_0,esk4_0,esk5_0,esk6_0,esk7_0,esk8_0,esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_19]),c_0_53]),c_0_44])]) ).
cnf(c_0_56,negated_conjecture,
( ~ actual_world(X1)
| ~ present(X2,X3)
| ~ present(X1,X4)
| ~ present(X1,X5)
| ~ present(X6,X7)
| ~ agent(X6,X7,esk10_13(X1,X8,X9,X10,X11,X12,X5,X6,X13,X14,X15,X4,X2))
| ~ agent(X2,X3,X8)
| ~ agent(X1,X4,X11)
| ~ agent(X1,X5,X11)
| ~ think_believe_consider(X1,X4)
| ~ think_believe_consider(X1,X5)
| ~ theme(X1,X4,X2)
| ~ theme(X1,X5,X6)
| ~ be(X1,X15,X14,X14)
| ~ of(X1,X13,X14)
| ~ of(X1,X12,X11)
| ~ of(X1,X10,X11)
| ~ of(X1,X9,X8)
| ~ accessible_world(X1,X2)
| ~ accessible_world(X1,X6)
| ~ smoke(X2,X3)
| ~ smoke(X6,X7)
| ~ proposition(X1,X2)
| ~ proposition(X1,X6)
| ~ event(X1,X4)
| ~ event(X1,X5)
| ~ state(X1,X15)
| ~ man(X1,X14)
| ~ man(X1,X11)
| ~ man(X1,X8)
| ~ vincent_forename(X1,X12)
| ~ vincent_forename(X1,X10)
| ~ jules_forename(X1,X13)
| ~ jules_forename(X1,X9) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_54,c_0_12]),c_0_13]),c_0_13]),c_0_12]),c_0_14]),c_0_14]) ).
cnf(c_0_57,negated_conjecture,
agent(esk5_0,esk9_1(esk10_13(esk1_0,esk7_0,esk6_0,esk3_0,esk2_0,esk3_0,esk4_0,esk5_0,esk6_0,esk7_0,esk8_0,esk4_0,esk5_0)),esk10_13(esk1_0,esk7_0,esk6_0,esk3_0,esk2_0,esk3_0,esk4_0,esk5_0,esk6_0,esk7_0,esk8_0,esk4_0,esk5_0)),
inference(spm,[status(thm)],[c_0_50,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
present(esk5_0,esk9_1(esk10_13(esk1_0,esk7_0,esk6_0,esk3_0,esk2_0,esk3_0,esk4_0,esk5_0,esk6_0,esk7_0,esk8_0,esk4_0,esk5_0))),
inference(spm,[status(thm)],[c_0_32,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
smoke(esk5_0,esk9_1(esk10_13(esk1_0,esk7_0,esk6_0,esk3_0,esk2_0,esk3_0,esk4_0,esk5_0,esk6_0,esk7_0,esk8_0,esk4_0,esk5_0))),
inference(spm,[status(thm)],[c_0_34,c_0_55]) ).
cnf(c_0_60,negated_conjecture,
( ~ present(esk5_0,X1)
| ~ agent(esk5_0,X1,esk7_0)
| ~ smoke(esk5_0,X1) ),
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(rw,[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(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_56,c_0_57]),c_0_17]),c_0_22]),c_0_58]),c_0_48]),c_0_23]),c_0_30]),c_0_16]),c_0_44]),c_0_49]),c_0_26]),c_0_59]),c_0_31]),c_0_24]),c_0_18]),c_0_19]),c_0_47]),c_0_40]),c_0_43])]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_36]),c_0_53]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP257+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n020.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 : Fri May 3 08:33:01 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.nZ3s0N1HXH/E---3.1_21118.p
% 0.20/0.54 # Version: 3.1.0
% 0.20/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 21224 completed with status 0
% 0.20/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.54 # No SInE strategy applied
% 0.20/0.54 # Search class: FHHSF-FFMM33-SFFFFFNN
% 0.20/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.54 # Starting sh5l with 136s (1) cores
% 0.20/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 21234 completed with status 0
% 0.20/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.54 # No SInE strategy applied
% 0.20/0.54 # Search class: FHHSF-FFMM33-SFFFFFNN
% 0.20/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.54 # Preprocessing time : 0.005 s
% 0.20/0.54 # Presaturation interreduction done
% 0.20/0.54
% 0.20/0.54 # Proof found!
% 0.20/0.54 # SZS status Theorem
% 0.20/0.54 # SZS output start CNFRefutation
% See solution above
% 0.20/0.54 # Parsed axioms : 72
% 0.20/0.54 # Removed by relevancy pruning/SinE : 0
% 0.20/0.54 # Initial clauses : 96
% 0.20/0.54 # Removed in clause preprocessing : 0
% 0.20/0.54 # Initial clauses in saturation : 96
% 0.20/0.54 # Processed clauses : 481
% 0.20/0.54 # ...of these trivial : 4
% 0.20/0.54 # ...subsumed : 0
% 0.20/0.54 # ...remaining for further processing : 477
% 0.20/0.54 # Other redundant clauses eliminated : 0
% 0.20/0.54 # Clauses deleted for lack of memory : 0
% 0.20/0.54 # Backward-subsumed : 0
% 0.20/0.54 # Backward-rewritten : 0
% 0.20/0.54 # Generated clauses : 363
% 0.20/0.54 # ...of the previous two non-redundant : 294
% 0.20/0.54 # ...aggressively subsumed : 0
% 0.20/0.54 # Contextual simplify-reflections : 11
% 0.20/0.54 # Paramodulations : 363
% 0.20/0.54 # Factorizations : 0
% 0.20/0.54 # NegExts : 0
% 0.20/0.54 # Equation resolutions : 0
% 0.20/0.54 # Disequality decompositions : 0
% 0.20/0.54 # Total rewrite steps : 128
% 0.20/0.54 # ...of those cached : 32
% 0.20/0.54 # Propositional unsat checks : 0
% 0.20/0.54 # Propositional check models : 0
% 0.20/0.54 # Propositional check unsatisfiable : 0
% 0.20/0.54 # Propositional clauses : 0
% 0.20/0.54 # Propositional clauses after purity: 0
% 0.20/0.54 # Propositional unsat core size : 0
% 0.20/0.54 # Propositional preprocessing time : 0.000
% 0.20/0.54 # Propositional encoding time : 0.000
% 0.20/0.54 # Propositional solver time : 0.000
% 0.20/0.54 # Success case prop preproc time : 0.000
% 0.20/0.54 # Success case prop encoding time : 0.000
% 0.20/0.54 # Success case prop solver time : 0.000
% 0.20/0.54 # Current number of processed clauses : 382
% 0.20/0.54 # Positive orientable unit clauses : 197
% 0.20/0.54 # Positive unorientable unit clauses: 0
% 0.20/0.54 # Negative unit clauses : 32
% 0.20/0.54 # Non-unit-clauses : 153
% 0.20/0.54 # Current number of unprocessed clauses: 3
% 0.20/0.54 # ...number of literals in the above : 37
% 0.20/0.54 # Current number of archived formulas : 0
% 0.20/0.54 # Current number of archived clauses : 95
% 0.20/0.54 # Clause-clause subsumption calls (NU) : 35131
% 0.20/0.54 # Rec. Clause-clause subsumption calls : 5070
% 0.20/0.54 # Non-unit clause-clause subsumptions : 11
% 0.20/0.54 # Unit Clause-clause subsumption calls : 5419
% 0.20/0.54 # Rewrite failures with RHS unbound : 0
% 0.20/0.54 # BW rewrite match attempts : 0
% 0.20/0.54 # BW rewrite match successes : 0
% 0.20/0.54 # Condensation attempts : 0
% 0.20/0.54 # Condensation successes : 0
% 0.20/0.54 # Termbank termtop insertions : 14971
% 0.20/0.54 # Search garbage collected termcells : 1852
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.042 s
% 0.20/0.54 # System time : 0.009 s
% 0.20/0.54 # Total time : 0.050 s
% 0.20/0.54 # Maximum resident set size: 2256 pages
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.198 s
% 0.20/0.54 # System time : 0.025 s
% 0.20/0.54 # Total time : 0.223 s
% 0.20/0.54 # Maximum resident set size: 1812 pages
% 0.20/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------