TSTP Solution File: KRS100+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS100+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:36 EDT 2022
% Result : Unsatisfiable 4.20s 2.09s
% Output : CNFRefutation 4.20s
% 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 : 29 ( 0 equ; 19 neg)
% Maximal clause size : 4 ( 2 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 : 15 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
( ce(X1)
| ~ cUnsatisfiable(X2)
| ~ cd(X1)
| ~ rr(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-26xh_ip5/input.p',i_0_14) ).
cnf(i_0_13,plain,
( cd(X1)
| ~ cUnsatisfiable(X2)
| ~ rr(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-26xh_ip5/input.p',i_0_13) ).
cnf(i_0_12,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-26xh_ip5/input.p',i_0_12) ).
cnf(i_0_11,plain,
( ~ cUnsatisfiable(X1)
| ~ ce(esk1_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-26xh_ip5/input.p',i_0_11) ).
cnf(i_0_16,plain,
cUnsatisfiable(i2003_11_14_17_20_32704),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-26xh_ip5/input.p',i_0_16) ).
cnf(c_0_22,plain,
( ce(X1)
| ~ cUnsatisfiable(X2)
| ~ cd(X1)
| ~ rr(X2,X1) ),
i_0_14 ).
cnf(c_0_23,plain,
( cd(X1)
| ~ cUnsatisfiable(X2)
| ~ rr(X2,X1) ),
i_0_13 ).
cnf(c_0_24,plain,
( ce(X1)
| ~ rr(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(csr,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_12 ).
cnf(c_0_26,plain,
( ~ cUnsatisfiable(X1)
| ~ ce(esk1_1(X1)) ),
i_0_11 ).
cnf(c_0_27,plain,
cUnsatisfiable(i2003_11_14_17_20_32704),
i_0_16 ).
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.05/0.09 % Problem : KRS100+1 : TPTP v8.1.0. Released v3.1.0.
% 0.05/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Tue Jun 7 14:26:07 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.14/0.37 # ENIGMATIC: Selected complete mode:
% 4.20/2.09 # ENIGMATIC: Solved by autoschedule:
% 4.20/2.09 # No SInE strategy applied
% 4.20/2.09 # Trying AutoSched0 for 150 seconds
% 4.20/2.09 # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 4.20/2.09 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.20/2.09 #
% 4.20/2.09 # Preprocessing time : 0.013 s
% 4.20/2.09
% 4.20/2.09 # Proof found!
% 4.20/2.09 # SZS status Theorem
% 4.20/2.09 # SZS output start CNFRefutation
% See solution above
% 4.20/2.09 # Training examples: 0 positive, 0 negative
% 4.20/2.09
% 4.20/2.09 # -------------------------------------------------
% 4.20/2.09 # User time : 0.014 s
% 4.20/2.09 # System time : 0.003 s
% 4.20/2.09 # Total time : 0.017 s
% 4.20/2.09 # Maximum resident set size: 7120 pages
% 4.20/2.09
%------------------------------------------------------------------------------