%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PUZ001+2 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:02:03 PM UTC 2026
% Result : Theorem 1.26s 1.71s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 35 ( 17 unt; 0 def)
% Number of atoms : 143 ( 43 equ)
% Maximal formula atoms : 37 ( 4 avg)
% Number of connectives : 156 ( 48 ~; 39 |; 53 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 4 usr; 2 prp; 0-4 aty)
% Number of functors : 19 ( 19 usr; 13 con; 0-3 aty)
% Number of variables : 109 ( 11 sgn 48 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(background,axiom,
? [X1,X2,X3] :
( $true
& predicate1(X2,live,X1)
& modifier_pp(X2,in,'DreadburyMansion')
& predicate2(X3,kill,X1,'AuntAgatha')
& ! [X4,X5] :
( ( $true
& predicate1(X5,live,X4)
& modifier_pp(X5,in,'DreadburyMansion') )
=> ( X4 = 'AuntAgatha'
| X4 = 'Butler'
| X4 = 'Charles' ) )
& ! [X6] :
( $true
=> ! [X7,X8] :
( ( $true
& predicate2(X8,kill,X6,X7) )
=> ? [X9] : predicate2(X9,hate,X6,X7) ) )
& ! [X10] :
( $true
=> ~ ? [X11,X12,X13] :
( $true
& predicate2(X12,kill,X10,X11)
& property2(X13,rich,comp_than,X11)
& X10 = X13 ) )
& ! [X14,X15] :
( ( $true
& predicate2(X15,hate,'AuntAgatha',X14) )
=> ~ ? [X16] : predicate2(X16,hate,'Charles',X14) )
& ~ ? [X17] : predicate2(X17,hate,'AuntAgatha','Butler')
& ! [X18] :
( ( $true
& X18 != 'Butler' )
=> ? [X19] : predicate2(X19,hate,'AuntAgatha',X18) )
& ! [X20] :
( ( $true
& ~ ? [X21] :
( property2(X21,rich,comp_than,'AuntAgatha')
& X20 = X21 ) )
=> ? [X22] : predicate2(X22,hate,'Butler',X20) )
& ! [X23,X24] :
( ( $true
& predicate2(X24,hate,'AuntAgatha',X23) )
=> ? [X25] : predicate2(X25,hate,'Butler',X23) )
& ! [X26] :
( $true
=> ~ ! [X27] :
( $true
=> ? [X28] : predicate2(X28,hate,X26,X27) ) )
& 'AuntAgatha' != 'Butler' ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',background) ).
fof(prove,conjecture,
? [X1] : predicate2(X1,kill,'AuntAgatha','AuntAgatha'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).
fof(c_0_2,plain,
? [X1,X2,X3] :
( predicate1(X2,live,X1)
& modifier_pp(X2,in,'DreadburyMansion')
& predicate2(X3,kill,X1,'AuntAgatha')
& ! [X4,X5] :
( ( predicate1(X5,live,X4)
& modifier_pp(X5,in,'DreadburyMansion') )
=> ( X4 = 'AuntAgatha'
| X4 = 'Butler'
| X4 = 'Charles' ) )
& ! [X6,X7,X8] :
( predicate2(X8,kill,X6,X7)
=> ? [X9] : predicate2(X9,hate,X6,X7) )
& ! [X10] :
~ ? [X11,X12,X13] :
( predicate2(X12,kill,X10,X11)
& property2(X13,rich,comp_than,X11)
& X10 = X13 )
& ! [X14,X15] :
( predicate2(X15,hate,'AuntAgatha',X14)
=> ~ ? [X16] : predicate2(X16,hate,'Charles',X14) )
& ~ ? [X17] : predicate2(X17,hate,'AuntAgatha','Butler')
& ! [X18] :
( X18 != 'Butler'
=> ? [X19] : predicate2(X19,hate,'AuntAgatha',X18) )
& ! [X20] :
( ~ ? [X21] :
( property2(X21,rich,comp_than,'AuntAgatha')
& X20 = X21 )
=> ? [X22] : predicate2(X22,hate,'Butler',X20) )
& ! [X23,X24] :
( predicate2(X24,hate,'AuntAgatha',X23)
=> ? [X25] : predicate2(X25,hate,'Butler',X23) )
& ! [X26] :
~ ! [X27] :
? [X28] : predicate2(X28,hate,X26,X27)
& 'AuntAgatha' != 'Butler' ),
inference(fof_simplification,[status(thm)],[background]) ).
fof(c_0_3,plain,
! [X61,X62,X63,X64,X65,X67,X68,X69,X70,X71,X72,X73,X74,X75,X77,X80,X81,X83,X85] :
( predicate1(esk2_0,live,esk1_0)
& modifier_pp(esk2_0,in,'DreadburyMansion')
& predicate2(esk3_0,kill,esk1_0,'AuntAgatha')
& ( ~ predicate1(X62,live,X61)
| ~ modifier_pp(X62,in,'DreadburyMansion')
| X61 = 'AuntAgatha'
| X61 = 'Butler'
| X61 = 'Charles' )
& ( ~ predicate2(X65,kill,X63,X64)
| predicate2(esk4_3(X63,X64,X65),hate,X63,X64) )
& ( ~ predicate2(X69,kill,X67,X68)
| ~ property2(X70,rich,comp_than,X68)
| X67 != X70 )
& ( ~ predicate2(X72,hate,'AuntAgatha',X71)
| ~ predicate2(X73,hate,'Charles',X71) )
& ~ predicate2(X74,hate,'AuntAgatha','Butler')
& ( X75 = 'Butler'
| predicate2(esk5_1(X75),hate,'AuntAgatha',X75) )
& ( property2(esk6_1(X77),rich,comp_than,'AuntAgatha')
| predicate2(esk7_1(X77),hate,'Butler',X77) )
& ( X77 = esk6_1(X77)
| predicate2(esk7_1(X77),hate,'Butler',X77) )
& ( ~ predicate2(X81,hate,'AuntAgatha',X80)
| predicate2(esk8_2(X80,X81),hate,'Butler',X80) )
& ~ predicate2(X85,hate,X83,esk9_1(X83))
& 'AuntAgatha' != 'Butler' ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).
cnf(c_0_4,plain,
~ predicate2(X1,hate,X2,esk9_1(X2)),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,plain,
( predicate2(esk8_2(X2,X1),hate,'Butler',X2)
| ~ predicate2(X1,hate,'AuntAgatha',X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( X2 = 'AuntAgatha'
| X2 = 'Butler'
| X2 = 'Charles'
| ~ predicate1(X1,live,X2)
| ~ modifier_pp(X1,in,'DreadburyMansion') ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
modifier_pp(esk2_0,in,'DreadburyMansion'),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,plain,
( X1 = esk6_1(X1)
| predicate2(esk7_1(X1),hate,'Butler',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,plain,
~ predicate2(X1,hate,'AuntAgatha',esk9_1('Butler')),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_10,plain,
( X1 = 'Butler'
| predicate2(esk5_1(X1),hate,'AuntAgatha',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,plain,
( ~ predicate2(X1,hate,'AuntAgatha',X2)
| ~ predicate2(X3,hate,'Charles',X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,plain,
( predicate2(esk4_3(X2,X3,X1),hate,X2,X3)
| ~ predicate2(X1,kill,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,plain,
( X1 = 'Charles'
| X1 = 'Butler'
| X1 = 'AuntAgatha'
| ~ predicate1(esk2_0,live,X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_14,plain,
predicate1(esk2_0,live,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_15,plain,
esk6_1(esk9_1('Butler')) = esk9_1('Butler'),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_16,plain,
esk9_1('Butler') = 'Butler',
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_17,plain,
( ~ predicate2(X1,hate,'AuntAgatha',X2)
| ~ predicate2(X3,kill,'Charles',X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
predicate2(esk3_0,kill,esk1_0,'AuntAgatha'),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_19,plain,
( esk1_0 = 'AuntAgatha'
| esk1_0 = 'Butler'
| esk1_0 = 'Charles' ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( ~ predicate2(X1,kill,X2,X3)
| ~ property2(X4,rich,comp_than,X3)
| X2 != X4 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_21,plain,
( property2(esk6_1(X1),rich,comp_than,'AuntAgatha')
| predicate2(esk7_1(X1),hate,'Butler',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_22,plain,
esk6_1('Butler') = 'Butler',
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_23,plain,
( X1 = 'Butler'
| ~ predicate2(X2,kill,'Charles',X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_24,plain,
( esk1_0 = 'Butler'
| esk1_0 = 'AuntAgatha'
| predicate2(esk3_0,kill,'Charles','AuntAgatha') ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
'AuntAgatha' != 'Butler',
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_26,plain,
( ~ property2(X1,rich,comp_than,X2)
| ~ predicate2(X3,kill,X1,X2) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
property2('Butler',rich,comp_than,'AuntAgatha'),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_21]),c_0_16]),c_0_22]) ).
fof(c_0_28,negated_conjecture,
~ ? [X1] : predicate2(X1,kill,'AuntAgatha','AuntAgatha'),
inference(assume_negation,[status(cth)],[prove]) ).
cnf(c_0_29,plain,
( esk1_0 = 'AuntAgatha'
| esk1_0 = 'Butler' ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_30,plain,
~ predicate2(X1,kill,'Butler','AuntAgatha'),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_31,negated_conjecture,
! [X86] : ~ predicate2(X86,kill,'AuntAgatha','AuntAgatha'),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])]) ).
cnf(c_0_32,plain,
esk1_0 = 'AuntAgatha',
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_29]),c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ predicate2(X1,kill,'AuntAgatha','AuntAgatha'),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_34,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ001+2 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n015.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 01:33:17 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.26/1.71 % Version : CSE_E---1.7
% 1.26/1.71 % Problem : theBenchmark.p
% 1.26/1.71 % SZS status Theorem for theBenchmark.p
% 1.26/1.71 % SZS output start CNFRefutation
% See solution above
% 1.26/1.71 % Total time : 1.368s
%------------------------------------------------------------------------------