TSTP Solution File: KRS082+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS082+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:33 EDT 2022
% Result : Unsatisfiable 4.15s 2.06s
% Output : CNFRefutation 4.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 31 ( 4 unt; 0 nHn; 31 RR)
% Number of literals : 85 ( 0 equ; 61 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 56 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_22,plain,
( rinvP(X1,X2)
| ~ rp(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oexw5yq0/lgb.p',i_0_22) ).
cnf(i_0_14,plain,
( rp(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oexw5yq0/lgb.p',i_0_14) ).
cnf(i_0_21,plain,
( ~ cc(X1)
| ~ ca(X2)
| ~ rinvR(X1,X3)
| ~ rinvP(X3,X4)
| ~ rinvS(X4,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oexw5yq0/lgb.p',i_0_21) ).
cnf(i_0_24,plain,
( rinvR(X1,X2)
| ~ rr(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oexw5yq0/lgb.p',i_0_24) ).
cnf(i_0_11,plain,
( rr(X1,esk3_2(X2,X1))
| ~ cUnsatisfiable(X2)
| ~ rp(esk1_1(X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oexw5yq0/lgb.p',i_0_11) ).
cnf(i_0_7,plain,
( cc(X1)
| ~ cUnsatisfiable(X2)
| ~ rr(X3,X1)
| ~ rp(esk1_1(X2),X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oexw5yq0/lgb.p',i_0_7) ).
cnf(i_0_26,plain,
( rinvS(X1,X2)
| ~ rs(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oexw5yq0/lgb.p',i_0_26) ).
cnf(i_0_15,plain,
( rs(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oexw5yq0/lgb.p',i_0_15) ).
cnf(i_0_16,plain,
( ca(X1)
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oexw5yq0/lgb.p',i_0_16) ).
cnf(i_0_29,plain,
cUnsatisfiable(i2003_11_14_17_19_28752),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oexw5yq0/lgb.p',i_0_29) ).
cnf(c_0_40,plain,
( rinvP(X1,X2)
| ~ rp(X2,X1) ),
i_0_22 ).
cnf(c_0_41,plain,
( rp(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_14 ).
cnf(c_0_42,plain,
( ~ cc(X1)
| ~ ca(X2)
| ~ rinvR(X1,X3)
| ~ rinvP(X3,X4)
| ~ rinvS(X4,X2) ),
i_0_21 ).
cnf(c_0_43,plain,
( rinvP(esk2_1(X1),esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
( rinvR(X1,X2)
| ~ rr(X2,X1) ),
i_0_24 ).
cnf(c_0_45,plain,
( rr(X1,esk3_2(X2,X1))
| ~ cUnsatisfiable(X2)
| ~ rp(esk1_1(X2),X1) ),
i_0_11 ).
cnf(c_0_46,plain,
( cc(X1)
| ~ cUnsatisfiable(X2)
| ~ rr(X3,X1)
| ~ rp(esk1_1(X2),X3) ),
i_0_7 ).
cnf(c_0_47,plain,
( ~ ca(X1)
| ~ rinvR(X2,esk2_1(X3))
| ~ rinvS(esk1_1(X3),X1)
| ~ cc(X2)
| ~ cUnsatisfiable(X3) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
( rinvR(esk3_2(X1,X2),X2)
| ~ rp(esk1_1(X1),X2)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
( cc(X1)
| ~ cUnsatisfiable(X2)
| ~ rr(esk2_1(X2),X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_41]) ).
cnf(c_0_50,plain,
( ~ ca(X1)
| ~ rinvS(esk1_1(X2),X1)
| ~ cc(esk3_2(X3,esk2_1(X2)))
| ~ rp(esk1_1(X3),esk2_1(X2))
| ~ cUnsatisfiable(X2)
| ~ cUnsatisfiable(X3) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
( cc(esk3_2(X1,esk2_1(X2)))
| ~ rp(esk1_1(X1),esk2_1(X2))
| ~ cUnsatisfiable(X2)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_45]) ).
cnf(c_0_52,plain,
( ~ ca(X1)
| ~ rinvS(esk1_1(X2),X1)
| ~ rp(esk1_1(X3),esk2_1(X2))
| ~ cUnsatisfiable(X2)
| ~ cUnsatisfiable(X3) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,plain,
( rinvS(X1,X2)
| ~ rs(X2,X1) ),
i_0_26 ).
cnf(c_0_54,plain,
( rs(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_15 ).
cnf(c_0_55,plain,
( ~ ca(X1)
| ~ rinvS(esk1_1(X2),X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_41]) ).
cnf(c_0_56,plain,
( rinvS(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,plain,
( ca(X1)
| ~ cUnsatisfiable(X1) ),
i_0_16 ).
cnf(c_0_58,plain,
cUnsatisfiable(i2003_11_14_17_19_28752),
i_0_29 ).
cnf(c_0_59,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_60,plain,
$false,
inference(sr,[status(thm)],[c_0_58,c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.08 % Problem : KRS082+1 : TPTP v8.1.0. Released v3.1.0.
% 0.05/0.09 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 600
% 0.08/0.27 % DateTime : Tue Jun 7 18:20:22 EDT 2022
% 0.08/0.27 % CPUTime :
% 0.11/0.36 # ENIGMATIC: Selected complete mode:
% 4.15/2.06 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.15/2.06 # No SInE strategy applied
% 4.15/2.06 # Trying AutoSched0 for 150 seconds
% 4.15/2.06 # AutoSched0-Mode selected heuristic G_E___092_C01_F1_AE_CS_SP_PS_CO_S0Y
% 4.15/2.06 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.15/2.06 #
% 4.15/2.06 # Preprocessing time : 0.014 s
% 4.15/2.06 # Presaturation interreduction done
% 4.15/2.06
% 4.15/2.06 # Proof found!
% 4.15/2.06 # SZS status Theorem
% 4.15/2.06 # SZS output start CNFRefutation
% See solution above
% 4.15/2.06 # Training examples: 0 positive, 0 negative
% 4.15/2.06
% 4.15/2.06 # -------------------------------------------------
% 4.15/2.06 # User time : 0.018 s
% 4.15/2.06 # System time : 0.002 s
% 4.15/2.06 # Total time : 0.020 s
% 4.15/2.06 # Maximum resident set size: 7124 pages
% 4.15/2.06
%------------------------------------------------------------------------------