TSTP Solution File: KRS120+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS120+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:40 EDT 2022
% Result : Unsatisfiable 4.38s 2.09s
% Output : CNFRefutation 4.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 37 ( 5 unt; 0 nHn; 37 RR)
% Number of literals : 75 ( 4 equ; 46 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 45 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_28,plain,
( ~ cp1(X1)
| ~ ra_Px1(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epqw0rz7/lgb.p',i_0_28) ).
cnf(i_0_30,plain,
( ra_Px1(X1,esk3_1(X1))
| ~ cp1xcomp(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epqw0rz7/lgb.p',i_0_30) ).
cnf(i_0_36,plain,
( cp1xcomp(esk5_1(X1))
| ~ ca_Vx3(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epqw0rz7/lgb.p',i_0_36) ).
cnf(i_0_38,plain,
( X1 = X2
| ~ rf(X3,X2)
| ~ rf(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epqw0rz7/lgb.p',i_0_38) ).
cnf(i_0_26,plain,
( rf(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epqw0rz7/lgb.p',i_0_26) ).
cnf(i_0_32,plain,
( cp1(X1)
| ~ ca_Ax2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epqw0rz7/lgb.p',i_0_32) ).
cnf(i_0_37,plain,
( rf(X1,esk5_1(X1))
| ~ ca_Vx3(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epqw0rz7/lgb.p',i_0_37) ).
cnf(i_0_40,plain,
( rf(X1,X2)
| ~ rinvF(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epqw0rz7/lgb.p',i_0_40) ).
cnf(i_0_34,plain,
( rinvF(X1,esk4_1(X1))
| ~ ca_Ax2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epqw0rz7/lgb.p',i_0_34) ).
cnf(i_0_25,plain,
( ca_Ax2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epqw0rz7/lgb.p',i_0_25) ).
cnf(i_0_24,plain,
( cUnsatisfiable(X1)
| ~ ca_Ax2(X2)
| ~ rf(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epqw0rz7/lgb.p',i_0_24) ).
cnf(i_0_33,plain,
( ca_Vx3(esk4_1(X1))
| ~ ca_Ax2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epqw0rz7/lgb.p',i_0_33) ).
cnf(i_0_44,plain,
cUnsatisfiable(i2003_11_14_17_21_48796),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-epqw0rz7/lgb.p',i_0_44) ).
cnf(c_0_58,plain,
( ~ cp1(X1)
| ~ ra_Px1(X1,X2) ),
i_0_28 ).
cnf(c_0_59,plain,
( ra_Px1(X1,esk3_1(X1))
| ~ cp1xcomp(X1) ),
i_0_30 ).
cnf(c_0_60,plain,
( ~ cp1(X1)
| ~ cp1xcomp(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_61,plain,
( cp1xcomp(esk5_1(X1))
| ~ ca_Vx3(X1) ),
i_0_36 ).
cnf(c_0_62,plain,
( X1 = X2
| ~ rf(X3,X2)
| ~ rf(X3,X1) ),
i_0_38 ).
cnf(c_0_63,plain,
( rf(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_26 ).
cnf(c_0_64,plain,
( ~ cp1(esk5_1(X1))
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,plain,
( cp1(X1)
| ~ ca_Ax2(X1) ),
i_0_32 ).
cnf(c_0_66,plain,
( X1 = esk1_1(X2)
| ~ cUnsatisfiable(X2)
| ~ rf(X2,X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,plain,
( rf(X1,esk5_1(X1))
| ~ ca_Vx3(X1) ),
i_0_37 ).
cnf(c_0_68,plain,
( rf(X1,X2)
| ~ rinvF(X2,X1) ),
i_0_40 ).
cnf(c_0_69,plain,
( rinvF(X1,esk4_1(X1))
| ~ ca_Ax2(X1) ),
i_0_34 ).
cnf(c_0_70,plain,
( ~ ca_Ax2(esk5_1(X1))
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_71,plain,
( esk5_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1)
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_72,plain,
( ca_Ax2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_25 ).
cnf(c_0_73,plain,
( cUnsatisfiable(X1)
| ~ ca_Ax2(X2)
| ~ rf(X1,X2) ),
i_0_24 ).
cnf(c_0_74,plain,
( rf(esk4_1(X1),X1)
| ~ ca_Ax2(X1) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_75,plain,
( ~ cUnsatisfiable(X1)
| ~ ca_Vx3(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]) ).
cnf(c_0_76,plain,
( cUnsatisfiable(esk4_1(X1))
| ~ ca_Ax2(X1) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_77,plain,
( ca_Vx3(esk4_1(X1))
| ~ ca_Ax2(X1) ),
i_0_33 ).
cnf(c_0_78,plain,
~ ca_Ax2(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]) ).
cnf(c_0_79,plain,
cUnsatisfiable(i2003_11_14_17_21_48796),
i_0_44 ).
cnf(c_0_80,plain,
~ cUnsatisfiable(X1),
inference(spm,[status(thm)],[c_0_78,c_0_72]) ).
cnf(c_0_81,plain,
$false,
inference(sr,[status(thm)],[c_0_79,c_0_80]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS120+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n028.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Tue Jun 7 17:12:32 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected complete mode:
% 4.38/2.09 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.38/2.09 # No SInE strategy applied
% 4.38/2.09 # Trying AutoSched0 for 150 seconds
% 4.38/2.09 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 4.38/2.09 # and selection function SelectCQPrecWNTNp.
% 4.38/2.09 #
% 4.38/2.09 # Preprocessing time : 0.017 s
% 4.38/2.09
% 4.38/2.09 # Proof found!
% 4.38/2.09 # SZS status Theorem
% 4.38/2.09 # SZS output start CNFRefutation
% See solution above
% 4.38/2.09 # Training examples: 0 positive, 0 negative
% 4.38/2.09
% 4.38/2.09 # -------------------------------------------------
% 4.38/2.09 # User time : 0.018 s
% 4.38/2.09 # System time : 0.004 s
% 4.38/2.09 # Total time : 0.022 s
% 4.38/2.09 # Maximum resident set size: 7124 pages
% 4.38/2.09
%------------------------------------------------------------------------------