%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS131+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:42 EDT 2022
% Result : Theorem 7.33s 2.26s
% Output : CNFRefutation 7.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 39 ( 8 unt; 15 nHn; 34 RR)
% Number of literals : 96 ( 0 equ; 46 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-1 aty)
% Number of variables : 29 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
( rp(X1,esk2_1(X1))
| ~ cNothing(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v07kue9n/input.p',i_0_9) ).
cnf(i_0_8,plain,
( ~ cNothing(X1)
| ~ rp(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v07kue9n/input.p',i_0_8) ).
cnf(i_0_5,plain,
( cA(X1)
| ~ rq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v07kue9n/input.p',i_0_5) ).
cnf(i_0_11,plain,
( cnotA(X1)
| rq(X1,esk3_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v07kue9n/input.p',i_0_11) ).
cnf(i_0_12,plain,
( cNothing(X1)
| ~ cnotA(X2)
| ~ rq(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v07kue9n/input.p',i_0_12) ).
cnf(i_0_14,negated_conjecture,
( cowlNothing(esk4_0)
| xsd_string(esk5_0)
| cA(esk6_0)
| ~ xsd_integer(esk5_0)
| ~ cnotA(esk6_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v07kue9n/input.p',i_0_14) ).
cnf(i_0_1,plain,
~ cowlNothing(X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v07kue9n/input.p',i_0_1) ).
cnf(i_0_3,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v07kue9n/input.p',i_0_3) ).
cnf(i_0_7,plain,
( rq(X1,esk1_1(X1))
| ~ cA(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v07kue9n/input.p',i_0_7) ).
cnf(i_0_4,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v07kue9n/input.p',i_0_4) ).
cnf(i_0_13,negated_conjecture,
( cowlNothing(esk4_0)
| xsd_string(esk5_0)
| cnotA(esk6_0)
| ~ xsd_integer(esk5_0)
| ~ cA(esk6_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v07kue9n/input.p',i_0_13) ).
cnf(i_0_16,negated_conjecture,
( cowlNothing(esk4_0)
| xsd_integer(esk5_0)
| cA(esk6_0)
| ~ xsd_string(esk5_0)
| ~ cnotA(esk6_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v07kue9n/input.p',i_0_16) ).
cnf(i_0_15,negated_conjecture,
( cowlNothing(esk4_0)
| xsd_integer(esk5_0)
| cnotA(esk6_0)
| ~ xsd_string(esk5_0)
| ~ cA(esk6_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v07kue9n/input.p',i_0_15) ).
cnf(c_0_30,plain,
( rp(X1,esk2_1(X1))
| ~ cNothing(X1) ),
i_0_9 ).
cnf(c_0_31,plain,
( ~ cNothing(X1)
| ~ rp(X1,X2) ),
i_0_8 ).
cnf(c_0_32,plain,
( cA(X1)
| ~ rq(X1,X2) ),
i_0_5 ).
cnf(c_0_33,plain,
( cnotA(X1)
| rq(X1,esk3_1(X1)) ),
i_0_11 ).
cnf(c_0_34,plain,
( cNothing(X1)
| ~ cnotA(X2)
| ~ rq(X2,X1) ),
i_0_12 ).
cnf(c_0_35,plain,
~ cNothing(X1),
inference(csr,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( cowlNothing(esk4_0)
| xsd_string(esk5_0)
| cA(esk6_0)
| ~ xsd_integer(esk5_0)
| ~ cnotA(esk6_0) ),
i_0_14 ).
cnf(c_0_37,plain,
~ cowlNothing(X1),
i_0_1 ).
cnf(c_0_38,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
i_0_3 ).
cnf(c_0_39,plain,
( cnotA(X1)
| cA(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
( ~ rq(X1,X2)
| ~ cnotA(X1) ),
inference(sr,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
( rq(X1,esk1_1(X1))
| ~ cA(X1) ),
i_0_7 ).
cnf(c_0_42,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
i_0_4 ).
cnf(c_0_43,negated_conjecture,
( cA(esk6_0)
| xsd_string(esk5_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( cowlNothing(esk4_0)
| xsd_string(esk5_0)
| cnotA(esk6_0)
| ~ xsd_integer(esk5_0)
| ~ cA(esk6_0) ),
i_0_13 ).
cnf(c_0_45,plain,
( ~ cnotA(X1)
| ~ cA(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
( cA(esk6_0)
| ~ xsd_integer(esk5_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
( cnotA(esk6_0)
| xsd_string(esk5_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_44,c_0_37]),c_0_38]),c_0_43]) ).
cnf(c_0_48,plain,
( ~ cnotA(esk6_0)
| ~ xsd_integer(esk5_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
( cowlNothing(esk4_0)
| xsd_integer(esk5_0)
| cA(esk6_0)
| ~ xsd_string(esk5_0)
| ~ cnotA(esk6_0) ),
i_0_16 ).
cnf(c_0_50,plain,
~ xsd_integer(esk5_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_47]),c_0_48]) ).
cnf(c_0_51,negated_conjecture,
cA(esk6_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_49,c_0_37]),c_0_50]),c_0_43]),c_0_39]) ).
cnf(c_0_52,plain,
~ cnotA(esk6_0),
inference(spm,[status(thm)],[c_0_45,c_0_51]) ).
cnf(c_0_53,negated_conjecture,
( cowlNothing(esk4_0)
| xsd_integer(esk5_0)
| cnotA(esk6_0)
| ~ xsd_string(esk5_0)
| ~ cA(esk6_0) ),
i_0_15 ).
cnf(c_0_54,negated_conjecture,
xsd_string(esk5_0),
inference(sr,[status(thm)],[c_0_47,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54]),c_0_51])]),c_0_37]),c_0_50]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS131+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 7 12:36:51 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.33/2.26 # ENIGMATIC: Solved by autoschedule:
% 7.33/2.26 # No SInE strategy applied
% 7.33/2.26 # Trying AutoSched0 for 150 seconds
% 7.33/2.26 # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 7.33/2.26 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.33/2.26 #
% 7.33/2.26 # Preprocessing time : 0.023 s
% 7.33/2.26
% 7.33/2.26 # Proof found!
% 7.33/2.26 # SZS status Theorem
% 7.33/2.26 # SZS output start CNFRefutation
% See solution above
% 7.33/2.26 # Training examples: 0 positive, 0 negative
% 7.33/2.26
% 7.33/2.26 # -------------------------------------------------
% 7.33/2.26 # User time : 0.025 s
% 7.33/2.26 # System time : 0.004 s
% 7.33/2.26 # Total time : 0.029 s
% 7.33/2.26 # Maximum resident set size: 7116 pages
% 7.33/2.26
%------------------------------------------------------------------------------