%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS106+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:37 EDT 2022
% Result : Unsatisfiable 4.35s 2.08s
% Output : CNFRefutation 4.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 35 ( 4 unt; 0 nHn; 35 RR)
% Number of literals : 72 ( 8 equ; 42 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 48 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_32,plain,
( X1 = X2
| ~ rf1(X3,X2)
| ~ rf1(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l58lk7ei/lgb.p',i_0_32) ).
cnf(i_0_25,plain,
( rf1(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l58lk7ei/lgb.p',i_0_25) ).
cnf(i_0_36,plain,
( rf1(X1,X2)
| ~ rf3(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l58lk7ei/lgb.p',i_0_36) ).
cnf(i_0_27,plain,
( rf3(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l58lk7ei/lgb.p',i_0_27) ).
cnf(i_0_33,plain,
( X1 = X2
| ~ rf2(X3,X2)
| ~ rf2(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l58lk7ei/lgb.p',i_0_33) ).
cnf(i_0_23,plain,
( rf2(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l58lk7ei/lgb.p',i_0_23) ).
cnf(i_0_37,plain,
( rf2(X1,X2)
| ~ rf3(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l58lk7ei/lgb.p',i_0_37) ).
cnf(i_0_29,plain,
( ~ cp1(X1)
| ~ ra_Px1(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l58lk7ei/lgb.p',i_0_29) ).
cnf(i_0_31,plain,
( ra_Px1(X1,esk5_1(X1))
| ~ cp1xcomp(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l58lk7ei/lgb.p',i_0_31) ).
cnf(i_0_24,plain,
( cp1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l58lk7ei/lgb.p',i_0_24) ).
cnf(i_0_22,plain,
( cp1xcomp(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l58lk7ei/lgb.p',i_0_22) ).
cnf(i_0_35,plain,
cUnsatisfiable(i2003_11_14_17_20_57644),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l58lk7ei/lgb.p',i_0_35) ).
cnf(c_0_50,plain,
( X1 = X2
| ~ rf1(X3,X2)
| ~ rf1(X3,X1) ),
i_0_32 ).
cnf(c_0_51,plain,
( rf1(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_25 ).
cnf(c_0_52,plain,
( rf1(X1,X2)
| ~ rf3(X1,X2) ),
i_0_36 ).
cnf(c_0_53,plain,
( rf3(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_27 ).
cnf(c_0_54,plain,
( X1 = esk2_1(X2)
| ~ rf1(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,plain,
( rf1(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,plain,
( X1 = X2
| ~ rf2(X3,X2)
| ~ rf2(X3,X1) ),
i_0_33 ).
cnf(c_0_57,plain,
( rf2(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_23 ).
cnf(c_0_58,plain,
( rf2(X1,X2)
| ~ rf3(X1,X2) ),
i_0_37 ).
cnf(c_0_59,plain,
( ~ cp1(X1)
| ~ ra_Px1(X1,X2) ),
i_0_29 ).
cnf(c_0_60,plain,
( ra_Px1(X1,esk5_1(X1))
| ~ cp1xcomp(X1) ),
i_0_31 ).
cnf(c_0_61,plain,
( cp1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_24 ).
cnf(c_0_62,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_63,plain,
( X1 = esk3_1(X2)
| ~ rf2(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_64,plain,
( rf2(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_53]) ).
cnf(c_0_65,plain,
( ~ cp1(X1)
| ~ cp1xcomp(X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_66,plain,
( cp1xcomp(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_22 ).
cnf(c_0_67,plain,
( cp1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_68,plain,
( esk1_1(X1) = esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_69,plain,
( ~ cp1(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_70,plain,
cUnsatisfiable(i2003_11_14_17_20_57644),
i_0_35 ).
cnf(c_0_71,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]) ).
cnf(c_0_72,plain,
$false,
inference(sr,[status(thm)],[c_0_70,c_0_71]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : KRS106+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.11 % 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 14:23:12 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 4.35/2.08 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.35/2.08 # No SInE strategy applied
% 4.35/2.08 # Trying AutoSched0 for 150 seconds
% 4.35/2.08 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 4.35/2.08 # and selection function SelectCQPrecWNTNp.
% 4.35/2.08 #
% 4.35/2.08 # Preprocessing time : 0.022 s
% 4.35/2.08
% 4.35/2.08 # Proof found!
% 4.35/2.08 # SZS status Theorem
% 4.35/2.08 # SZS output start CNFRefutation
% See solution above
% 4.35/2.08 # Training examples: 0 positive, 0 negative
% 4.35/2.08
% 4.35/2.08 # -------------------------------------------------
% 4.35/2.08 # User time : 0.021 s
% 4.35/2.08 # System time : 0.007 s
% 4.35/2.08 # Total time : 0.029 s
% 4.35/2.08 # Maximum resident set size: 7128 pages
% 4.35/2.08
%------------------------------------------------------------------------------