TSTP Solution File: KRS084+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS084+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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 7.90s 2.48s
% Output : CNFRefutation 7.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 34 ( 4 unt; 0 nHn; 34 RR)
% Number of literals : 76 ( 4 equ; 49 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 51 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_31,plain,
( X1 = X2
| ~ rf(X3,X2)
| ~ rf(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r4_o82d5/lgb.p',i_0_31) ).
cnf(i_0_30,plain,
( rf(X1,esk4_1(X1))
| ~ cd(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r4_o82d5/lgb.p',i_0_30) ).
cnf(i_0_33,plain,
( rf(X1,X2)
| ~ rinvF(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r4_o82d5/lgb.p',i_0_33) ).
cnf(i_0_24,plain,
( rinvF(X1,esk2_2(X2,X1))
| ~ cUnsatisfiable(X2)
| ~ rinvR(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r4_o82d5/lgb.p',i_0_24) ).
cnf(i_0_23,plain,
( cd(esk2_2(X1,X2))
| ~ cUnsatisfiable(X1)
| ~ rinvR(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r4_o82d5/lgb.p',i_0_23) ).
cnf(i_0_29,plain,
( ~ cd(X1)
| ~ cc(esk4_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r4_o82d5/lgb.p',i_0_29) ).
cnf(i_0_34,plain,
( rinvR(X1,X2)
| ~ rr(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r4_o82d5/lgb.p',i_0_34) ).
cnf(i_0_38,plain,
( rr(X1,X2)
| ~ rf(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r4_o82d5/lgb.p',i_0_38) ).
cnf(i_0_26,plain,
( rinvF(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r4_o82d5/lgb.p',i_0_26) ).
cnf(i_0_28,plain,
( cc(X1)
| ~ cd(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r4_o82d5/lgb.p',i_0_28) ).
cnf(i_0_25,plain,
( cd(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r4_o82d5/lgb.p',i_0_25) ).
cnf(i_0_37,plain,
cUnsatisfiable(i2003_11_14_17_19_35232),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r4_o82d5/lgb.p',i_0_37) ).
cnf(c_0_51,plain,
( X1 = X2
| ~ rf(X3,X2)
| ~ rf(X3,X1) ),
i_0_31 ).
cnf(c_0_52,plain,
( rf(X1,esk4_1(X1))
| ~ cd(X1) ),
i_0_30 ).
cnf(c_0_53,plain,
( rf(X1,X2)
| ~ rinvF(X2,X1) ),
i_0_33 ).
cnf(c_0_54,plain,
( rinvF(X1,esk2_2(X2,X1))
| ~ cUnsatisfiable(X2)
| ~ rinvR(X2,X1) ),
i_0_24 ).
cnf(c_0_55,plain,
( X1 = esk4_1(X2)
| ~ cd(X2)
| ~ rf(X2,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,plain,
( rf(esk2_2(X1,X2),X2)
| ~ rinvR(X1,X2)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,plain,
( cd(esk2_2(X1,X2))
| ~ cUnsatisfiable(X1)
| ~ rinvR(X1,X2) ),
i_0_23 ).
cnf(c_0_58,plain,
( ~ cd(X1)
| ~ cc(esk4_1(X1)) ),
i_0_29 ).
cnf(c_0_59,plain,
( esk4_1(esk2_2(X1,X2)) = X2
| ~ rinvR(X1,X2)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_60,plain,
( ~ cc(X1)
| ~ rinvR(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_57]) ).
cnf(c_0_61,plain,
( rinvR(X1,X2)
| ~ rr(X2,X1) ),
i_0_34 ).
cnf(c_0_62,plain,
( ~ cc(X1)
| ~ rr(X1,X2)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_63,plain,
( rr(X1,X2)
| ~ rf(X1,X2) ),
i_0_38 ).
cnf(c_0_64,plain,
( rinvF(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_26 ).
cnf(c_0_65,plain,
( ~ cc(X1)
| ~ cUnsatisfiable(X2)
| ~ rf(X1,X2) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,plain,
( rf(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_64]) ).
cnf(c_0_67,plain,
( ~ cc(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_68,plain,
( cc(X1)
| ~ cd(X1) ),
i_0_28 ).
cnf(c_0_69,plain,
( cd(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_25 ).
cnf(c_0_70,plain,
cUnsatisfiable(i2003_11_14_17_19_35232),
i_0_37 ).
cnf(c_0_71,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]) ).
cnf(c_0_72,plain,
$false,
inference(sr,[status(thm)],[c_0_70,c_0_71]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12 % Problem : KRS084+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n029.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 07:35:37 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.90/2.48 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.90/2.48 # No SInE strategy applied
% 7.90/2.48 # Trying AutoSched0 for 150 seconds
% 7.90/2.48 # AutoSched0-Mode selected heuristic G_____0010_evo
% 7.90/2.48 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.90/2.48 #
% 7.90/2.48 # Preprocessing time : 0.023 s
% 7.90/2.48
% 7.90/2.48 # Proof found!
% 7.90/2.48 # SZS status Theorem
% 7.90/2.48 # SZS output start CNFRefutation
% See solution above
% 7.90/2.48 # Training examples: 0 positive, 0 negative
% 7.90/2.48
% 7.90/2.48 # -------------------------------------------------
% 7.90/2.48 # User time : 0.024 s
% 7.90/2.48 # System time : 0.009 s
% 7.90/2.48 # Total time : 0.033 s
% 7.90/2.48 # Maximum resident set size: 7124 pages
% 7.90/2.48
%------------------------------------------------------------------------------