%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS108+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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 6.66s 2.16s
% Output : CNFRefutation 6.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 37 ( 9 unt; 0 nHn; 37 RR)
% Number of literals : 69 ( 4 equ; 38 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 36 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_99,plain,
( rr(X1,X2)
| ~ rinvR(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5grk54fy/input.p',i_0_99) ).
cnf(i_0_47,plain,
( rinvR(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5grk54fy/input.p',i_0_47) ).
cnf(i_0_53,plain,
( ~ cp2xcomp(X1)
| ~ ra_Px5(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5grk54fy/input.p',i_0_53) ).
cnf(i_0_50,plain,
( ra_Px5(X1,esk2_1(X1))
| ~ cp2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5grk54fy/input.p',i_0_50) ).
cnf(i_0_100,plain,
cUnsatisfiable(i2003_11_14_17_21_04740),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5grk54fy/input.p',i_0_100) ).
cnf(i_0_46,plain,
( ca_Ax14(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5grk54fy/input.p',i_0_46) ).
cnf(i_0_78,plain,
( cp2xcomp(X1)
| ~ ca_Cx1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5grk54fy/input.p',i_0_78) ).
cnf(i_0_48,plain,
( ca_Cx1(X1)
| ~ cp1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5grk54fy/input.p',i_0_48) ).
cnf(i_0_72,plain,
( cp1(esk10_1(X1))
| ~ ca_Ax14(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5grk54fy/input.p',i_0_72) ).
cnf(i_0_71,plain,
( X1 = X2
| ~ ca_Ax14(X3)
| ~ rr(X3,X2)
| ~ rr(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5grk54fy/input.p',i_0_71) ).
cnf(i_0_73,plain,
( rr(X1,esk10_1(X1))
| ~ ca_Ax14(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5grk54fy/input.p',i_0_73) ).
cnf(i_0_45,plain,
( cp2(X1)
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5grk54fy/input.p',i_0_45) ).
cnf(c_0_113,plain,
( rr(X1,X2)
| ~ rinvR(X2,X1) ),
i_0_99 ).
cnf(c_0_114,plain,
( rinvR(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_47 ).
cnf(c_0_115,plain,
( ~ cp2xcomp(X1)
| ~ ra_Px5(X1,X2) ),
i_0_53 ).
cnf(c_0_116,plain,
( ra_Px5(X1,esk2_1(X1))
| ~ cp2(X1) ),
i_0_50 ).
cnf(c_0_117,plain,
( rr(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_118,plain,
cUnsatisfiable(i2003_11_14_17_21_04740),
i_0_100 ).
cnf(c_0_119,plain,
( ca_Ax14(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_46 ).
cnf(c_0_120,plain,
( ~ cp2xcomp(X1)
| ~ cp2(X1) ),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_121,plain,
( cp2xcomp(X1)
| ~ ca_Cx1(X1) ),
i_0_78 ).
cnf(c_0_122,plain,
( ca_Cx1(X1)
| ~ cp1(X1) ),
i_0_48 ).
cnf(c_0_123,plain,
( cp1(esk10_1(X1))
| ~ ca_Ax14(X1) ),
i_0_72 ).
cnf(c_0_124,plain,
( X1 = X2
| ~ ca_Ax14(X3)
| ~ rr(X3,X2)
| ~ rr(X3,X1) ),
i_0_71 ).
cnf(c_0_125,plain,
rr(esk1_1(i2003_11_14_17_21_04740),i2003_11_14_17_21_04740),
inference(spm,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_126,plain,
ca_Ax14(esk1_1(i2003_11_14_17_21_04740)),
inference(spm,[status(thm)],[c_0_119,c_0_118]) ).
cnf(c_0_127,plain,
( rr(X1,esk10_1(X1))
| ~ ca_Ax14(X1) ),
i_0_73 ).
cnf(c_0_128,plain,
( ~ cp2(X1)
| ~ ca_Cx1(X1) ),
inference(spm,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_129,plain,
( cp2(X1)
| ~ cUnsatisfiable(X1) ),
i_0_45 ).
cnf(c_0_130,plain,
( ca_Cx1(esk10_1(X1))
| ~ ca_Ax14(X1) ),
inference(spm,[status(thm)],[c_0_122,c_0_123]) ).
cnf(c_0_131,plain,
( X1 = i2003_11_14_17_21_04740
| ~ rr(esk1_1(i2003_11_14_17_21_04740),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_126])]) ).
cnf(c_0_132,plain,
rr(esk1_1(i2003_11_14_17_21_04740),esk10_1(esk1_1(i2003_11_14_17_21_04740))),
inference(spm,[status(thm)],[c_0_127,c_0_126]) ).
cnf(c_0_133,plain,
( ~ ca_Cx1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_134,plain,
ca_Cx1(esk10_1(esk1_1(i2003_11_14_17_21_04740))),
inference(spm,[status(thm)],[c_0_130,c_0_126]) ).
cnf(c_0_135,plain,
esk10_1(esk1_1(i2003_11_14_17_21_04740)) = i2003_11_14_17_21_04740,
inference(spm,[status(thm)],[c_0_131,c_0_132]) ).
cnf(c_0_136,plain,
~ ca_Cx1(i2003_11_14_17_21_04740),
inference(spm,[status(thm)],[c_0_133,c_0_118]) ).
cnf(c_0_137,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_134,c_0_135]),c_0_136]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : KRS108+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n018.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 12:19:53 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected complete mode:
% 6.66/2.16 # ENIGMATIC: Solved by autoschedule:
% 6.66/2.16 # No SInE strategy applied
% 6.66/2.16 # Trying AutoSched0 for 150 seconds
% 6.66/2.16 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 6.66/2.16 # and selection function SelectNewComplexAHP.
% 6.66/2.16 #
% 6.66/2.16 # Preprocessing time : 0.013 s
% 6.66/2.16 # Presaturation interreduction done
% 6.66/2.16
% 6.66/2.16 # Proof found!
% 6.66/2.16 # SZS status Theorem
% 6.66/2.16 # SZS output start CNFRefutation
% See solution above
% 6.66/2.16 # Training examples: 0 positive, 0 negative
% 6.66/2.16
% 6.66/2.16 # -------------------------------------------------
% 6.66/2.16 # User time : 0.015 s
% 6.66/2.16 # System time : 0.004 s
% 6.66/2.16 # Total time : 0.020 s
% 6.66/2.16 # Maximum resident set size: 7120 pages
% 6.66/2.16
%------------------------------------------------------------------------------