%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS126+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:41 EDT 2022
% Result : Unsatisfiable 6.33s 2.24s
% Output : CNFRefutation 6.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 4 unt; 0 nHn; 13 RR)
% Number of literals : 22 ( 0 equ; 13 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 12 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_15,plain,
( ~ cd1xcomp(X1)
| ~ ra_Px2(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d6w7p6w8/lgb.p',i_0_15) ).
cnf(i_0_13,plain,
( ra_Px2(X1,esk3_1(X1))
| ~ cd1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d6w7p6w8/lgb.p',i_0_13) ).
cnf(i_0_6,plain,
( cd1(X1)
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d6w7p6w8/lgb.p',i_0_6) ).
cnf(i_0_5,plain,
( cd1xcomp(X1)
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d6w7p6w8/lgb.p',i_0_5) ).
cnf(i_0_18,plain,
cUnsatisfiable(i2003_11_14_17_22_23554),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-d6w7p6w8/lgb.p',i_0_18) ).
cnf(c_0_24,plain,
( ~ cd1xcomp(X1)
| ~ ra_Px2(X1,X2) ),
i_0_15 ).
cnf(c_0_25,plain,
( ra_Px2(X1,esk3_1(X1))
| ~ cd1(X1) ),
i_0_13 ).
cnf(c_0_26,plain,
( ~ cd1xcomp(X1)
| ~ cd1(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
( cd1(X1)
| ~ cUnsatisfiable(X1) ),
i_0_6 ).
cnf(c_0_28,plain,
( cd1xcomp(X1)
| ~ cUnsatisfiable(X1) ),
i_0_5 ).
cnf(c_0_29,plain,
cUnsatisfiable(i2003_11_14_17_22_23554),
i_0_18 ).
cnf(c_0_30,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_31,plain,
$false,
inference(sr,[status(thm)],[c_0_29,c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS126+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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:50:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 6.33/2.24 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.33/2.24 # No SInE strategy applied
% 6.33/2.24 # Trying AutoSched0 for 150 seconds
% 6.33/2.24 # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 6.33/2.24 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.33/2.24 #
% 6.33/2.24 # Preprocessing time : 0.013 s
% 6.33/2.24
% 6.33/2.24 # Proof found!
% 6.33/2.24 # SZS status Theorem
% 6.33/2.24 # SZS output start CNFRefutation
% See solution above
% 6.33/2.24 # Training examples: 0 positive, 0 negative
% 6.33/2.24
% 6.33/2.24 # -------------------------------------------------
% 6.33/2.24 # User time : 0.015 s
% 6.33/2.24 # System time : 0.002 s
% 6.33/2.24 # Total time : 0.016 s
% 6.33/2.24 # Maximum resident set size: 7120 pages
% 6.33/2.24
%------------------------------------------------------------------------------