TSTP Solution File: PUZ001+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : PUZ001+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n027.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 : Thu Aug 31 13:11:27 EDT 2023
% Result : Theorem 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 25
% Syntax : Number of formulae : 60 ( 18 unt; 23 typ; 0 def)
% Number of atoms : 147 ( 44 equ)
% Maximal formula atoms : 37 ( 3 avg)
% Number of connectives : 162 ( 52 ~; 41 |; 53 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 23 ( 10 >; 13 *; 0 +; 0 <<)
% 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 : 114 ( 15 sgn; 48 !; 30 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
live: $i ).
tff(decl_23,type,
predicate1: ( $i * $i * $i ) > $o ).
tff(decl_24,type,
in: $i ).
tff(decl_25,type,
'DreadburyMansion': $i ).
tff(decl_26,type,
modifier_pp: ( $i * $i * $i ) > $o ).
tff(decl_27,type,
kill: $i ).
tff(decl_28,type,
'AuntAgatha': $i ).
tff(decl_29,type,
predicate2: ( $i * $i * $i * $i ) > $o ).
tff(decl_30,type,
'Butler': $i ).
tff(decl_31,type,
'Charles': $i ).
tff(decl_32,type,
hate: $i ).
tff(decl_33,type,
rich: $i ).
tff(decl_34,type,
comp_than: $i ).
tff(decl_35,type,
property2: ( $i * $i * $i * $i ) > $o ).
tff(decl_36,type,
esk1_0: $i ).
tff(decl_37,type,
esk2_0: $i ).
tff(decl_38,type,
esk3_0: $i ).
tff(decl_39,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_40,type,
esk5_1: $i > $i ).
tff(decl_41,type,
esk6_1: $i > $i ).
tff(decl_42,type,
esk7_1: $i > $i ).
tff(decl_43,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_44,type,
esk9_1: $i > $i ).
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/sandbox/benchmark/theBenchmark.p',background) ).
fof(prove,conjecture,
? [X1] : predicate2(X1,kill,'AuntAgatha','AuntAgatha'),
file('/export/starexec/sandbox/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,
! [X32,X33,X34,X35,X36,X38,X39,X40,X41,X42,X43,X44,X45,X46,X48,X51,X52,X54,X56] :
( predicate1(esk2_0,live,esk1_0)
& modifier_pp(esk2_0,in,'DreadburyMansion')
& predicate2(esk3_0,kill,esk1_0,'AuntAgatha')
& ( ~ predicate1(X33,live,X32)
| ~ modifier_pp(X33,in,'DreadburyMansion')
| X32 = 'AuntAgatha'
| X32 = 'Butler'
| X32 = 'Charles' )
& ( ~ predicate2(X36,kill,X34,X35)
| predicate2(esk4_3(X34,X35,X36),hate,X34,X35) )
& ( ~ predicate2(X40,kill,X38,X39)
| ~ property2(X41,rich,comp_than,X39)
| X38 != X41 )
& ( ~ predicate2(X43,hate,'AuntAgatha',X42)
| ~ predicate2(X44,hate,'Charles',X42) )
& ~ predicate2(X45,hate,'AuntAgatha','Butler')
& ( X46 = 'Butler'
| predicate2(esk5_1(X46),hate,'AuntAgatha',X46) )
& ( property2(esk6_1(X48),rich,comp_than,'AuntAgatha')
| predicate2(esk7_1(X48),hate,'Butler',X48) )
& ( X48 = esk6_1(X48)
| predicate2(esk7_1(X48),hate,'Butler',X48) )
& ( ~ predicate2(X52,hate,'AuntAgatha',X51)
| predicate2(esk8_2(X51,X52),hate,'Butler',X51) )
& ~ predicate2(X56,hate,X54,esk9_1(X54))
& '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,
~ predicate2(X1,hate,'AuntAgatha',esk9_1('Butler')),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
( X1 = 'Butler'
| predicate2(esk5_1(X1),hate,'AuntAgatha',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,plain,
( ~ predicate2(X1,hate,'AuntAgatha',X2)
| ~ predicate2(X3,hate,'Charles',X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,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_10,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_11,plain,
modifier_pp(esk2_0,in,'DreadburyMansion'),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,plain,
( X1 = esk6_1(X1)
| predicate2(esk7_1(X1),hate,'Butler',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,plain,
esk9_1('Butler') = 'Butler',
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_14,plain,
( ~ predicate2(X1,hate,'AuntAgatha',X2)
| ~ predicate2(X3,kill,'Charles',X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,plain,
( X1 = 'AuntAgatha'
| X1 = 'Butler'
| X1 = 'Charles'
| ~ predicate1(esk2_0,live,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
predicate1(esk2_0,live,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_17,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_18,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_19,plain,
esk6_1('Butler') = 'Butler',
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_12]),c_0_13]),c_0_13]) ).
cnf(c_0_20,plain,
~ predicate2(X1,hate,'Butler','Butler'),
inference(spm,[status(thm)],[c_0_4,c_0_13]) ).
cnf(c_0_21,plain,
( X1 = 'Butler'
| ~ predicate2(X2,kill,'Charles',X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_7]) ).
cnf(c_0_22,plain,
( 'Charles' = esk1_0
| 'Butler' = esk1_0
| 'AuntAgatha' = esk1_0 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( ~ property2(X1,rich,comp_than,X2)
| ~ predicate2(X3,kill,X1,X2) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
property2('Butler',rich,comp_than,'AuntAgatha'),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_25,plain,
( 'AuntAgatha' = esk1_0
| 'Butler' = esk1_0
| X1 = 'Butler'
| ~ predicate2(X2,kill,esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
predicate2(esk3_0,kill,esk1_0,'AuntAgatha'),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_27,plain,
'AuntAgatha' != 'Butler',
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_28,negated_conjecture,
~ ? [X1] : predicate2(X1,kill,'AuntAgatha','AuntAgatha'),
inference(assume_negation,[status(cth)],[prove]) ).
cnf(c_0_29,plain,
~ predicate2(X1,kill,'Butler','AuntAgatha'),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( 'Butler' = esk1_0
| 'AuntAgatha' = esk1_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
fof(c_0_31,negated_conjecture,
! [X57] : ~ predicate2(X57,kill,'AuntAgatha','AuntAgatha'),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])]) ).
cnf(c_0_32,plain,
( 'AuntAgatha' = esk1_0
| ~ predicate2(X1,kill,esk1_0,'AuntAgatha') ),
inference(spm,[status(thm)],[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,
'AuntAgatha' = esk1_0,
inference(spm,[status(thm)],[c_0_32,c_0_26]) ).
cnf(c_0_35,negated_conjecture,
~ predicate2(X1,kill,esk1_0,esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_34]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ001+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n027.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 22:56:05 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.59 % Version : CSE_E---1.5
% 0.20/0.59 % Problem : theBenchmark.p
% 0.20/0.59 % Proof found
% 0.20/0.59 % SZS status Theorem for theBenchmark.p
% 0.20/0.59 % SZS output start Proof
% See solution above
% 0.20/0.60 % Total time : 0.008000 s
% 0.20/0.60 % SZS output end Proof
% 0.20/0.60 % Total time : 0.011000 s
%------------------------------------------------------------------------------