TSTP Solution File: KRS101+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS101+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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.45s 2.27s
% Output : CNFRefutation 4.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 8 unt; 5 nHn; 25 RR)
% Number of literals : 57 ( 7 equ; 31 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_27,plain,
( rs(esk1_1(X1),esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qmwqhjhv/input.p',i_0_27) ).
cnf(i_0_33,plain,
cUnsatisfiable(i2003_11_14_17_20_36582),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qmwqhjhv/input.p',i_0_33) ).
cnf(i_0_30,plain,
( X1 = X2
| cc(X3)
| ~ cUnsatisfiable(X4)
| ~ rr(X4,X3)
| ~ rs(X3,X2)
| ~ rs(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qmwqhjhv/input.p',i_0_30) ).
cnf(i_0_28,plain,
( rs(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qmwqhjhv/input.p',i_0_28) ).
cnf(i_0_29,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qmwqhjhv/input.p',i_0_29) ).
cnf(i_0_26,plain,
( esk3_1(X1) != esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qmwqhjhv/input.p',i_0_26) ).
cnf(i_0_31,plain,
( cd(X1)
| ~ cUnsatisfiable(X2)
| ~ rr(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qmwqhjhv/input.p',i_0_31) ).
cnf(i_0_32,plain,
( ~ cc(X1)
| ~ cd(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qmwqhjhv/input.p',i_0_32) ).
cnf(c_0_42,plain,
( rs(esk1_1(X1),esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_27 ).
cnf(c_0_43,plain,
cUnsatisfiable(i2003_11_14_17_20_36582),
i_0_33 ).
cnf(c_0_44,plain,
( X1 = X2
| cc(X3)
| ~ cUnsatisfiable(X4)
| ~ rr(X4,X3)
| ~ rs(X3,X2)
| ~ rs(X3,X1) ),
i_0_30 ).
cnf(c_0_45,plain,
rs(esk1_1(i2003_11_14_17_20_36582),esk3_1(i2003_11_14_17_20_36582)),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
( rs(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_28 ).
cnf(c_0_47,plain,
( X1 = esk3_1(i2003_11_14_17_20_36582)
| cc(esk1_1(i2003_11_14_17_20_36582))
| ~ rs(esk1_1(i2003_11_14_17_20_36582),X1)
| ~ rr(X2,esk1_1(i2003_11_14_17_20_36582))
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
rs(esk1_1(i2003_11_14_17_20_36582),esk2_1(i2003_11_14_17_20_36582)),
inference(spm,[status(thm)],[c_0_46,c_0_43]) ).
cnf(c_0_49,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_29 ).
cnf(c_0_50,plain,
( esk2_1(i2003_11_14_17_20_36582) = esk3_1(i2003_11_14_17_20_36582)
| cc(esk1_1(i2003_11_14_17_20_36582))
| ~ rr(X1,esk1_1(i2003_11_14_17_20_36582))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
rr(i2003_11_14_17_20_36582,esk1_1(i2003_11_14_17_20_36582)),
inference(spm,[status(thm)],[c_0_49,c_0_43]) ).
cnf(c_0_52,plain,
( esk3_1(X1) != esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
i_0_26 ).
cnf(c_0_53,plain,
( esk2_1(i2003_11_14_17_20_36582) = esk3_1(i2003_11_14_17_20_36582)
| cc(esk1_1(i2003_11_14_17_20_36582)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_43])]) ).
cnf(c_0_54,plain,
( cd(X1)
| ~ cUnsatisfiable(X2)
| ~ rr(X2,X1) ),
i_0_31 ).
cnf(c_0_55,plain,
( ~ cc(X1)
| ~ cd(X1) ),
i_0_32 ).
cnf(c_0_56,plain,
cc(esk1_1(i2003_11_14_17_20_36582)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_43])]) ).
cnf(c_0_57,plain,
cd(esk1_1(i2003_11_14_17_20_36582)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_51]),c_0_43])]) ).
cnf(c_0_58,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : KRS101+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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 20:56:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 4.45/2.27 # ENIGMATIC: Solved by autoschedule:
% 4.45/2.27 # No SInE strategy applied
% 4.45/2.27 # Trying AutoSched0 for 150 seconds
% 4.45/2.27 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 4.45/2.27 # and selection function SelectNewComplexAHP.
% 4.45/2.27 #
% 4.45/2.27 # Preprocessing time : 0.018 s
% 4.45/2.27 # Presaturation interreduction done
% 4.45/2.27
% 4.45/2.27 # Proof found!
% 4.45/2.27 # SZS status Theorem
% 4.45/2.27 # SZS output start CNFRefutation
% See solution above
% 4.45/2.27 # Training examples: 0 positive, 0 negative
% 4.45/2.27
% 4.45/2.27 # -------------------------------------------------
% 4.45/2.27 # User time : 0.019 s
% 4.45/2.27 # System time : 0.005 s
% 4.45/2.27 # Total time : 0.024 s
% 4.45/2.27 # Maximum resident set size: 7120 pages
% 4.45/2.27
%------------------------------------------------------------------------------