TSTP Solution File: PUZ001+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PUZ001+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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 : 600s
% DateTime : Mon Jul 18 18:07:51 EDT 2022
% Result : Theorem 7.86s 2.37s
% Output : CNFRefutation 7.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 44 ( 20 unt; 14 nHn; 37 RR)
% Number of literals : 81 ( 31 equ; 31 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 19 ( 19 usr; 13 con; 0-3 aty)
% Number of variables : 51 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_11,plain,
( X1 = 'AuntAgatha'
| X1 = 'Butler'
| X1 = 'Charles'
| ~ predicate1(X2,live,X1)
| ~ modifier_pp(X2,in,'DreadburyMansion') ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctvuf82r/lgb.p',i_0_11) ).
cnf(i_0_13,plain,
modifier_pp(esk2_0,in,'DreadburyMansion'),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctvuf82r/lgb.p',i_0_13) ).
cnf(i_0_8,plain,
( ~ predicate2(X1,hate,'Charles',X2)
| ~ predicate2(X3,hate,'AuntAgatha',X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctvuf82r/lgb.p',i_0_8) ).
cnf(i_0_6,plain,
( X1 = 'Butler'
| predicate2(esk5_1(X1),hate,'AuntAgatha',X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctvuf82r/lgb.p',i_0_6) ).
cnf(i_0_14,plain,
predicate1(esk2_0,live,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctvuf82r/lgb.p',i_0_14) ).
cnf(i_0_2,plain,
~ predicate2(X1,hate,X2,esk9_1(X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctvuf82r/lgb.p',i_0_2) ).
cnf(i_0_4,plain,
( esk6_1(X1) = X1
| predicate2(esk7_1(X1),hate,'Butler',X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctvuf82r/lgb.p',i_0_4) ).
cnf(i_0_10,plain,
( predicate2(esk4_3(X1,X2,X3),hate,X1,X2)
| ~ predicate2(X3,kill,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctvuf82r/lgb.p',i_0_10) ).
cnf(i_0_12,plain,
predicate2(esk3_0,kill,esk1_0,'AuntAgatha'),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctvuf82r/lgb.p',i_0_12) ).
cnf(i_0_9,plain,
( X1 != X2
| ~ predicate2(X3,kill,X1,X4)
| ~ property2(X2,rich,comp_than,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctvuf82r/lgb.p',i_0_9) ).
cnf(i_0_5,plain,
( predicate2(esk7_1(X1),hate,'Butler',X1)
| property2(esk6_1(X1),rich,comp_than,'AuntAgatha') ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctvuf82r/lgb.p',i_0_5) ).
cnf(i_0_3,plain,
( predicate2(esk8_2(X1,X2),hate,'Butler',X1)
| ~ predicate2(X2,hate,'AuntAgatha',X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctvuf82r/lgb.p',i_0_3) ).
cnf(i_0_1,plain,
'Butler' != 'AuntAgatha',
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctvuf82r/lgb.p',i_0_1) ).
cnf(i_0_15,negated_conjecture,
~ predicate2(X1,kill,'AuntAgatha','AuntAgatha'),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctvuf82r/lgb.p',i_0_15) ).
cnf(c_0_30,plain,
( X1 = 'AuntAgatha'
| X1 = 'Butler'
| X1 = 'Charles'
| ~ predicate1(X2,live,X1)
| ~ modifier_pp(X2,in,'DreadburyMansion') ),
i_0_11 ).
cnf(c_0_31,plain,
modifier_pp(esk2_0,in,'DreadburyMansion'),
i_0_13 ).
cnf(c_0_32,plain,
( ~ predicate2(X1,hate,'Charles',X2)
| ~ predicate2(X3,hate,'AuntAgatha',X2) ),
i_0_8 ).
cnf(c_0_33,plain,
( X1 = 'Butler'
| predicate2(esk5_1(X1),hate,'AuntAgatha',X1) ),
i_0_6 ).
cnf(c_0_34,plain,
( X1 = 'Charles'
| X1 = 'AuntAgatha'
| X1 = 'Butler'
| ~ predicate1(esk2_0,live,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
predicate1(esk2_0,live,esk1_0),
i_0_14 ).
cnf(c_0_36,plain,
~ predicate2(X1,hate,X2,esk9_1(X2)),
i_0_2 ).
cnf(c_0_37,plain,
( esk6_1(X1) = X1
| predicate2(esk7_1(X1),hate,'Butler',X1) ),
i_0_4 ).
cnf(c_0_38,plain,
( X1 = 'Butler'
| ~ predicate2(X2,hate,'Charles',X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
( esk1_0 = 'Butler'
| esk1_0 = 'AuntAgatha'
| 'Charles' = esk1_0 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
( predicate2(esk4_3(X1,X2,X3),hate,X1,X2)
| ~ predicate2(X3,kill,X1,X2) ),
i_0_10 ).
cnf(c_0_41,plain,
predicate2(esk3_0,kill,esk1_0,'AuntAgatha'),
i_0_12 ).
cnf(c_0_42,plain,
( X1 != X2
| ~ predicate2(X3,kill,X1,X4)
| ~ property2(X2,rich,comp_than,X4) ),
i_0_9 ).
cnf(c_0_43,plain,
( predicate2(esk7_1(X1),hate,'Butler',X1)
| property2(esk6_1(X1),rich,comp_than,'AuntAgatha') ),
i_0_5 ).
cnf(c_0_44,plain,
esk6_1(esk9_1('Butler')) = esk9_1('Butler'),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,plain,
( predicate2(esk8_2(X1,X2),hate,'Butler',X1)
| ~ predicate2(X2,hate,'AuntAgatha',X1) ),
i_0_3 ).
cnf(c_0_46,plain,
( esk1_0 = 'AuntAgatha'
| esk1_0 = 'Butler'
| X1 = 'Butler'
| ~ predicate2(X2,hate,esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_47,plain,
predicate2(esk4_3(esk1_0,'AuntAgatha',esk3_0),hate,esk1_0,'AuntAgatha'),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,plain,
'Butler' != 'AuntAgatha',
i_0_1 ).
cnf(c_0_49,plain,
( ~ property2(X1,rich,comp_than,X2)
| ~ predicate2(X3,kill,X1,X2) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_50,plain,
property2(esk9_1('Butler'),rich,comp_than,'AuntAgatha'),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_36]) ).
cnf(c_0_51,plain,
( X1 = 'Butler'
| predicate2(esk8_2(X1,esk5_1(X1)),hate,'Butler',X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_33]) ).
cnf(c_0_52,plain,
( esk1_0 = 'Butler'
| esk1_0 = 'AuntAgatha' ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_53,plain,
~ predicate2(X1,kill,esk9_1('Butler'),'AuntAgatha'),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
esk9_1('Butler') = 'Butler',
inference(spm,[status(thm)],[c_0_36,c_0_51]) ).
cnf(c_0_55,plain,
( esk1_0 = 'AuntAgatha'
| predicate2(esk3_0,kill,'Butler','AuntAgatha') ),
inference(spm,[status(thm)],[c_0_41,c_0_52]) ).
cnf(c_0_56,plain,
~ predicate2(X1,kill,'Butler','AuntAgatha'),
inference(rw,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,plain,
esk1_0 = 'AuntAgatha',
inference(sr,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_58,negated_conjecture,
~ predicate2(X1,kill,'AuntAgatha','AuntAgatha'),
i_0_15 ).
cnf(c_0_59,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_57]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ001+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.33 % Computer : n029.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 : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Sun May 29 00:45:14 EDT 2022
% 0.14/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.86/2.37 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.86/2.37 # No SInE strategy applied
% 7.86/2.37 # Trying AutoSched0 for 150 seconds
% 7.86/2.37 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S002I
% 7.86/2.37 # and selection function SelectNegativeLiterals.
% 7.86/2.37 #
% 7.86/2.37 # Preprocessing time : 0.020 s
% 7.86/2.37 # Presaturation interreduction done
% 7.86/2.37
% 7.86/2.37 # Proof found!
% 7.86/2.37 # SZS status Theorem
% 7.86/2.37 # SZS output start CNFRefutation
% See solution above
% 7.86/2.37 # Training examples: 0 positive, 0 negative
% 7.86/2.37
% 7.86/2.37 # -------------------------------------------------
% 7.86/2.37 # User time : 0.023 s
% 7.86/2.37 # System time : 0.003 s
% 7.86/2.37 # Total time : 0.026 s
% 7.86/2.37 # Maximum resident set size: 7124 pages
% 7.86/2.37
%------------------------------------------------------------------------------