TSTP Solution File: KRS109+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS109+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:38 EDT 2022
% Result : Unsatisfiable 3.99s 2.05s
% Output : CNFRefutation 3.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 38 ( 4 unt; 0 nHn; 38 RR)
% Number of literals : 81 ( 4 equ; 48 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 52 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_45,plain,
( X1 = X2
| ~ rf(X3,X2)
| ~ rf(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o261dxkq/lgb.p',i_0_45) ).
cnf(i_0_30,plain,
( rf(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o261dxkq/lgb.p',i_0_30) ).
cnf(i_0_55,plain,
( rf(X1,X2)
| ~ rs(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o261dxkq/lgb.p',i_0_55) ).
cnf(i_0_44,plain,
( rs(X1,esk6_1(X1))
| ~ ca_Vx3(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o261dxkq/lgb.p',i_0_44) ).
cnf(i_0_47,plain,
( rinvF(X1,X2)
| ~ rf(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o261dxkq/lgb.p',i_0_47) ).
cnf(i_0_51,plain,
( rinvS(X1,X2)
| ~ rs(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o261dxkq/lgb.p',i_0_51) ).
cnf(i_0_40,plain,
( ca_Vx3(X1)
| ~ ca_Ax2(X2)
| ~ rinvF(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o261dxkq/lgb.p',i_0_40) ).
cnf(i_0_29,plain,
( ca_Ax2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o261dxkq/lgb.p',i_0_29) ).
cnf(i_0_33,plain,
( ~ cp(X1)
| ~ ra_Px1(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o261dxkq/lgb.p',i_0_33) ).
cnf(i_0_35,plain,
( ra_Px1(X1,esk3_1(X1))
| ~ cpxcomp(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o261dxkq/lgb.p',i_0_35) ).
cnf(i_0_41,plain,
( cp(X1)
| ~ ca_Ax2(X2)
| ~ rinvS(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o261dxkq/lgb.p',i_0_41) ).
cnf(i_0_31,plain,
( cpxcomp(X1)
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o261dxkq/lgb.p',i_0_31) ).
cnf(i_0_54,plain,
cUnsatisfiable(i2003_11_14_17_21_08508),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o261dxkq/lgb.p',i_0_54) ).
cnf(c_0_69,plain,
( X1 = X2
| ~ rf(X3,X2)
| ~ rf(X3,X1) ),
i_0_45 ).
cnf(c_0_70,plain,
( rf(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_30 ).
cnf(c_0_71,plain,
( rf(X1,X2)
| ~ rs(X1,X2) ),
i_0_55 ).
cnf(c_0_72,plain,
( rs(X1,esk6_1(X1))
| ~ ca_Vx3(X1) ),
i_0_44 ).
cnf(c_0_73,plain,
( rinvF(X1,X2)
| ~ rf(X2,X1) ),
i_0_47 ).
cnf(c_0_74,plain,
( rinvS(X1,X2)
| ~ rs(X2,X1) ),
i_0_51 ).
cnf(c_0_75,plain,
( X1 = esk1_1(X2)
| ~ cUnsatisfiable(X2)
| ~ rf(X2,X1) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_76,plain,
( rf(X1,esk6_1(X1))
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_77,plain,
( ca_Vx3(X1)
| ~ ca_Ax2(X2)
| ~ rinvF(X2,X1) ),
i_0_40 ).
cnf(c_0_78,plain,
( rinvF(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_73,c_0_70]) ).
cnf(c_0_79,plain,
( ca_Ax2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_29 ).
cnf(c_0_80,plain,
( ~ cp(X1)
| ~ ra_Px1(X1,X2) ),
i_0_33 ).
cnf(c_0_81,plain,
( ra_Px1(X1,esk3_1(X1))
| ~ cpxcomp(X1) ),
i_0_35 ).
cnf(c_0_82,plain,
( cp(X1)
| ~ ca_Ax2(X2)
| ~ rinvS(X2,X1) ),
i_0_41 ).
cnf(c_0_83,plain,
( rinvS(esk6_1(X1),X1)
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_72]) ).
cnf(c_0_84,plain,
( esk1_1(X1) = esk6_1(X1)
| ~ cUnsatisfiable(X1)
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_85,plain,
( ca_Vx3(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]) ).
cnf(c_0_86,plain,
( ~ cp(X1)
| ~ cpxcomp(X1) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_87,plain,
( cpxcomp(X1)
| ~ cUnsatisfiable(X1) ),
i_0_31 ).
cnf(c_0_88,plain,
( cp(X1)
| ~ ca_Ax2(esk6_1(X1))
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_89,plain,
( ca_Ax2(esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_84]),c_0_85]) ).
cnf(c_0_90,plain,
( ~ cp(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_91,plain,
cUnsatisfiable(i2003_11_14_17_21_08508),
i_0_54 ).
cnf(c_0_92,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_85]),c_0_90]) ).
cnf(c_0_93,plain,
$false,
inference(sr,[status(thm)],[c_0_91,c_0_92]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : KRS109+1 : TPTP v8.1.0. Released v3.1.0.
% 0.02/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Tue Jun 7 13:38:22 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.15/0.38 # ENIGMATIC: Selected complete mode:
% 3.99/2.05 # ENIGMATIC: Solved by autoschedule-lgb:
% 3.99/2.05 # No SInE strategy applied
% 3.99/2.05 # Trying AutoSched0 for 150 seconds
% 3.99/2.05 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 3.99/2.05 # and selection function SelectCQPrecWNTNp.
% 3.99/2.05 #
% 3.99/2.05 # Preprocessing time : 0.013 s
% 3.99/2.05
% 3.99/2.05 # Proof found!
% 3.99/2.05 # SZS status Theorem
% 3.99/2.05 # SZS output start CNFRefutation
% See solution above
% 3.99/2.05 # Training examples: 0 positive, 0 negative
% 3.99/2.05
% 3.99/2.05 # -------------------------------------------------
% 3.99/2.05 # User time : 0.015 s
% 3.99/2.05 # System time : 0.003 s
% 3.99/2.05 # Total time : 0.018 s
% 3.99/2.05 # Maximum resident set size: 7128 pages
% 3.99/2.05
%------------------------------------------------------------------------------