%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS079+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 6.55s 2.19s
% Output : CNFRefutation 6.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 32 ( 4 unt; 0 nHn; 32 RR)
% Number of literals : 66 ( 9 equ; 38 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 43 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_30,plain,
( rf2(X1,X2)
| ~ rr(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gmeoi0at/lgb.p',i_0_30) ).
cnf(i_0_20,plain,
( rr(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gmeoi0at/lgb.p',i_0_20) ).
cnf(i_0_29,plain,
( rf1(X1,X2)
| ~ rr(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gmeoi0at/lgb.p',i_0_29) ).
cnf(i_0_27,plain,
( X1 = X2
| ~ rf2(X3,X2)
| ~ rf2(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gmeoi0at/lgb.p',i_0_27) ).
cnf(i_0_26,plain,
( X1 = X2
| ~ rf1(X3,X2)
| ~ rf1(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gmeoi0at/lgb.p',i_0_26) ).
cnf(i_0_24,plain,
( rf2(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gmeoi0at/lgb.p',i_0_24) ).
cnf(i_0_22,plain,
( rf1(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gmeoi0at/lgb.p',i_0_22) ).
cnf(i_0_25,plain,
( ~ cp1(X1)
| ~ cp2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gmeoi0at/lgb.p',i_0_25) ).
cnf(i_0_21,plain,
( cp1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gmeoi0at/lgb.p',i_0_21) ).
cnf(i_0_23,plain,
( cp2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gmeoi0at/lgb.p',i_0_23) ).
cnf(i_0_28,plain,
cUnsatisfiable(i2003_11_14_17_19_17492),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gmeoi0at/lgb.p',i_0_28) ).
cnf(c_0_42,plain,
( rf2(X1,X2)
| ~ rr(X1,X2) ),
i_0_30 ).
cnf(c_0_43,plain,
( rr(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_20 ).
cnf(c_0_44,plain,
( rf1(X1,X2)
| ~ rr(X1,X2) ),
i_0_29 ).
cnf(c_0_45,plain,
( X1 = X2
| ~ rf2(X3,X2)
| ~ rf2(X3,X1) ),
i_0_27 ).
cnf(c_0_46,plain,
( rf2(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,plain,
( X1 = X2
| ~ rf1(X3,X2)
| ~ rf1(X3,X1) ),
i_0_26 ).
cnf(c_0_48,plain,
( rf1(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_43]) ).
cnf(c_0_49,plain,
( X1 = esk3_1(X2)
| ~ cUnsatisfiable(X2)
| ~ rf2(X2,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
( rf2(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_24 ).
cnf(c_0_51,plain,
( X1 = esk3_1(X2)
| ~ rf1(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
( rf1(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_22 ).
cnf(c_0_53,plain,
( ~ cp1(X1)
| ~ cp2(X1) ),
i_0_25 ).
cnf(c_0_54,plain,
( cp1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_21 ).
cnf(c_0_55,plain,
( esk3_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,plain,
( esk3_1(X1) = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,plain,
( ~ cp2(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,plain,
( cp2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_23 ).
cnf(c_0_60,plain,
cUnsatisfiable(i2003_11_14_17_19_17492),
i_0_28 ).
cnf(c_0_61,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]) ).
cnf(c_0_62,plain,
$false,
inference(sr,[status(thm)],[c_0_60,c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS079+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 7 19:01:12 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 6.55/2.19 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.55/2.19 # No SInE strategy applied
% 6.55/2.19 # Trying AutoSched0 for 150 seconds
% 6.55/2.19 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.55/2.19 # and selection function SelectComplexExceptUniqMaxHorn.
% 6.55/2.19 #
% 6.55/2.19 # Preprocessing time : 0.023 s
% 6.55/2.19 # Presaturation interreduction done
% 6.55/2.19
% 6.55/2.19 # Proof found!
% 6.55/2.19 # SZS status Theorem
% 6.55/2.19 # SZS output start CNFRefutation
% See solution above
% 6.55/2.19 # Training examples: 0 positive, 0 negative
% 6.55/2.19
% 6.55/2.19 # -------------------------------------------------
% 6.55/2.19 # User time : 0.027 s
% 6.55/2.19 # System time : 0.003 s
% 6.55/2.19 # Total time : 0.030 s
% 6.55/2.19 # Maximum resident set size: 7120 pages
% 6.55/2.19
%------------------------------------------------------------------------------