TSTP Solution File: KRS116+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS116+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:39 EDT 2022
% Result : Unsatisfiable 6.92s 2.22s
% Output : CNFRefutation 6.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of clauses : 51 ( 4 unt; 0 nHn; 51 RR)
% Number of literals : 115 ( 0 equ; 68 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 68 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_56,plain,
( rinvR(X1,X2)
| ~ rr(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4c8f48sg/lgb.p',i_0_56) ).
cnf(i_0_41,plain,
( rr(X1,esk11_1(X1))
| ~ ca_Vx3(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4c8f48sg/lgb.p',i_0_41) ).
cnf(i_0_14,plain,
( ca_Vx7(X1)
| ~ cc(X2)
| ~ rinvR(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4c8f48sg/lgb.p',i_0_14) ).
cnf(i_0_47,plain,
( cc(X1)
| ~ ca_Vx5(X2)
| ~ rr(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4c8f48sg/lgb.p',i_0_47) ).
cnf(i_0_54,plain,
( rinvP(X1,X2)
| ~ rp(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4c8f48sg/lgb.p',i_0_54) ).
cnf(i_0_33,plain,
( rp(X1,esk6_1(X1))
| ~ ca_Ax2(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4c8f48sg/lgb.p',i_0_33) ).
cnf(i_0_38,plain,
( ca_Vx3(X1)
| ~ ca_Ax2(X2)
| ~ rp(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4c8f48sg/lgb.p',i_0_38) ).
cnf(i_0_37,plain,
( ca_Vx5(X1)
| ~ ca_Ax2(X2)
| ~ rp(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4c8f48sg/lgb.p',i_0_37) ).
cnf(i_0_53,plain,
( ca_Vx6(X1)
| ~ ca_Vx7(X2)
| ~ rinvP(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4c8f48sg/lgb.p',i_0_53) ).
cnf(i_0_58,plain,
( rinvS(X1,X2)
| ~ rs(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4c8f48sg/lgb.p',i_0_58) ).
cnf(i_0_7,plain,
( rs(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4c8f48sg/lgb.p',i_0_7) ).
cnf(i_0_50,plain,
( caxcomp(X1)
| ~ ca_Vx6(X2)
| ~ rinvS(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4c8f48sg/lgb.p',i_0_50) ).
cnf(i_0_6,plain,
( ca_Ax2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4c8f48sg/lgb.p',i_0_6) ).
cnf(i_0_9,plain,
( ~ ca(X1)
| ~ ra_Px1(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4c8f48sg/lgb.p',i_0_9) ).
cnf(i_0_11,plain,
( ra_Px1(X1,esk3_1(X1))
| ~ caxcomp(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4c8f48sg/lgb.p',i_0_11) ).
cnf(i_0_5,plain,
( ca(X1)
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4c8f48sg/lgb.p',i_0_5) ).
cnf(i_0_61,plain,
cUnsatisfiable(i2003_11_14_17_21_33997),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4c8f48sg/lgb.p',i_0_61) ).
cnf(c_0_79,plain,
( rinvR(X1,X2)
| ~ rr(X2,X1) ),
i_0_56 ).
cnf(c_0_80,plain,
( rr(X1,esk11_1(X1))
| ~ ca_Vx3(X1) ),
i_0_41 ).
cnf(c_0_81,plain,
( ca_Vx7(X1)
| ~ cc(X2)
| ~ rinvR(X2,X1) ),
i_0_14 ).
cnf(c_0_82,plain,
( rinvR(esk11_1(X1),X1)
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_83,plain,
( cc(X1)
| ~ ca_Vx5(X2)
| ~ rr(X2,X1) ),
i_0_47 ).
cnf(c_0_84,plain,
( rinvP(X1,X2)
| ~ rp(X2,X1) ),
i_0_54 ).
cnf(c_0_85,plain,
( rp(X1,esk6_1(X1))
| ~ ca_Ax2(X1) ),
i_0_33 ).
cnf(c_0_86,plain,
( ca_Vx7(X1)
| ~ cc(esk11_1(X1))
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_87,plain,
( cc(esk11_1(X1))
| ~ ca_Vx5(X1)
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[c_0_83,c_0_80]) ).
cnf(c_0_88,plain,
( ca_Vx3(X1)
| ~ ca_Ax2(X2)
| ~ rp(X2,X1) ),
i_0_38 ).
cnf(c_0_89,plain,
( ca_Vx5(X1)
| ~ ca_Ax2(X2)
| ~ rp(X2,X1) ),
i_0_37 ).
cnf(c_0_90,plain,
( ca_Vx6(X1)
| ~ ca_Vx7(X2)
| ~ rinvP(X2,X1) ),
i_0_53 ).
cnf(c_0_91,plain,
( rinvP(esk6_1(X1),X1)
| ~ ca_Ax2(X1) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_92,plain,
( ca_Vx7(X1)
| ~ ca_Vx5(X1)
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_93,plain,
( ca_Vx3(esk6_1(X1))
| ~ ca_Ax2(X1) ),
inference(spm,[status(thm)],[c_0_88,c_0_85]) ).
cnf(c_0_94,plain,
( ca_Vx5(esk6_1(X1))
| ~ ca_Ax2(X1) ),
inference(spm,[status(thm)],[c_0_89,c_0_85]) ).
cnf(c_0_95,plain,
( rinvS(X1,X2)
| ~ rs(X2,X1) ),
i_0_58 ).
cnf(c_0_96,plain,
( rs(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_7 ).
cnf(c_0_97,plain,
( ca_Vx6(X1)
| ~ ca_Vx7(esk6_1(X1))
| ~ ca_Ax2(X1) ),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_98,plain,
( ca_Vx7(esk6_1(X1))
| ~ ca_Ax2(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_94]) ).
cnf(c_0_99,plain,
( caxcomp(X1)
| ~ ca_Vx6(X2)
| ~ rinvS(X2,X1) ),
i_0_50 ).
cnf(c_0_100,plain,
( rinvS(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_101,plain,
( ca_Vx6(X1)
| ~ ca_Ax2(X1) ),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_102,plain,
( ca_Ax2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_6 ).
cnf(c_0_103,plain,
( ~ ca(X1)
| ~ ra_Px1(X1,X2) ),
i_0_9 ).
cnf(c_0_104,plain,
( ra_Px1(X1,esk3_1(X1))
| ~ caxcomp(X1) ),
i_0_11 ).
cnf(c_0_105,plain,
( caxcomp(X1)
| ~ ca_Vx6(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_106,plain,
( ca_Vx6(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_107,plain,
( ~ ca(X1)
| ~ caxcomp(X1) ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_108,plain,
( caxcomp(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_109,plain,
( ca(X1)
| ~ cUnsatisfiable(X1) ),
i_0_5 ).
cnf(c_0_110,plain,
cUnsatisfiable(i2003_11_14_17_21_33997),
i_0_61 ).
cnf(c_0_111,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109]) ).
cnf(c_0_112,plain,
$false,
inference(sr,[status(thm)],[c_0_110,c_0_111]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS116+1 : TPTP v8.1.0. Released v3.1.0.
% 0.00/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 17:51:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 6.92/2.22 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.92/2.22 # No SInE strategy applied
% 6.92/2.22 # Trying AutoSched0 for 150 seconds
% 6.92/2.22 # AutoSched0-Mode selected heuristic G_E___208_C47_F1_SE_CS_SP_PS_S0Y
% 6.92/2.22 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.92/2.22 #
% 6.92/2.22 # Preprocessing time : 0.013 s
% 6.92/2.22 # Presaturation interreduction done
% 6.92/2.22
% 6.92/2.22 # Proof found!
% 6.92/2.22 # SZS status Theorem
% 6.92/2.22 # SZS output start CNFRefutation
% See solution above
% 6.92/2.22 # Training examples: 0 positive, 0 negative
% 6.92/2.22
% 6.92/2.22 # -------------------------------------------------
% 6.92/2.22 # User time : 0.015 s
% 6.92/2.22 # System time : 0.004 s
% 6.92/2.22 # Total time : 0.020 s
% 6.92/2.22 # Maximum resident set size: 7132 pages
% 6.92/2.22
%------------------------------------------------------------------------------