TSTP Solution File: KRS110+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS110+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:38 EDT 2022
% Result : Unsatisfiable 4.42s 2.16s
% Output : CNFRefutation 4.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 4 unt; 0 nHn; 19 RR)
% Number of literals : 36 ( 0 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 20 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_33,plain,
( ~ cp(X1)
| ~ ra_Px1(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xjjkf235/input.p',i_0_33) ).
cnf(i_0_35,plain,
( ra_Px1(X1,esk4_1(X1))
| ~ cpxcomp(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xjjkf235/input.p',i_0_35) ).
cnf(i_0_29,plain,
( cpxcomp(X1)
| ~ cUnsatisfiable(X2)
| ~ rs(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xjjkf235/input.p',i_0_29) ).
cnf(i_0_31,plain,
( rs(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xjjkf235/input.p',i_0_31) ).
cnf(i_0_39,plain,
( cp(X1)
| ~ ca_Ax2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xjjkf235/input.p',i_0_39) ).
cnf(i_0_30,plain,
( ca_Ax2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xjjkf235/input.p',i_0_30) ).
cnf(i_0_49,plain,
cUnsatisfiable(i2003_11_14_17_21_12565),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xjjkf235/input.p',i_0_49) ).
cnf(c_0_57,plain,
( ~ cp(X1)
| ~ ra_Px1(X1,X2) ),
i_0_33 ).
cnf(c_0_58,plain,
( ra_Px1(X1,esk4_1(X1))
| ~ cpxcomp(X1) ),
i_0_35 ).
cnf(c_0_59,plain,
( cpxcomp(X1)
| ~ cUnsatisfiable(X2)
| ~ rs(X2,X1) ),
i_0_29 ).
cnf(c_0_60,plain,
( rs(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_31 ).
cnf(c_0_61,plain,
( ~ cpxcomp(X1)
| ~ cp(X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,plain,
( cpxcomp(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,plain,
( ~ cp(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_64,plain,
( cp(X1)
| ~ ca_Ax2(X1) ),
i_0_39 ).
cnf(c_0_65,plain,
( ca_Ax2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_30 ).
cnf(c_0_66,plain,
cUnsatisfiable(i2003_11_14_17_21_12565),
i_0_49 ).
cnf(c_0_67,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]) ).
cnf(c_0_68,plain,
$false,
inference(sr,[status(thm)],[c_0_66,c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : KRS110+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 : n025.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 07:01:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 4.42/2.16 # ENIGMATIC: Solved by autoschedule:
% 4.42/2.16 # No SInE strategy applied
% 4.42/2.16 # Trying AutoSched0 for 150 seconds
% 4.42/2.16 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 4.42/2.16 # and selection function SelectCQPrecWNTNp.
% 4.42/2.16 #
% 4.42/2.16 # Preprocessing time : 0.023 s
% 4.42/2.16
% 4.42/2.16 # Proof found!
% 4.42/2.16 # SZS status Theorem
% 4.42/2.16 # SZS output start CNFRefutation
% See solution above
% 4.42/2.16 # Training examples: 0 positive, 0 negative
% 4.42/2.16
% 4.42/2.16 # -------------------------------------------------
% 4.42/2.16 # User time : 0.026 s
% 4.42/2.16 # System time : 0.004 s
% 4.42/2.16 # Total time : 0.030 s
% 4.42/2.16 # Maximum resident set size: 7116 pages
% 4.42/2.16
%------------------------------------------------------------------------------