%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS075+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:32 EDT 2022
% Result : Unsatisfiable 7.21s 2.30s
% Output : CNFRefutation 7.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 4 unt; 0 nHn; 29 RR)
% Number of literals : 62 ( 10 equ; 36 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 44 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_31,plain,
( X1 = X2
| ~ rf1(X3,X2)
| ~ rf1(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0jxnwcq0/lgb.p',i_0_31) ).
cnf(i_0_40,plain,
( rf1(X1,X2)
| ~ rs(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0jxnwcq0/lgb.p',i_0_40) ).
cnf(i_0_27,plain,
( rs(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0jxnwcq0/lgb.p',i_0_27) ).
cnf(i_0_30,plain,
( X1 = X2
| ~ rf(X3,X2)
| ~ rf(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0jxnwcq0/lgb.p',i_0_30) ).
cnf(i_0_41,plain,
( rf(X1,X2)
| ~ rs(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0jxnwcq0/lgb.p',i_0_41) ).
cnf(i_0_29,plain,
( rf1(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0jxnwcq0/lgb.p',i_0_29) ).
cnf(i_0_25,plain,
( rf(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0jxnwcq0/lgb.p',i_0_25) ).
cnf(i_0_28,plain,
( ~ cUnsatisfiable(X1)
| ~ cp(esk1_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0jxnwcq0/lgb.p',i_0_28) ).
cnf(i_0_24,plain,
( cp(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0jxnwcq0/lgb.p',i_0_24) ).
cnf(i_0_39,plain,
cUnsatisfiable(i2003_11_14_17_19_02584),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0jxnwcq0/lgb.p',i_0_39) ).
cnf(c_0_52,plain,
( X1 = X2
| ~ rf1(X3,X2)
| ~ rf1(X3,X1) ),
i_0_31 ).
cnf(c_0_53,plain,
( rf1(X1,X2)
| ~ rs(X1,X2) ),
i_0_40 ).
cnf(c_0_54,plain,
( X1 = X2
| ~ rs(X3,X2)
| ~ rf1(X3,X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_55,plain,
( rs(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_27 ).
cnf(c_0_56,plain,
( X1 = X2
| ~ rf(X3,X2)
| ~ rf(X3,X1) ),
i_0_30 ).
cnf(c_0_57,plain,
( rf(X1,X2)
| ~ rs(X1,X2) ),
i_0_41 ).
cnf(c_0_58,plain,
( X1 = esk2_1(X2)
| ~ cUnsatisfiable(X2)
| ~ rf1(X2,X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
( rf1(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_29 ).
cnf(c_0_60,plain,
( X1 = X2
| ~ rf(X3,X1)
| ~ rs(X3,X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,plain,
( rf(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_25 ).
cnf(c_0_62,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,plain,
( esk3_1(X1) = X2
| ~ rs(X1,X2)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,plain,
( rs(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_62]) ).
cnf(c_0_65,plain,
( ~ cUnsatisfiable(X1)
| ~ cp(esk1_1(X1)) ),
i_0_28 ).
cnf(c_0_66,plain,
( esk1_1(X1) = esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,plain,
( cp(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_24 ).
cnf(c_0_68,plain,
cUnsatisfiable(i2003_11_14_17_19_02584),
i_0_39 ).
cnf(c_0_69,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_70,plain,
$false,
inference(sr,[status(thm)],[c_0_68,c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS075+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 7 18:23:55 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.21/2.30 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.21/2.30 # No SInE strategy applied
% 7.21/2.30 # Trying AutoSched0 for 150 seconds
% 7.21/2.30 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.21/2.30 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.21/2.30 #
% 7.21/2.30 # Preprocessing time : 0.023 s
% 7.21/2.30 # Presaturation interreduction done
% 7.21/2.30
% 7.21/2.30 # Proof found!
% 7.21/2.30 # SZS status Theorem
% 7.21/2.30 # SZS output start CNFRefutation
% See solution above
% 7.21/2.30 # Training examples: 0 positive, 0 negative
% 7.21/2.30
% 7.21/2.30 # -------------------------------------------------
% 7.21/2.30 # User time : 0.025 s
% 7.21/2.30 # System time : 0.005 s
% 7.21/2.30 # Total time : 0.030 s
% 7.21/2.30 # Maximum resident set size: 7124 pages
% 7.21/2.30
%------------------------------------------------------------------------------