TSTP Solution File: KRS150+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS150+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:56 EDT 2022
% Result : Theorem 7.62s 2.34s
% Output : CNFRefutation 7.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of clauses : 47 ( 25 unt; 10 nHn; 41 RR)
% Number of literals : 118 ( 0 equ; 70 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 15 ( 14 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 22 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_37,plain,
~ cC4(iV16561),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_n3t6735/input.p',i_0_37) ).
cnf(i_0_23,plain,
( cC2(X1)
| cC4(X1)
| cC6(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_n3t6735/input.p',i_0_23) ).
cnf(i_0_40,plain,
~ cC2(iV16561),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_n3t6735/input.p',i_0_40) ).
cnf(i_0_41,plain,
~ cC10(iV16562),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_n3t6735/input.p',i_0_41) ).
cnf(i_0_8,plain,
( cC10(X1)
| cC2(X1)
| cC12(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_n3t6735/input.p',i_0_8) ).
cnf(i_0_42,plain,
~ cC2(iV16562),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_n3t6735/input.p',i_0_42) ).
cnf(i_0_26,plain,
( cC8(X1)
| ~ cC6(X2)
| ~ rR1(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_n3t6735/input.p',i_0_26) ).
cnf(i_0_36,plain,
rR1(iV16560,iV16561),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_n3t6735/input.p',i_0_36) ).
cnf(i_0_11,plain,
( cC14(X1)
| ~ cC12(X2)
| ~ rR1(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_n3t6735/input.p',i_0_11) ).
cnf(i_0_35,plain,
rR1(iV16560,iV16562),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_n3t6735/input.p',i_0_35) ).
cnf(i_0_46,negated_conjecture,
( cowlNothing(esk5_0)
| xsd_integer(esk6_0)
| ~ xsd_string(esk6_0)
| ~ cC12(iV16562)
| ~ cC14(iV16560)
| ~ cC16(iV16560)
| ~ cC8(iV16560)
| ~ cC18(iV16560)
| ~ cC6(iV16561) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_n3t6735/input.p',i_0_46) ).
cnf(i_0_1,plain,
~ cowlNothing(X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_n3t6735/input.p',i_0_1) ).
cnf(i_0_3,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_n3t6735/input.p',i_0_3) ).
cnf(i_0_31,plain,
( cC18(X1)
| ~ cTEST(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_n3t6735/input.p',i_0_31) ).
cnf(i_0_33,plain,
cTEST(iV16560),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_n3t6735/input.p',i_0_33) ).
cnf(i_0_14,plain,
( cC16(X1)
| ~ cC14(X1)
| ~ cC8(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_n3t6735/input.p',i_0_14) ).
cnf(i_0_45,negated_conjecture,
( cowlNothing(esk5_0)
| xsd_string(esk6_0)
| ~ xsd_integer(esk6_0)
| ~ cC12(iV16562)
| ~ cC14(iV16560)
| ~ cC16(iV16560)
| ~ cC8(iV16560)
| ~ cC18(iV16560)
| ~ cC6(iV16561) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_n3t6735/input.p',i_0_45) ).
cnf(i_0_4,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_n3t6735/input.p',i_0_4) ).
cnf(c_0_65,plain,
~ cC4(iV16561),
i_0_37 ).
cnf(c_0_66,plain,
( cC2(X1)
| cC4(X1)
| cC6(X1) ),
i_0_23 ).
cnf(c_0_67,plain,
~ cC2(iV16561),
i_0_40 ).
cnf(c_0_68,plain,
~ cC10(iV16562),
i_0_41 ).
cnf(c_0_69,plain,
( cC10(X1)
| cC2(X1)
| cC12(X1) ),
i_0_8 ).
cnf(c_0_70,plain,
~ cC2(iV16562),
i_0_42 ).
cnf(c_0_71,plain,
( cC8(X1)
| ~ cC6(X2)
| ~ rR1(X1,X2) ),
i_0_26 ).
cnf(c_0_72,plain,
rR1(iV16560,iV16561),
i_0_36 ).
cnf(c_0_73,plain,
cC6(iV16561),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_74,plain,
( cC14(X1)
| ~ cC12(X2)
| ~ rR1(X1,X2) ),
i_0_11 ).
cnf(c_0_75,plain,
rR1(iV16560,iV16562),
i_0_35 ).
cnf(c_0_76,plain,
cC12(iV16562),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]) ).
cnf(c_0_77,negated_conjecture,
( cowlNothing(esk5_0)
| xsd_integer(esk6_0)
| ~ xsd_string(esk6_0)
| ~ cC12(iV16562)
| ~ cC14(iV16560)
| ~ cC16(iV16560)
| ~ cC8(iV16560)
| ~ cC18(iV16560)
| ~ cC6(iV16561) ),
i_0_46 ).
cnf(c_0_78,plain,
~ cowlNothing(X1),
i_0_1 ).
cnf(c_0_79,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
i_0_3 ).
cnf(c_0_80,plain,
( cC18(X1)
| ~ cTEST(X1) ),
i_0_31 ).
cnf(c_0_81,plain,
cTEST(iV16560),
i_0_33 ).
cnf(c_0_82,plain,
( cC16(X1)
| ~ cC14(X1)
| ~ cC8(X1) ),
i_0_14 ).
cnf(c_0_83,plain,
cC8(iV16560),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73])]) ).
cnf(c_0_84,plain,
cC14(iV16560),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76])]) ).
cnf(c_0_85,negated_conjecture,
( xsd_integer(esk6_0)
| ~ cC6(iV16561)
| ~ cC12(iV16562)
| ~ cC8(iV16560)
| ~ cC18(iV16560)
| ~ cC16(iV16560)
| ~ cC14(iV16560) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_77,c_0_78]),c_0_79]) ).
cnf(c_0_86,plain,
cC18(iV16560),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_87,plain,
cC16(iV16560),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84])]) ).
cnf(c_0_88,negated_conjecture,
( cowlNothing(esk5_0)
| xsd_string(esk6_0)
| ~ xsd_integer(esk6_0)
| ~ cC12(iV16562)
| ~ cC14(iV16560)
| ~ cC16(iV16560)
| ~ cC8(iV16560)
| ~ cC18(iV16560)
| ~ cC6(iV16561) ),
i_0_45 ).
cnf(c_0_89,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
i_0_4 ).
cnf(c_0_90,negated_conjecture,
xsd_integer(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_86])]),c_0_73]),c_0_76]),c_0_83]),c_0_87]),c_0_84])]) ).
cnf(c_0_91,negated_conjecture,
( xsd_string(esk6_0)
| ~ cC6(iV16561)
| ~ cC12(iV16562)
| ~ cC8(iV16560)
| ~ cC18(iV16560)
| ~ cC16(iV16560)
| ~ cC14(iV16560)
| ~ xsd_integer(esk6_0) ),
inference(sr,[status(thm)],[c_0_88,c_0_78]) ).
cnf(c_0_92,plain,
~ xsd_string(esk6_0),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_93,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_86])]),c_0_73]),c_0_76]),c_0_83]),c_0_87]),c_0_84]),c_0_90])]),c_0_92]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : KRS150+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n023.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Tue Jun 7 16:58:40 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 7.62/2.34 # ENIGMATIC: Solved by autoschedule:
% 7.62/2.34 # No SInE strategy applied
% 7.62/2.34 # Trying AutoSched0 for 150 seconds
% 7.62/2.34 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 7.62/2.34 # and selection function SelectCQPrecWNTNp.
% 7.62/2.34 #
% 7.62/2.34 # Preprocessing time : 0.023 s
% 7.62/2.34
% 7.62/2.34 # Proof found!
% 7.62/2.34 # SZS status Theorem
% 7.62/2.34 # SZS output start CNFRefutation
% See solution above
% 7.62/2.34 # Training examples: 0 positive, 0 negative
% 7.62/2.34
% 7.62/2.34 # -------------------------------------------------
% 7.62/2.34 # User time : 0.028 s
% 7.62/2.34 # System time : 0.003 s
% 7.62/2.34 # Total time : 0.031 s
% 7.62/2.34 # Maximum resident set size: 7120 pages
% 7.62/2.34
%------------------------------------------------------------------------------