TSTP Solution File: KRS125+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS125+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:41 EDT 2022
% Result : Unsatisfiable 4.34s 2.16s
% Output : CNFRefutation 4.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 4 unt; 0 nHn; 22 RR)
% Number of literals : 40 ( 0 equ; 23 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 21 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
( ~ cd(X1)
| ~ ra_Px1(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l6e01e8d/input.p',i_0_12) ).
cnf(i_0_14,plain,
( ra_Px1(X1,esk2_1(X1))
| ~ cdxcomp(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l6e01e8d/input.p',i_0_14) ).
cnf(i_0_8,plain,
( cdxcomp(X1)
| ~ cc(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l6e01e8d/input.p',i_0_8) ).
cnf(i_0_19,plain,
( cc(X1)
| ~ ce3(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l6e01e8d/input.p',i_0_19) ).
cnf(i_0_20,plain,
( cd(X1)
| ~ cf(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l6e01e8d/input.p',i_0_20) ).
cnf(i_0_6,plain,
( cf(X1)
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l6e01e8d/input.p',i_0_6) ).
cnf(i_0_7,plain,
( ce3(X1)
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l6e01e8d/input.p',i_0_7) ).
cnf(i_0_21,plain,
cUnsatisfiable(i2003_11_14_17_22_17947),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l6e01e8d/input.p',i_0_21) ).
cnf(c_0_30,plain,
( ~ cd(X1)
| ~ ra_Px1(X1,X2) ),
i_0_12 ).
cnf(c_0_31,plain,
( ra_Px1(X1,esk2_1(X1))
| ~ cdxcomp(X1) ),
i_0_14 ).
cnf(c_0_32,plain,
( cdxcomp(X1)
| ~ cc(X1) ),
i_0_8 ).
cnf(c_0_33,plain,
( cc(X1)
| ~ ce3(X1) ),
i_0_19 ).
cnf(c_0_34,plain,
( ~ cd(X1)
| ~ cdxcomp(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( cdxcomp(X1)
| ~ ce3(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( cd(X1)
| ~ cf(X1) ),
i_0_20 ).
cnf(c_0_37,plain,
( cf(X1)
| ~ cUnsatisfiable(X1) ),
i_0_6 ).
cnf(c_0_38,plain,
( ~ cd(X1)
| ~ ce3(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( ce3(X1)
| ~ cUnsatisfiable(X1) ),
i_0_7 ).
cnf(c_0_40,plain,
( cd(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
cUnsatisfiable(i2003_11_14_17_22_17947),
i_0_21 ).
cnf(c_0_42,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_43,plain,
$false,
inference(sr,[status(thm)],[c_0_41,c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS125+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/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 16:40:04 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected complete mode:
% 4.34/2.16 # ENIGMATIC: Solved by autoschedule:
% 4.34/2.16 # No SInE strategy applied
% 4.34/2.16 # Trying AutoSched0 for 150 seconds
% 4.34/2.16 # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 4.34/2.16 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.34/2.16 #
% 4.34/2.16 # Preprocessing time : 0.012 s
% 4.34/2.16
% 4.34/2.16 # Proof found!
% 4.34/2.16 # SZS status Theorem
% 4.34/2.16 # SZS output start CNFRefutation
% See solution above
% 4.34/2.16 # Training examples: 0 positive, 0 negative
% 4.34/2.16
% 4.34/2.16 # -------------------------------------------------
% 4.34/2.16 # User time : 0.012 s
% 4.34/2.16 # System time : 0.005 s
% 4.34/2.16 # Total time : 0.017 s
% 4.34/2.16 # Maximum resident set size: 7120 pages
% 4.34/2.16
%------------------------------------------------------------------------------