%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS107+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:38 EDT 2022
% Result : Unsatisfiable 4.34s 2.21s
% Output : CNFRefutation 4.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 36 ( 4 unt; 0 nHn; 36 RR)
% Number of literals : 76 ( 4 equ; 46 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 46 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_66,plain,
( rrx(X1,X2)
| ~ rrx3(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6pnx073i/input.p',i_0_66) ).
cnf(i_0_42,plain,
( rrx3(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6pnx073i/input.p',i_0_42) ).
cnf(i_0_52,plain,
( ~ ca_Cx1xcomp(X1)
| ~ ra_Px1(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6pnx073i/input.p',i_0_52) ).
cnf(i_0_47,plain,
( ra_Px1(X1,esk3_1(X1))
| ~ ca_Cx1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6pnx073i/input.p',i_0_47) ).
cnf(i_0_53,plain,
( X1 = X2
| ~ rrx(X3,X2)
| ~ rrx(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6pnx073i/input.p',i_0_53) ).
cnf(i_0_63,plain,
( rrx(X1,X2)
| ~ rrx4(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6pnx073i/input.p',i_0_63) ).
cnf(i_0_40,plain,
( rrx4(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6pnx073i/input.p',i_0_40) ).
cnf(i_0_38,plain,
( ca_Cx1(X1)
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6pnx073i/input.p',i_0_38) ).
cnf(i_0_43,plain,
( ca_Ax2(X1)
| ~ cc1(X1)
| ~ cc2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6pnx073i/input.p',i_0_43) ).
cnf(i_0_39,plain,
( cc2(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6pnx073i/input.p',i_0_39) ).
cnf(i_0_48,plain,
( ca_Cx1xcomp(X1)
| ~ ca_Ax2(X2)
| ~ rrx3(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6pnx073i/input.p',i_0_48) ).
cnf(i_0_41,plain,
( cc1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6pnx073i/input.p',i_0_41) ).
cnf(i_0_58,plain,
cUnsatisfiable(i2003_11_14_17_21_01226),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6pnx073i/input.p',i_0_58) ).
cnf(c_0_80,plain,
( rrx(X1,X2)
| ~ rrx3(X1,X2) ),
i_0_66 ).
cnf(c_0_81,plain,
( rrx3(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_42 ).
cnf(c_0_82,plain,
( ~ ca_Cx1xcomp(X1)
| ~ ra_Px1(X1,X2) ),
i_0_52 ).
cnf(c_0_83,plain,
( ra_Px1(X1,esk3_1(X1))
| ~ ca_Cx1(X1) ),
i_0_47 ).
cnf(c_0_84,plain,
( X1 = X2
| ~ rrx(X3,X2)
| ~ rrx(X3,X1) ),
i_0_53 ).
cnf(c_0_85,plain,
( rrx(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_86,plain,
( rrx(X1,X2)
| ~ rrx4(X1,X2) ),
i_0_63 ).
cnf(c_0_87,plain,
( rrx4(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_40 ).
cnf(c_0_88,plain,
( ~ ca_Cx1xcomp(X1)
| ~ ca_Cx1(X1) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_89,plain,
( ca_Cx1(X1)
| ~ cUnsatisfiable(X1) ),
i_0_38 ).
cnf(c_0_90,plain,
( ca_Ax2(X1)
| ~ cc1(X1)
| ~ cc2(X1) ),
i_0_43 ).
cnf(c_0_91,plain,
( cc2(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_39 ).
cnf(c_0_92,plain,
( X1 = esk1_1(X2)
| ~ rrx(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_93,plain,
( rrx(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_94,plain,
( ca_Cx1xcomp(X1)
| ~ ca_Ax2(X2)
| ~ rrx3(X1,X2) ),
i_0_48 ).
cnf(c_0_95,plain,
( ~ ca_Cx1xcomp(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_96,plain,
( ca_Ax2(esk2_1(X1))
| ~ cc1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_97,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_98,plain,
( cc1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_41 ).
cnf(c_0_99,plain,
( ~ ca_Ax2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_81]),c_0_95]) ).
cnf(c_0_100,plain,
cUnsatisfiable(i2003_11_14_17_21_01226),
i_0_58 ).
cnf(c_0_101,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_98]),c_0_99]) ).
cnf(c_0_102,plain,
$false,
inference(sr,[status(thm)],[c_0_100,c_0_101]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS107+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n024.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 : Tue Jun 7 09:54:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 4.34/2.21 # ENIGMATIC: Solved by autoschedule:
% 4.34/2.21 # No SInE strategy applied
% 4.34/2.21 # Trying AutoSched0 for 150 seconds
% 4.34/2.21 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 4.34/2.21 # and selection function SelectCQPrecWNTNp.
% 4.34/2.21 #
% 4.34/2.21 # Preprocessing time : 0.012 s
% 4.34/2.21
% 4.34/2.21 # Proof found!
% 4.34/2.21 # SZS status Theorem
% 4.34/2.21 # SZS output start CNFRefutation
% See solution above
% 4.34/2.21 # Training examples: 0 positive, 0 negative
% 4.34/2.21
% 4.34/2.21 # -------------------------------------------------
% 4.34/2.21 # User time : 0.014 s
% 4.34/2.21 # System time : 0.003 s
% 4.34/2.21 # Total time : 0.017 s
% 4.34/2.21 # Maximum resident set size: 7120 pages
% 4.34/2.21
%------------------------------------------------------------------------------