TSTP Solution File: KRS114+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS114+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:39 EDT 2022
% Result : Unsatisfiable 4.47s 2.19s
% Output : CNFRefutation 4.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 36 ( 4 unt; 0 nHn; 36 RR)
% Number of literals : 76 ( 4 equ; 47 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 44 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_33,plain,
( ~ cp(X1)
| ~ ra_Px1(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_ou9qxof/lgb.p',i_0_33) ).
cnf(i_0_35,plain,
( ra_Px1(X1,esk4_1(X1))
| ~ cpxcomp(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_ou9qxof/lgb.p',i_0_35) ).
cnf(i_0_41,plain,
( cpxcomp(X1)
| ~ ca_Ax3(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_ou9qxof/lgb.p',i_0_41) ).
cnf(i_0_51,plain,
( cp(X1)
| ~ ca_Vx5(X2)
| ~ rs(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_ou9qxof/lgb.p',i_0_51) ).
cnf(i_0_29,plain,
( rs(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_ou9qxof/lgb.p',i_0_29) ).
cnf(i_0_28,plain,
( ca_Ax3(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_ou9qxof/lgb.p',i_0_28) ).
cnf(i_0_48,plain,
( X1 = X2
| ~ ca_Ax4(X3)
| ~ rinvR(X3,X2)
| ~ rinvR(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_ou9qxof/lgb.p',i_0_48) ).
cnf(i_0_47,plain,
( rinvR(X1,esk7_1(X1))
| ~ ca_Ax4(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_ou9qxof/lgb.p',i_0_47) ).
cnf(i_0_52,plain,
( rinvR(X1,X2)
| ~ rr(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_ou9qxof/lgb.p',i_0_52) ).
cnf(i_0_31,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_ou9qxof/lgb.p',i_0_31) ).
cnf(i_0_46,plain,
( ca_Vx5(esk7_1(X1))
| ~ ca_Ax4(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_ou9qxof/lgb.p',i_0_46) ).
cnf(i_0_30,plain,
( ca_Ax4(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_ou9qxof/lgb.p',i_0_30) ).
cnf(i_0_54,plain,
cUnsatisfiable(i2003_11_14_17_21_262),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_ou9qxof/lgb.p',i_0_54) ).
cnf(c_0_68,plain,
( ~ cp(X1)
| ~ ra_Px1(X1,X2) ),
i_0_33 ).
cnf(c_0_69,plain,
( ra_Px1(X1,esk4_1(X1))
| ~ cpxcomp(X1) ),
i_0_35 ).
cnf(c_0_70,plain,
( ~ cp(X1)
| ~ cpxcomp(X1) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_71,plain,
( cpxcomp(X1)
| ~ ca_Ax3(X1) ),
i_0_41 ).
cnf(c_0_72,plain,
( cp(X1)
| ~ ca_Vx5(X2)
| ~ rs(X2,X1) ),
i_0_51 ).
cnf(c_0_73,plain,
( rs(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_29 ).
cnf(c_0_74,plain,
( ~ cp(X1)
| ~ ca_Ax3(X1) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_75,plain,
( cp(esk2_1(X1))
| ~ ca_Vx5(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_76,plain,
( ca_Ax3(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_28 ).
cnf(c_0_77,plain,
( X1 = X2
| ~ ca_Ax4(X3)
| ~ rinvR(X3,X2)
| ~ rinvR(X3,X1) ),
i_0_48 ).
cnf(c_0_78,plain,
( rinvR(X1,esk7_1(X1))
| ~ ca_Ax4(X1) ),
i_0_47 ).
cnf(c_0_79,plain,
( rinvR(X1,X2)
| ~ rr(X2,X1) ),
i_0_52 ).
cnf(c_0_80,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_31 ).
cnf(c_0_81,plain,
( ~ ca_Vx5(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]) ).
cnf(c_0_82,plain,
( ca_Vx5(esk7_1(X1))
| ~ ca_Ax4(X1) ),
i_0_46 ).
cnf(c_0_83,plain,
( X1 = esk7_1(X2)
| ~ ca_Ax4(X2)
| ~ rinvR(X2,X1) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_84,plain,
( rinvR(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_85,plain,
( ca_Ax4(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_30 ).
cnf(c_0_86,plain,
( ~ cUnsatisfiable(esk7_1(X1))
| ~ ca_Ax4(X1) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_87,plain,
( esk7_1(esk1_1(X1)) = X1
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]) ).
cnf(c_0_88,plain,
cUnsatisfiable(i2003_11_14_17_21_262),
i_0_54 ).
cnf(c_0_89,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_85]) ).
cnf(c_0_90,plain,
$false,
inference(sr,[status(thm)],[c_0_88,c_0_89]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS114+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 7 07:18:22 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 4.47/2.19 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.47/2.19 # No SInE strategy applied
% 4.47/2.19 # Trying AutoSched0 for 150 seconds
% 4.47/2.19 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 4.47/2.19 # and selection function SelectCQPrecWNTNp.
% 4.47/2.19 #
% 4.47/2.19 # Preprocessing time : 0.012 s
% 4.47/2.19
% 4.47/2.19 # Proof found!
% 4.47/2.19 # SZS status Theorem
% 4.47/2.19 # SZS output start CNFRefutation
% See solution above
% 4.47/2.19 # Training examples: 0 positive, 0 negative
% 4.47/2.19
% 4.47/2.19 # -------------------------------------------------
% 4.47/2.19 # User time : 0.011 s
% 4.47/2.19 # System time : 0.008 s
% 4.47/2.19 # Total time : 0.019 s
% 4.47/2.19 # Maximum resident set size: 7124 pages
% 4.47/2.19
%------------------------------------------------------------------------------