TSTP Solution File: PUZ128+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PUZ128+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : 600s
% DateTime : Mon Jul 18 18:08:47 EDT 2022
% Result : Theorem 7.54s 2.41s
% Output : CNFRefutation 7.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of clauses : 50 ( 36 unt; 0 nHn; 50 RR)
% Number of literals : 98 ( 26 equ; 51 neg)
% Maximal clause size : 8 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-4 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_15,plain,
parent(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isddjf91/lgb.p',i_0_15) ).
cnf(i_0_13,plain,
esk1_0 = 'Iokaste',
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isddjf91/lgb.p',i_0_13) ).
cnf(i_0_16,negated_conjecture,
( esk6_4(X1,X2,X3,X4) = X4
| X2 != X3
| 'Iokaste' != X1
| ~ parent(X3)
| ~ parent(X1)
| ~ patricide(X2)
| ~ relation(X3,of,X4)
| ~ relation(X1,of,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isddjf91/lgb.p',i_0_16) ).
cnf(i_0_3,plain,
patricide(esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isddjf91/lgb.p',i_0_3) ).
cnf(i_0_2,plain,
esk5_0 = 'Oedipus',
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isddjf91/lgb.p',i_0_2) ).
cnf(i_0_9,plain,
parent(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isddjf91/lgb.p',i_0_9) ).
cnf(i_0_7,plain,
'Oedipus' = esk3_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isddjf91/lgb.p',i_0_7) ).
cnf(i_0_14,plain,
relation(esk1_0,of,'Oedipus'),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isddjf91/lgb.p',i_0_14) ).
cnf(i_0_17,negated_conjecture,
( patricide(esk6_4(X1,X2,X3,X4))
| X2 != X3
| 'Iokaste' != X1
| ~ parent(X3)
| ~ parent(X1)
| ~ patricide(X2)
| ~ relation(X3,of,X4)
| ~ relation(X1,of,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isddjf91/lgb.p',i_0_17) ).
cnf(i_0_6,plain,
parent(esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isddjf91/lgb.p',i_0_6) ).
cnf(i_0_4,plain,
'Polyneikes' = esk4_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isddjf91/lgb.p',i_0_4) ).
cnf(i_0_11,plain,
relation(esk2_0,of,'Polyneikes'),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isddjf91/lgb.p',i_0_11) ).
cnf(i_0_10,plain,
esk2_0 = 'Iokaste',
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isddjf91/lgb.p',i_0_10) ).
cnf(i_0_8,plain,
relation(esk3_0,of,'Polyneikes'),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isddjf91/lgb.p',i_0_8) ).
cnf(i_0_1,plain,
( 'Thersandros' != X1
| ~ patricide(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isddjf91/lgb.p',i_0_1) ).
cnf(i_0_5,plain,
relation(esk4_0,of,'Thersandros'),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isddjf91/lgb.p',i_0_5) ).
cnf(c_0_34,plain,
parent(esk1_0),
i_0_15 ).
cnf(c_0_35,plain,
esk1_0 = 'Iokaste',
i_0_13 ).
cnf(c_0_36,negated_conjecture,
( esk6_4(X1,X2,X3,X4) = X4
| X2 != X3
| 'Iokaste' != X1
| ~ parent(X3)
| ~ parent(X1)
| ~ patricide(X2)
| ~ relation(X3,of,X4)
| ~ relation(X1,of,X2) ),
i_0_16 ).
cnf(c_0_37,plain,
parent('Iokaste'),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
patricide(esk5_0),
i_0_3 ).
cnf(c_0_39,plain,
esk5_0 = 'Oedipus',
i_0_2 ).
cnf(c_0_40,plain,
parent(esk3_0),
i_0_9 ).
cnf(c_0_41,plain,
'Oedipus' = esk3_0,
i_0_7 ).
cnf(c_0_42,plain,
relation(esk1_0,of,'Oedipus'),
i_0_14 ).
cnf(c_0_43,negated_conjecture,
( patricide(esk6_4(X1,X2,X3,X4))
| X2 != X3
| 'Iokaste' != X1
| ~ parent(X3)
| ~ parent(X1)
| ~ patricide(X2)
| ~ relation(X3,of,X4)
| ~ relation(X1,of,X2) ),
i_0_17 ).
cnf(c_0_44,negated_conjecture,
( esk6_4('Iokaste',X1,X1,X2) = X2
| ~ patricide(X1)
| ~ parent(X1)
| ~ relation('Iokaste',of,X1)
| ~ relation(X1,of,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_36])]),c_0_37])]) ).
cnf(c_0_45,plain,
patricide('Oedipus'),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,plain,
parent('Oedipus'),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,plain,
relation('Iokaste',of,'Oedipus'),
inference(rw,[status(thm)],[c_0_42,c_0_35]) ).
cnf(c_0_48,negated_conjecture,
( patricide(esk6_4('Iokaste',X1,X1,X2))
| ~ patricide(X1)
| ~ parent(X1)
| ~ relation('Iokaste',of,X1)
| ~ relation(X1,of,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_43])]),c_0_37])]) ).
cnf(c_0_49,plain,
( esk6_4('Iokaste','Oedipus','Oedipus',X1) = X1
| ~ relation('Oedipus',of,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_47])]) ).
cnf(c_0_50,negated_conjecture,
( patricide(X1)
| ~ relation('Oedipus',of,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_45]),c_0_46]),c_0_47])]) ).
cnf(c_0_51,plain,
parent(esk4_0),
i_0_6 ).
cnf(c_0_52,plain,
'Polyneikes' = esk4_0,
i_0_4 ).
cnf(c_0_53,plain,
relation(esk2_0,of,'Polyneikes'),
i_0_11 ).
cnf(c_0_54,plain,
esk2_0 = 'Iokaste',
i_0_10 ).
cnf(c_0_55,plain,
relation(esk3_0,of,'Polyneikes'),
i_0_8 ).
cnf(c_0_56,negated_conjecture,
( esk6_4('Iokaste',X1,X1,X2) = X2
| ~ parent(X1)
| ~ relation('Iokaste',of,X1)
| ~ relation('Oedipus',of,X1)
| ~ relation(X1,of,X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_50]) ).
cnf(c_0_57,plain,
parent('Polyneikes'),
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,plain,
relation('Iokaste',of,'Polyneikes'),
inference(rw,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,plain,
relation('Oedipus',of,'Polyneikes'),
inference(rw,[status(thm)],[c_0_55,c_0_41]) ).
cnf(c_0_60,plain,
( esk6_4('Iokaste','Polyneikes','Polyneikes',X1) = X1
| ~ relation('Polyneikes',of,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_59])]) ).
cnf(c_0_61,plain,
( 'Thersandros' != X1
| ~ patricide(X1) ),
i_0_1 ).
cnf(c_0_62,negated_conjecture,
( patricide(X1)
| ~ patricide('Polyneikes')
| ~ relation('Polyneikes',of,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_60]),c_0_57]),c_0_58])]) ).
cnf(c_0_63,plain,
relation(esk4_0,of,'Thersandros'),
i_0_5 ).
cnf(c_0_64,plain,
~ patricide('Thersandros'),
inference(er,[status(thm)],[c_0_61]) ).
cnf(c_0_65,negated_conjecture,
( patricide(X1)
| ~ relation('Polyneikes',of,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_50]),c_0_59])]) ).
cnf(c_0_66,plain,
relation('Polyneikes',of,'Thersandros'),
inference(rw,[status(thm)],[c_0_63,c_0_52]) ).
cnf(c_0_67,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : PUZ128+2 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat May 28 21:11:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.54/2.41 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.54/2.41 # No SInE strategy applied
% 7.54/2.41 # Trying AutoSched0 for 150 seconds
% 7.54/2.41 # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S063N
% 7.54/2.41 # and selection function SelectMaxLComplexAvoidPosUPred.
% 7.54/2.41 #
% 7.54/2.41 # Preprocessing time : 0.023 s
% 7.54/2.41 # Presaturation interreduction done
% 7.54/2.41
% 7.54/2.41 # Proof found!
% 7.54/2.41 # SZS status Theorem
% 7.54/2.41 # SZS output start CNFRefutation
% See solution above
% 7.54/2.41 # Training examples: 0 positive, 0 negative
% 7.54/2.41
% 7.54/2.41 # -------------------------------------------------
% 7.54/2.41 # User time : 0.026 s
% 7.54/2.41 # System time : 0.007 s
% 7.54/2.41 # Total time : 0.032 s
% 7.54/2.41 # Maximum resident set size: 7128 pages
% 7.54/2.41
%------------------------------------------------------------------------------