TSTP Solution File: KRS129+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS129+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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 4.48s 2.27s
% Output : CNFRefutation 4.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 9 unt; 6 nHn; 21 RR)
% Number of literals : 45 ( 0 equ; 24 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 14 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_28,plain,
( risEuroMPFrom(X1,X2)
| ~ rhasEuroMP(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tovnmb7/input.p',i_0_28) ).
cnf(i_0_37,plain,
rhasEuroMP(iUK,iKinnock),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tovnmb7/input.p',i_0_37) ).
cnf(i_0_39,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| ~ cEuroMP(iKinnock)
| ~ xsd_string(esk3_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tovnmb7/input.p',i_0_39) ).
cnf(i_0_13,plain,
~ cowlNothing(X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tovnmb7/input.p',i_0_13) ).
cnf(i_0_16,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tovnmb7/input.p',i_0_16) ).
cnf(i_0_24,plain,
( cEuroMP(X1)
| ~ risEuroMPFrom(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tovnmb7/input.p',i_0_24) ).
cnf(i_0_38,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| ~ cEuroMP(iKinnock)
| ~ xsd_integer(esk3_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tovnmb7/input.p',i_0_38) ).
cnf(i_0_15,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tovnmb7/input.p',i_0_15) ).
cnf(c_0_48,plain,
( risEuroMPFrom(X1,X2)
| ~ rhasEuroMP(X2,X1) ),
i_0_28 ).
cnf(c_0_49,plain,
rhasEuroMP(iUK,iKinnock),
i_0_37 ).
cnf(c_0_50,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_integer(esk3_0)
| ~ cEuroMP(iKinnock)
| ~ xsd_string(esk3_0) ),
i_0_39 ).
cnf(c_0_51,plain,
~ cowlNothing(X1),
i_0_13 ).
cnf(c_0_52,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
i_0_16 ).
cnf(c_0_53,plain,
( cEuroMP(X1)
| ~ risEuroMPFrom(X1,X2) ),
i_0_24 ).
cnf(c_0_54,plain,
risEuroMPFrom(iKinnock,iUK),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,negated_conjecture,
( cowlNothing(esk2_0)
| xsd_string(esk3_0)
| ~ cEuroMP(iKinnock)
| ~ xsd_integer(esk3_0) ),
i_0_38 ).
cnf(c_0_56,negated_conjecture,
( ~ cEuroMP(iKinnock)
| ~ xsd_string(esk3_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_57,plain,
cEuroMP(iKinnock),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
( ~ cEuroMP(iKinnock)
| ~ xsd_integer(esk3_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_55,c_0_51]),c_0_52]) ).
cnf(c_0_59,negated_conjecture,
~ xsd_string(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57])]) ).
cnf(c_0_60,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
i_0_15 ).
cnf(c_0_61,negated_conjecture,
~ xsd_integer(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_57])]) ).
cnf(c_0_62,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS129+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n022.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 15:44:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 4.48/2.27 # ENIGMATIC: Solved by autoschedule:
% 4.48/2.27 # No SInE strategy applied
% 4.48/2.27 # Trying AutoSched0 for 150 seconds
% 4.48/2.27 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S021N
% 4.48/2.27 # and selection function PSelectAllCondOptimalLit.
% 4.48/2.27 #
% 4.48/2.27 # Preprocessing time : 0.023 s
% 4.48/2.27 # Presaturation interreduction done
% 4.48/2.27
% 4.48/2.27 # Proof found!
% 4.48/2.27 # SZS status Theorem
% 4.48/2.27 # SZS output start CNFRefutation
% See solution above
% 4.48/2.27 # Training examples: 0 positive, 0 negative
% 4.48/2.27
% 4.48/2.27 # -------------------------------------------------
% 4.48/2.27 # User time : 0.027 s
% 4.48/2.27 # System time : 0.003 s
% 4.48/2.27 # Total time : 0.030 s
% 4.48/2.27 # Maximum resident set size: 7124 pages
% 4.48/2.27
%------------------------------------------------------------------------------