TSTP Solution File: KRS070+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS070+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:31 EDT 2022
% Result : Unsatisfiable 4.46s 2.38s
% Output : CNFRefutation 4.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 4 unt; 0 nHn; 25 RR)
% Number of literals : 55 ( 6 equ; 34 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 37 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_40,plain,
( X1 = X2
| ~ rrx(X3,X2)
| ~ rrx(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rjaqv1m4/lgb.p',i_0_40) ).
cnf(i_0_53,plain,
( rrx(X1,X2)
| ~ rrx4(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rjaqv1m4/lgb.p',i_0_53) ).
cnf(i_0_46,plain,
( rrx(X1,X2)
| ~ rrx3(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rjaqv1m4/lgb.p',i_0_46) ).
cnf(i_0_36,plain,
( rrx3(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rjaqv1m4/lgb.p',i_0_36) ).
cnf(i_0_37,plain,
( ~ cUnsatisfiable(X1)
| ~ cc1(X2)
| ~ cc2(X2)
| ~ rrx3(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rjaqv1m4/lgb.p',i_0_37) ).
cnf(i_0_35,plain,
( cc1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rjaqv1m4/lgb.p',i_0_35) ).
cnf(i_0_39,plain,
( rrx4(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rjaqv1m4/lgb.p',i_0_39) ).
cnf(i_0_38,plain,
( cc2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rjaqv1m4/lgb.p',i_0_38) ).
cnf(i_0_45,plain,
cUnsatisfiable(i2003_11_14_17_18_32242),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rjaqv1m4/lgb.p',i_0_45) ).
cnf(c_0_63,plain,
( X1 = X2
| ~ rrx(X3,X2)
| ~ rrx(X3,X1) ),
i_0_40 ).
cnf(c_0_64,plain,
( rrx(X1,X2)
| ~ rrx4(X1,X2) ),
i_0_53 ).
cnf(c_0_65,plain,
( X1 = X2
| ~ rrx(X3,X1)
| ~ rrx4(X3,X2) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_66,plain,
( rrx(X1,X2)
| ~ rrx3(X1,X2) ),
i_0_46 ).
cnf(c_0_67,plain,
( X1 = X2
| ~ rrx3(X3,X1)
| ~ rrx4(X3,X2) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_68,plain,
( rrx3(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_36 ).
cnf(c_0_69,plain,
( ~ cUnsatisfiable(X1)
| ~ cc1(X2)
| ~ cc2(X2)
| ~ rrx3(X1,X2) ),
i_0_37 ).
cnf(c_0_70,plain,
( cc1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_35 ).
cnf(c_0_71,plain,
( esk2_1(X1) = X2
| ~ cUnsatisfiable(X1)
| ~ rrx4(X1,X2) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_72,plain,
( rrx4(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_39 ).
cnf(c_0_73,plain,
( ~ cc2(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_68]),c_0_70]) ).
cnf(c_0_74,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_75,plain,
( cc2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_38 ).
cnf(c_0_76,plain,
cUnsatisfiable(i2003_11_14_17_18_32242),
i_0_45 ).
cnf(c_0_77,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]) ).
cnf(c_0_78,plain,
$false,
inference(sr,[status(thm)],[c_0_76,c_0_77]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS070+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n017.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 09:51:19 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 4.46/2.38 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.46/2.38 # No SInE strategy applied
% 4.46/2.38 # Trying AutoSched0 for 150 seconds
% 4.46/2.38 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.46/2.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 4.46/2.38 #
% 4.46/2.38 # Preprocessing time : 0.023 s
% 4.46/2.38 # Presaturation interreduction done
% 4.46/2.38
% 4.46/2.38 # Proof found!
% 4.46/2.38 # SZS status Theorem
% 4.46/2.38 # SZS output start CNFRefutation
% See solution above
% 4.46/2.38 # Training examples: 0 positive, 0 negative
% 4.46/2.38
% 4.46/2.38 # -------------------------------------------------
% 4.46/2.38 # User time : 0.024 s
% 4.46/2.38 # System time : 0.005 s
% 4.46/2.38 # Total time : 0.029 s
% 4.46/2.38 # Maximum resident set size: 7120 pages
% 4.46/2.38
%------------------------------------------------------------------------------