TSTP Solution File: KRS096+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS096+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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.46s 2.17s
% Output : CNFRefutation 4.46s
% 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 : 39 ( 4 equ; 24 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 21 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_17,plain,
( X1 = X2
| ~ cUnsatisfiable(X3)
| ~ rr(X3,X2)
| ~ rr(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ilme8oso/input.p',i_0_17) ).
cnf(i_0_19,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ilme8oso/input.p',i_0_19) ).
cnf(i_0_22,plain,
( ~ cc(X1)
| ~ cd(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ilme8oso/input.p',i_0_22) ).
cnf(i_0_18,plain,
( cd(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ilme8oso/input.p',i_0_18) ).
cnf(i_0_21,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ilme8oso/input.p',i_0_21) ).
cnf(i_0_20,plain,
( cc(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ilme8oso/input.p',i_0_20) ).
cnf(i_0_23,plain,
cUnsatisfiable(i2003_11_14_17_20_18265),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ilme8oso/input.p',i_0_23) ).
cnf(c_0_31,plain,
( X1 = X2
| ~ cUnsatisfiable(X3)
| ~ rr(X3,X2)
| ~ rr(X3,X1) ),
i_0_17 ).
cnf(c_0_32,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_19 ).
cnf(c_0_33,plain,
( ~ cc(X1)
| ~ cd(X1) ),
i_0_22 ).
cnf(c_0_34,plain,
( cd(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_18 ).
cnf(c_0_35,plain,
( X1 = esk2_1(X2)
| ~ rr(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_21 ).
cnf(c_0_37,plain,
( ~ cc(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( cc(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_20 ).
cnf(c_0_40,plain,
cUnsatisfiable(i2003_11_14_17_20_18265),
i_0_23 ).
cnf(c_0_41,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_42,plain,
$false,
inference(sr,[status(thm)],[c_0_40,c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS096+1 : TPTP v8.1.0. Released v3.1.0.
% 0.00/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n024.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Tue Jun 7 15:53:06 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected complete mode:
% 4.46/2.17 # ENIGMATIC: Solved by autoschedule:
% 4.46/2.17 # No SInE strategy applied
% 4.46/2.17 # Trying AutoSched0 for 150 seconds
% 4.46/2.17 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 4.46/2.17 # and selection function SelectCQPrecWNTNp.
% 4.46/2.17 #
% 4.46/2.17 # Preprocessing time : 0.023 s
% 4.46/2.17
% 4.46/2.17 # Proof found!
% 4.46/2.17 # SZS status Theorem
% 4.46/2.17 # SZS output start CNFRefutation
% See solution above
% 4.46/2.17 # Training examples: 0 positive, 0 negative
% 4.46/2.17
% 4.46/2.17 # -------------------------------------------------
% 4.46/2.17 # User time : 0.024 s
% 4.46/2.17 # System time : 0.005 s
% 4.46/2.17 # Total time : 0.030 s
% 4.46/2.17 # Maximum resident set size: 7120 pages
% 4.46/2.17
%------------------------------------------------------------------------------