TSTP Solution File: KRS087+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS087+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:34 EDT 2022
% Result : Unsatisfiable 7.53s 2.44s
% Output : CNFRefutation 7.53s
% 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 : 40 ( 0 equ; 25 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 26 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_31,plain,
( rr(X1,X2)
| ~ rr(X3,X2)
| ~ rr(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mnt821gx/lgb.p',i_0_31) ).
cnf(i_0_23,plain,
( rr(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mnt821gx/lgb.p',i_0_23) ).
cnf(i_0_22,plain,
( ~ cUnsatisfiable(X1)
| ~ cp1(X2)
| ~ rinvR(esk2_1(X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mnt821gx/lgb.p',i_0_22) ).
cnf(i_0_29,plain,
( rinvR(X1,X2)
| ~ rr(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mnt821gx/lgb.p',i_0_29) ).
cnf(i_0_24,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mnt821gx/lgb.p',i_0_24) ).
cnf(i_0_25,plain,
( cp1(X1)
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mnt821gx/lgb.p',i_0_25) ).
cnf(i_0_32,plain,
cUnsatisfiable(i2003_11_14_17_19_46763),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mnt821gx/lgb.p',i_0_32) ).
cnf(c_0_40,plain,
( rr(X1,X2)
| ~ rr(X3,X2)
| ~ rr(X1,X3) ),
i_0_31 ).
cnf(c_0_41,plain,
( rr(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_23 ).
cnf(c_0_42,plain,
( ~ cUnsatisfiable(X1)
| ~ cp1(X2)
| ~ rinvR(esk2_1(X1),X2) ),
i_0_22 ).
cnf(c_0_43,plain,
( rinvR(X1,X2)
| ~ rr(X2,X1) ),
i_0_29 ).
cnf(c_0_44,plain,
( rr(X1,esk2_1(X2))
| ~ cUnsatisfiable(X2)
| ~ rr(X1,esk1_1(X2)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_24 ).
cnf(c_0_46,plain,
( ~ cp1(X1)
| ~ cUnsatisfiable(X2)
| ~ rr(X1,esk2_1(X2)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
( cp1(X1)
| ~ cUnsatisfiable(X1) ),
i_0_25 ).
cnf(c_0_49,plain,
cUnsatisfiable(i2003_11_14_17_19_46763),
i_0_32 ).
cnf(c_0_50,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_51,plain,
$false,
inference(sr,[status(thm)],[c_0_49,c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : KRS087+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n023.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Tue Jun 7 05:47:25 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.53/2.44 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.53/2.44 # No SInE strategy applied
% 7.53/2.44 # Trying AutoSched0 for 150 seconds
% 7.53/2.44 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_S0Y
% 7.53/2.44 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.53/2.44 #
% 7.53/2.44 # Preprocessing time : 0.024 s
% 7.53/2.44
% 7.53/2.44 # Proof found!
% 7.53/2.44 # SZS status Theorem
% 7.53/2.44 # SZS output start CNFRefutation
% See solution above
% 7.53/2.44 # Training examples: 0 positive, 0 negative
% 7.53/2.44
% 7.53/2.44 # -------------------------------------------------
% 7.53/2.44 # User time : 0.027 s
% 7.53/2.44 # System time : 0.003 s
% 7.53/2.44 # Total time : 0.030 s
% 7.53/2.44 # Maximum resident set size: 7120 pages
% 7.53/2.44
%------------------------------------------------------------------------------