TSTP Solution File: KRS099+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS099+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:36 EDT 2022
% Result : Unsatisfiable 7.78s 2.28s
% Output : CNFRefutation 7.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 6 unt; 0 nHn; 15 RR)
% Number of literals : 28 ( 6 equ; 15 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_40,plain,
( rtt(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zicq8t25/input.p',i_0_40) ).
cnf(i_0_44,plain,
cUnsatisfiable(i2003_11_14_17_20_29215),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zicq8t25/input.p',i_0_44) ).
cnf(i_0_33,plain,
( X1 = X2
| ~ cUnsatisfiable(X3)
| ~ rtt(X3,X2)
| ~ rtt(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zicq8t25/input.p',i_0_33) ).
cnf(i_0_41,plain,
( rtt(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zicq8t25/input.p',i_0_41) ).
cnf(i_0_38,plain,
( esk2_1(X1) != esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zicq8t25/input.p',i_0_38) ).
cnf(c_0_50,plain,
( rtt(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_40 ).
cnf(c_0_51,plain,
cUnsatisfiable(i2003_11_14_17_20_29215),
i_0_44 ).
cnf(c_0_52,plain,
( X1 = X2
| ~ cUnsatisfiable(X3)
| ~ rtt(X3,X2)
| ~ rtt(X3,X1) ),
i_0_33 ).
cnf(c_0_53,plain,
rtt(i2003_11_14_17_20_29215,esk2_1(i2003_11_14_17_20_29215)),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,plain,
( rtt(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_41 ).
cnf(c_0_55,plain,
( X1 = esk2_1(i2003_11_14_17_20_29215)
| ~ rtt(i2003_11_14_17_20_29215,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_51])]) ).
cnf(c_0_56,plain,
rtt(i2003_11_14_17_20_29215,esk1_1(i2003_11_14_17_20_29215)),
inference(spm,[status(thm)],[c_0_54,c_0_51]) ).
cnf(c_0_57,plain,
( esk2_1(X1) != esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
i_0_38 ).
cnf(c_0_58,plain,
esk1_1(i2003_11_14_17_20_29215) = esk2_1(i2003_11_14_17_20_29215),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS099+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 : n024.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 09:06:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.78/2.28 # ENIGMATIC: Solved by autoschedule:
% 7.78/2.28 # No SInE strategy applied
% 7.78/2.28 # Trying AutoSched0 for 150 seconds
% 7.78/2.28 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 7.78/2.28 # and selection function SelectNewComplexAHP.
% 7.78/2.28 #
% 7.78/2.28 # Preprocessing time : 0.013 s
% 7.78/2.28 # Presaturation interreduction done
% 7.78/2.28
% 7.78/2.28 # Proof found!
% 7.78/2.28 # SZS status Theorem
% 7.78/2.28 # SZS output start CNFRefutation
% See solution above
% 7.78/2.28 # Training examples: 0 positive, 0 negative
% 7.78/2.28
% 7.78/2.28 # -------------------------------------------------
% 7.78/2.28 # User time : 0.014 s
% 7.78/2.28 # System time : 0.006 s
% 7.78/2.28 # Total time : 0.020 s
% 7.78/2.28 # Maximum resident set size: 7120 pages
% 7.78/2.28
%------------------------------------------------------------------------------