TSTP Solution File: KRS097+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS097+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:36 EDT 2022
% Result : Unsatisfiable 8.20s 2.45s
% Output : CNFRefutation 8.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 4 unt; 0 nHn; 19 RR)
% Number of literals : 39 ( 4 equ; 24 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 21 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_35,plain,
( X1 = X2
| ~ cUnsatisfiable(X3)
| ~ rr(X3,X2)
| ~ rr(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2mwe_xui/lgb.p',i_0_35) ).
cnf(i_0_34,plain,
( rr(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2mwe_xui/lgb.p',i_0_34) ).
cnf(i_0_44,plain,
( ~ cc(X1)
| ~ cd(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2mwe_xui/lgb.p',i_0_44) ).
cnf(i_0_33,plain,
( cc(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2mwe_xui/lgb.p',i_0_33) ).
cnf(i_0_37,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2mwe_xui/lgb.p',i_0_37) ).
cnf(i_0_36,plain,
( cd(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2mwe_xui/lgb.p',i_0_36) ).
cnf(i_0_42,plain,
cUnsatisfiable(i2003_11_14_17_20_21603),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2mwe_xui/lgb.p',i_0_42) ).
cnf(c_0_52,plain,
( X1 = X2
| ~ cUnsatisfiable(X3)
| ~ rr(X3,X2)
| ~ rr(X3,X1) ),
i_0_35 ).
cnf(c_0_53,plain,
( rr(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_34 ).
cnf(c_0_54,plain,
( ~ cc(X1)
| ~ cd(X1) ),
i_0_44 ).
cnf(c_0_55,plain,
( cc(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_33 ).
cnf(c_0_56,plain,
( X1 = esk3_1(X2)
| ~ cUnsatisfiable(X2)
| ~ rr(X2,X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_37 ).
cnf(c_0_58,plain,
( ~ cd(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
( esk3_1(X1) = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,plain,
( cd(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_36 ).
cnf(c_0_61,plain,
cUnsatisfiable(i2003_11_14_17_20_21603),
i_0_42 ).
cnf(c_0_62,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_63,plain,
$false,
inference(sr,[status(thm)],[c_0_61,c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KRS097+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 7 20:48:38 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 8.20/2.45 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.20/2.45 # No SInE strategy applied
% 8.20/2.45 # Trying AutoSched0 for 150 seconds
% 8.20/2.45 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 8.20/2.45 # and selection function SelectCQPrecWNTNp.
% 8.20/2.45 #
% 8.20/2.45 # Preprocessing time : 0.023 s
% 8.20/2.45
% 8.20/2.45 # Proof found!
% 8.20/2.45 # SZS status Theorem
% 8.20/2.45 # SZS output start CNFRefutation
% See solution above
% 8.20/2.45 # Training examples: 0 positive, 0 negative
% 8.20/2.45
% 8.20/2.45 # -------------------------------------------------
% 8.20/2.45 # User time : 0.023 s
% 8.20/2.45 # System time : 0.008 s
% 8.20/2.45 # Total time : 0.031 s
% 8.20/2.45 # Maximum resident set size: 7120 pages
% 8.20/2.45
%------------------------------------------------------------------------------