%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS080+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : 600s
% DateTime : Sun Jul 17 02:55:33 EDT 2022
% Result : Unsatisfiable 7.34s 2.27s
% Output : CNFRefutation 7.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of clauses : 49 ( 4 unt; 10 nHn; 49 RR)
% Number of literals : 148 ( 51 equ; 78 neg)
% Maximal clause size : 11 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 60 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_38,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| X4 = X2
| X4 = X1
| X4 = X3
| ~ cUnsatisfiable(X5)
| ~ rr(X5,X2)
| ~ rr(X5,X1)
| ~ rr(X5,X3)
| ~ rr(X5,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d4ozqc7p/lgb.p',i_0_38) ).
cnf(i_0_30,plain,
( rr(X1,esk7_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d4ozqc7p/lgb.p',i_0_30) ).
cnf(i_0_33,plain,
( rr(X1,esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d4ozqc7p/lgb.p',i_0_33) ).
cnf(i_0_40,plain,
( rr(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d4ozqc7p/lgb.p',i_0_40) ).
cnf(i_0_48,plain,
( ~ cp1(X1)
| ~ cp4(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d4ozqc7p/lgb.p',i_0_48) ).
cnf(i_0_39,plain,
( cp4(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d4ozqc7p/lgb.p',i_0_39) ).
cnf(i_0_42,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d4ozqc7p/lgb.p',i_0_42) ).
cnf(i_0_52,plain,
( ~ cp2(X1)
| ~ cp4(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d4ozqc7p/lgb.p',i_0_52) ).
cnf(i_0_41,plain,
( cp1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d4ozqc7p/lgb.p',i_0_41) ).
cnf(i_0_54,plain,
( ~ cp3(X1)
| ~ cp4(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d4ozqc7p/lgb.p',i_0_54) ).
cnf(i_0_29,plain,
( cp2(esk7_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d4ozqc7p/lgb.p',i_0_29) ).
cnf(i_0_31,plain,
( cp3(esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d4ozqc7p/lgb.p',i_0_31) ).
cnf(i_0_49,plain,
( ~ cp1(X1)
| ~ cp2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d4ozqc7p/lgb.p',i_0_49) ).
cnf(i_0_46,plain,
( ~ cp1(X1)
| ~ cp3(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d4ozqc7p/lgb.p',i_0_46) ).
cnf(i_0_50,plain,
( ~ cp2(X1)
| ~ cp3(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d4ozqc7p/lgb.p',i_0_50) ).
cnf(i_0_56,plain,
cUnsatisfiable(i2003_11_14_17_19_21224),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d4ozqc7p/lgb.p',i_0_56) ).
cnf(c_0_73,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| X4 = X2
| X4 = X1
| X4 = X3
| ~ cUnsatisfiable(X5)
| ~ rr(X5,X2)
| ~ rr(X5,X1)
| ~ rr(X5,X3)
| ~ rr(X5,X4) ),
i_0_38 ).
cnf(c_0_74,plain,
( rr(X1,esk7_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_30 ).
cnf(c_0_75,plain,
( X1 = esk7_1(X2)
| X3 = esk7_1(X2)
| X4 = esk7_1(X2)
| X3 = X1
| X4 = X1
| X4 = X3
| ~ cUnsatisfiable(X2)
| ~ rr(X2,X1)
| ~ rr(X2,X3)
| ~ rr(X2,X4) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_76,plain,
( rr(X1,esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_33 ).
cnf(c_0_77,plain,
( esk7_1(X1) = esk6_1(X1)
| X2 = esk6_1(X1)
| X3 = esk6_1(X1)
| X2 = esk7_1(X1)
| X3 = esk7_1(X1)
| X2 = X3
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X3)
| ~ rr(X1,X2) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_78,plain,
( rr(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_40 ).
cnf(c_0_79,plain,
( ~ cp1(X1)
| ~ cp4(X1) ),
i_0_48 ).
cnf(c_0_80,plain,
( cp4(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_39 ).
cnf(c_0_81,plain,
( esk3_1(X1) = esk7_1(X1)
| esk3_1(X1) = esk6_1(X1)
| esk7_1(X1) = esk6_1(X1)
| X2 = esk3_1(X1)
| X2 = esk7_1(X1)
| X2 = esk6_1(X1)
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X2) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_82,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_42 ).
cnf(c_0_83,plain,
( ~ cp2(X1)
| ~ cp4(X1) ),
i_0_52 ).
cnf(c_0_84,plain,
( ~ cp1(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_85,plain,
( esk2_1(X1) = esk6_1(X1)
| esk2_1(X1) = esk7_1(X1)
| esk3_1(X1) = esk2_1(X1)
| esk7_1(X1) = esk6_1(X1)
| esk3_1(X1) = esk6_1(X1)
| esk3_1(X1) = esk7_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_86,plain,
( cp1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_41 ).
cnf(c_0_87,plain,
( ~ cp3(X1)
| ~ cp4(X1) ),
i_0_54 ).
cnf(c_0_88,plain,
( ~ cp2(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_83,c_0_80]) ).
cnf(c_0_89,plain,
( esk3_1(X1) = esk7_1(X1)
| esk3_1(X1) = esk6_1(X1)
| esk7_1(X1) = esk6_1(X1)
| esk2_1(X1) = esk7_1(X1)
| esk2_1(X1) = esk6_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]) ).
cnf(c_0_90,plain,
( cp2(esk7_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_29 ).
cnf(c_0_91,plain,
( ~ cp3(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_87,c_0_80]) ).
cnf(c_0_92,plain,
( esk2_1(X1) = esk6_1(X1)
| esk2_1(X1) = esk7_1(X1)
| esk7_1(X1) = esk6_1(X1)
| esk3_1(X1) = esk6_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]) ).
cnf(c_0_93,plain,
( cp3(esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_31 ).
cnf(c_0_94,plain,
( ~ cp1(X1)
| ~ cp2(X1) ),
i_0_49 ).
cnf(c_0_95,plain,
( esk7_1(X1) = esk6_1(X1)
| esk2_1(X1) = esk7_1(X1)
| esk2_1(X1) = esk6_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93]) ).
cnf(c_0_96,plain,
( ~ cp1(esk7_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_94,c_0_90]) ).
cnf(c_0_97,plain,
( ~ cp1(X1)
| ~ cp3(X1) ),
i_0_46 ).
cnf(c_0_98,plain,
( esk2_1(X1) = esk6_1(X1)
| esk7_1(X1) = esk6_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_95]),c_0_96]) ).
cnf(c_0_99,plain,
( ~ cp1(esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_97,c_0_93]) ).
cnf(c_0_100,plain,
( ~ cp2(X1)
| ~ cp3(X1) ),
i_0_50 ).
cnf(c_0_101,plain,
( esk7_1(X1) = esk6_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_98]),c_0_99]) ).
cnf(c_0_102,plain,
( ~ cp2(esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_100,c_0_93]) ).
cnf(c_0_103,plain,
cUnsatisfiable(i2003_11_14_17_19_21224),
i_0_56 ).
cnf(c_0_104,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_101]),c_0_102]) ).
cnf(c_0_105,plain,
$false,
inference(sr,[status(thm)],[c_0_103,c_0_104]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS080+1 : TPTP v8.1.0. Released v3.1.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Tue Jun 7 20:24:58 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected complete mode:
% 7.34/2.27 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.34/2.27 # No SInE strategy applied
% 7.34/2.27 # Trying AutoSched0 for 150 seconds
% 7.34/2.27 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 7.34/2.27 # and selection function SelectCQPrecWNTNp.
% 7.34/2.27 #
% 7.34/2.27 # Preprocessing time : 0.023 s
% 7.34/2.27
% 7.34/2.27 # Proof found!
% 7.34/2.27 # SZS status Theorem
% 7.34/2.27 # SZS output start CNFRefutation
% See solution above
% 7.34/2.27 # Training examples: 0 positive, 0 negative
% 7.34/2.27
% 7.34/2.27 # -------------------------------------------------
% 7.34/2.27 # User time : 0.030 s
% 7.34/2.27 # System time : 0.007 s
% 7.34/2.27 # Total time : 0.037 s
% 7.34/2.27 # Maximum resident set size: 7120 pages
% 7.34/2.27
%------------------------------------------------------------------------------