TSTP Solution File: KRS166+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS166+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:56:00 EDT 2022
% Result : Theorem 6.71s 2.25s
% Output : CNFRefutation 6.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 6 unt; 12 nHn; 25 RR)
% Number of literals : 80 ( 0 equ; 38 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 10 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| cAutomobile(esk3_0)
| cCar(esk3_0)
| ~ xsd_integer(esk2_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vf9isp0u/input.p',i_0_7) ).
cnf(i_0_1,plain,
~ cowlNothing(X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vf9isp0u/input.p',i_0_1) ).
cnf(i_0_8,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cAutomobile(esk3_0)
| ~ cCar(esk3_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vf9isp0u/input.p',i_0_8) ).
cnf(i_0_4,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vf9isp0u/input.p',i_0_4) ).
cnf(i_0_5,plain,
( cCar(X1)
| ~ cAutomobile(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vf9isp0u/input.p',i_0_5) ).
cnf(i_0_10,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| ~ cAutomobile(esk3_0)
| ~ cCar(esk3_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vf9isp0u/input.p',i_0_10) ).
cnf(i_0_6,plain,
( cAutomobile(X1)
| ~ cCar(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vf9isp0u/input.p',i_0_6) ).
cnf(i_0_3,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vf9isp0u/input.p',i_0_3) ).
cnf(i_0_9,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| cAutomobile(esk3_0)
| cCar(esk3_0)
| ~ xsd_string(esk2_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vf9isp0u/input.p',i_0_9) ).
cnf(c_0_20,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| cAutomobile(esk3_0)
| cCar(esk3_0)
| ~ xsd_integer(esk2_0) ),
i_0_7 ).
cnf(c_0_21,plain,
~ cowlNothing(X1),
i_0_1 ).
cnf(c_0_22,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cAutomobile(esk3_0)
| ~ cCar(esk3_0) ),
i_0_8 ).
cnf(c_0_23,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
i_0_4 ).
cnf(c_0_24,negated_conjecture,
( cCar(esk3_0)
| cAutomobile(esk3_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0) ),
inference(sr,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( cCar(X1)
| ~ cAutomobile(X1) ),
i_0_5 ).
cnf(c_0_26,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| ~ cAutomobile(esk3_0)
| ~ cCar(esk3_0) ),
i_0_10 ).
cnf(c_0_27,negated_conjecture,
( xsd_string(esk2_0)
| ~ cCar(esk3_0)
| ~ cAutomobile(esk3_0)
| ~ xsd_integer(esk2_0) ),
inference(sr,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_28,plain,
( cAutomobile(X1)
| ~ cCar(X1) ),
i_0_6 ).
cnf(c_0_29,negated_conjecture,
( cCar(esk3_0)
| ~ xsd_integer(esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( xsd_integer(esk2_0)
| ~ cCar(esk3_0)
| ~ cAutomobile(esk3_0)
| ~ xsd_string(esk2_0) ),
inference(sr,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_31,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
i_0_3 ).
cnf(c_0_32,negated_conjecture,
~ xsd_integer(esk2_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_27]),c_0_28]),c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| cAutomobile(esk3_0)
| cCar(esk3_0)
| ~ xsd_string(esk2_0) ),
i_0_9 ).
cnf(c_0_34,negated_conjecture,
~ cCar(esk3_0),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_28]) ).
cnf(c_0_35,negated_conjecture,
( cCar(esk3_0)
| cAutomobile(esk3_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0) ),
inference(sr,[status(thm)],[c_0_33,c_0_21]) ).
cnf(c_0_36,plain,
~ cAutomobile(esk3_0),
inference(spm,[status(thm)],[c_0_34,c_0_25]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_31]),c_0_34]),c_0_36]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : KRS166+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n019.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 19:25:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 6.71/2.25 # ENIGMATIC: Solved by autoschedule:
% 6.71/2.25 # No SInE strategy applied
% 6.71/2.25 # Trying AutoSched0 for 150 seconds
% 6.71/2.25 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 6.71/2.25 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.71/2.25 #
% 6.71/2.25 # Preprocessing time : 0.023 s
% 6.71/2.25
% 6.71/2.25 # Proof found!
% 6.71/2.25 # SZS status Theorem
% 6.71/2.25 # SZS output start CNFRefutation
% See solution above
% 6.71/2.25 # Training examples: 0 positive, 0 negative
% 6.71/2.25
% 6.71/2.25 # -------------------------------------------------
% 6.71/2.25 # User time : 0.020 s
% 6.71/2.25 # System time : 0.008 s
% 6.71/2.25 # Total time : 0.029 s
% 6.71/2.25 # Maximum resident set size: 7116 pages
% 6.71/2.25
%------------------------------------------------------------------------------