TSTP Solution File: KRS164+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS164+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:59 EDT 2022
% Result : Theorem 4.42s 2.17s
% Output : CNFRefutation 4.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 11 unt; 6 nHn; 24 RR)
% Number of literals : 57 ( 0 equ; 31 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 : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 10 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| ~ cCar(iauto)
| ~ cAutomobile(icar) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2jl3vcvt/input.p',i_0_12) ).
cnf(i_0_1,plain,
~ cowlNothing(X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2jl3vcvt/input.p',i_0_1) ).
cnf(i_0_5,plain,
( cCar(X1)
| ~ cAutomobile(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2jl3vcvt/input.p',i_0_5) ).
cnf(i_0_7,plain,
cAutomobile(iauto),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2jl3vcvt/input.p',i_0_7) ).
cnf(i_0_3,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2jl3vcvt/input.p',i_0_3) ).
cnf(i_0_6,plain,
( cAutomobile(X1)
| ~ cCar(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2jl3vcvt/input.p',i_0_6) ).
cnf(i_0_9,plain,
cCar(icar),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2jl3vcvt/input.p',i_0_9) ).
cnf(i_0_11,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cCar(iauto)
| ~ cAutomobile(icar) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2jl3vcvt/input.p',i_0_11) ).
cnf(i_0_4,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2jl3vcvt/input.p',i_0_4) ).
cnf(c_0_22,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| ~ cCar(iauto)
| ~ cAutomobile(icar) ),
i_0_12 ).
cnf(c_0_23,plain,
~ cowlNothing(X1),
i_0_1 ).
cnf(c_0_24,plain,
( cCar(X1)
| ~ cAutomobile(X1) ),
i_0_5 ).
cnf(c_0_25,plain,
cAutomobile(iauto),
i_0_7 ).
cnf(c_0_26,negated_conjecture,
( xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| ~ cAutomobile(icar)
| ~ cCar(iauto) ),
inference(sr,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
cCar(iauto),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
i_0_3 ).
cnf(c_0_29,negated_conjecture,
( xsd_integer(esk2_0)
| ~ cAutomobile(icar) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),c_0_28]) ).
cnf(c_0_30,plain,
( cAutomobile(X1)
| ~ cCar(X1) ),
i_0_6 ).
cnf(c_0_31,plain,
cCar(icar),
i_0_9 ).
cnf(c_0_32,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cCar(iauto)
| ~ cAutomobile(icar) ),
i_0_11 ).
cnf(c_0_33,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
i_0_4 ).
cnf(c_0_34,plain,
xsd_integer(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_35,negated_conjecture,
( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cAutomobile(icar)
| ~ cCar(iauto) ),
inference(sr,[status(thm)],[c_0_32,c_0_23]) ).
cnf(c_0_36,plain,
~ xsd_string(esk2_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
~ cAutomobile(icar),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_27])]),c_0_34])]),c_0_36]) ).
cnf(c_0_38,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS164+1 : TPTP v8.1.0. Released v3.1.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n023.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 14:34:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 4.42/2.17 # ENIGMATIC: Solved by autoschedule:
% 4.42/2.17 # No SInE strategy applied
% 4.42/2.17 # Trying AutoSched0 for 150 seconds
% 4.42/2.17 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 4.42/2.17 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.42/2.17 #
% 4.42/2.17 # Preprocessing time : 0.023 s
% 4.42/2.17
% 4.42/2.17 # Proof found!
% 4.42/2.17 # SZS status Theorem
% 4.42/2.17 # SZS output start CNFRefutation
% See solution above
% 4.42/2.17 # Training examples: 0 positive, 0 negative
% 4.42/2.17
% 4.42/2.17 # -------------------------------------------------
% 4.42/2.17 # User time : 0.023 s
% 4.42/2.17 # System time : 0.006 s
% 4.42/2.17 # Total time : 0.029 s
% 4.42/2.17 # Maximum resident set size: 7116 pages
% 4.42/2.17
%------------------------------------------------------------------------------