%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS093+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:35 EDT 2022
% Result : Unsatisfiable 4.45s 2.19s
% Output : CNFRefutation 4.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 4 unt; 0 nHn; 16 RR)
% Number of literals : 28 ( 0 equ; 17 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 13 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( ~ cc(X1)
| ~ cd(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7816oee_/input.p',i_0_8) ).
cnf(i_0_12,plain,
( cd(X1)
| ~ cf(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7816oee_/input.p',i_0_12) ).
cnf(i_0_11,plain,
( cc(X1)
| ~ ce3(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7816oee_/input.p',i_0_11) ).
cnf(i_0_6,plain,
( ce3(X1)
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7816oee_/input.p',i_0_6) ).
cnf(i_0_7,plain,
( cf(X1)
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7816oee_/input.p',i_0_7) ).
cnf(i_0_13,plain,
cUnsatisfiable(i2003_11_14_17_20_07201),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7816oee_/input.p',i_0_13) ).
cnf(c_0_20,plain,
( ~ cc(X1)
| ~ cd(X1) ),
i_0_8 ).
cnf(c_0_21,plain,
( cd(X1)
| ~ cf(X1) ),
i_0_12 ).
cnf(c_0_22,plain,
( ~ cc(X1)
| ~ cf(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( cc(X1)
| ~ ce3(X1) ),
i_0_11 ).
cnf(c_0_24,plain,
( ~ ce3(X1)
| ~ cf(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
( ce3(X1)
| ~ cUnsatisfiable(X1) ),
i_0_6 ).
cnf(c_0_26,plain,
( cf(X1)
| ~ cUnsatisfiable(X1) ),
i_0_7 ).
cnf(c_0_27,plain,
cUnsatisfiable(i2003_11_14_17_20_07201),
i_0_13 ).
cnf(c_0_28,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS093+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n017.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 18:12:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 4.45/2.19 # ENIGMATIC: Solved by autoschedule:
% 4.45/2.19 # No SInE strategy applied
% 4.45/2.19 # Trying AutoSched0 for 150 seconds
% 4.45/2.19 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 4.45/2.19 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.45/2.19 #
% 4.45/2.19 # Preprocessing time : 0.012 s
% 4.45/2.19
% 4.45/2.19 # Proof found!
% 4.45/2.19 # SZS status Theorem
% 4.45/2.19 # SZS output start CNFRefutation
% See solution above
% 4.45/2.19 # Training examples: 0 positive, 0 negative
% 4.45/2.19
% 4.45/2.19 # -------------------------------------------------
% 4.45/2.19 # User time : 0.014 s
% 4.45/2.19 # System time : 0.001 s
% 4.45/2.19 # Total time : 0.015 s
% 4.45/2.19 # Maximum resident set size: 7120 pages
% 4.45/2.19
%------------------------------------------------------------------------------