TSTP Solution File: KRS073+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS073+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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 6.58s 2.21s
% Output : CNFRefutation 6.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 4 unt; 0 nHn; 28 RR)
% Number of literals : 65 ( 5 equ; 40 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-2 aty)
% Number of variables : 44 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_43,plain,
( rf(X1,X2)
| ~ rs(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fopn_vr/input.p',i_0_43) ).
cnf(i_0_29,plain,
( rs(X1,esk2_2(X2,X1))
| ~ cUnsatisfiable(X2)
| ~ rinvF(esk1_1(X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fopn_vr/input.p',i_0_29) ).
cnf(i_0_32,plain,
( X1 = X2
| ~ rf(X3,X2)
| ~ rf(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fopn_vr/input.p',i_0_32) ).
cnf(i_0_31,plain,
( rf(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fopn_vr/input.p',i_0_31) ).
cnf(i_0_34,plain,
( rinvF(X1,X2)
| ~ rf(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fopn_vr/input.p',i_0_34) ).
cnf(i_0_30,plain,
( cp(X1)
| ~ cUnsatisfiable(X2)
| ~ rinvS(esk1_1(X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fopn_vr/input.p',i_0_30) ).
cnf(i_0_38,plain,
( rinvS(X1,X2)
| ~ rs(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fopn_vr/input.p',i_0_38) ).
cnf(i_0_27,plain,
( ~ cUnsatisfiable(X1)
| ~ cp(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fopn_vr/input.p',i_0_27) ).
cnf(i_0_41,plain,
cUnsatisfiable(i2003_11_14_17_18_54369),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fopn_vr/input.p',i_0_41) ).
cnf(c_0_53,plain,
( rf(X1,X2)
| ~ rs(X1,X2) ),
i_0_43 ).
cnf(c_0_54,plain,
( rs(X1,esk2_2(X2,X1))
| ~ cUnsatisfiable(X2)
| ~ rinvF(esk1_1(X2),X1) ),
i_0_29 ).
cnf(c_0_55,plain,
( X1 = X2
| ~ rf(X3,X2)
| ~ rf(X3,X1) ),
i_0_32 ).
cnf(c_0_56,plain,
( rf(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_31 ).
cnf(c_0_57,plain,
( rf(X1,esk2_2(X2,X1))
| ~ rinvF(esk1_1(X2),X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,plain,
( rinvF(X1,X2)
| ~ rf(X2,X1) ),
i_0_34 ).
cnf(c_0_59,plain,
( X1 = esk1_1(X2)
| ~ rf(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,plain,
( rf(X1,esk2_2(X2,X1))
| ~ rf(X1,esk1_1(X2))
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,plain,
( esk2_2(X1,X2) = esk1_1(X2)
| ~ rf(X2,esk1_1(X1))
| ~ cUnsatisfiable(X2)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_62,plain,
( esk2_2(X1,X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_56]) ).
cnf(c_0_63,plain,
( cp(X1)
| ~ cUnsatisfiable(X2)
| ~ rinvS(esk1_1(X2),X1) ),
i_0_30 ).
cnf(c_0_64,plain,
( rinvS(X1,X2)
| ~ rs(X2,X1) ),
i_0_38 ).
cnf(c_0_65,plain,
( rs(X1,esk1_1(X1))
| ~ rinvF(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_62]) ).
cnf(c_0_66,plain,
( cp(X1)
| ~ rs(X1,esk1_1(X2))
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,plain,
( rs(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_58]),c_0_56]) ).
cnf(c_0_68,plain,
( ~ cUnsatisfiable(X1)
| ~ cp(X1) ),
i_0_27 ).
cnf(c_0_69,plain,
cUnsatisfiable(i2003_11_14_17_18_54369),
i_0_41 ).
cnf(c_0_70,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]) ).
cnf(c_0_71,plain,
$false,
inference(sr,[status(thm)],[c_0_69,c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS073+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n028.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 12:06:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 6.58/2.21 # ENIGMATIC: Solved by autoschedule:
% 6.58/2.21 # No SInE strategy applied
% 6.58/2.21 # Trying AutoSched0 for 150 seconds
% 6.58/2.21 # AutoSched0-Mode selected heuristic G_____0010_evo
% 6.58/2.21 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.58/2.21 #
% 6.58/2.21 # Preprocessing time : 0.012 s
% 6.58/2.21
% 6.58/2.21 # Proof found!
% 6.58/2.21 # SZS status Theorem
% 6.58/2.21 # SZS output start CNFRefutation
% See solution above
% 6.58/2.21 # Training examples: 0 positive, 0 negative
% 6.58/2.21
% 6.58/2.21 # -------------------------------------------------
% 6.58/2.21 # User time : 0.015 s
% 6.58/2.21 # System time : 0.002 s
% 6.58/2.21 # Total time : 0.016 s
% 6.58/2.21 # Maximum resident set size: 7120 pages
% 6.58/2.21
%------------------------------------------------------------------------------