TSTP Solution File: KRS137+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS137+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:54 EDT 2022
% Result : Theorem 7.76s 2.36s
% Output : CNFRefutation 7.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 10 unt; 6 nHn; 24 RR)
% Number of literals : 58 ( 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/sandbox/tmp/enigma-theBenchmark.p-g4i3ixcd/lgb.p',i_0_12) ).
cnf(i_0_1,plain,
~ cowlNothing(X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g4i3ixcd/lgb.p',i_0_1) ).
cnf(i_0_11,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cCar(iauto)
| ~ cAutomobile(icar) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g4i3ixcd/lgb.p',i_0_11) ).
cnf(i_0_6,plain,
( cAutomobile(X1)
| ~ cCar(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g4i3ixcd/lgb.p',i_0_6) ).
cnf(i_0_10,plain,
cCar(icar),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g4i3ixcd/lgb.p',i_0_10) ).
cnf(i_0_3,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g4i3ixcd/lgb.p',i_0_3) ).
cnf(i_0_5,plain,
( cCar(X1)
| ~ cAutomobile(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g4i3ixcd/lgb.p',i_0_5) ).
cnf(i_0_8,plain,
cAutomobile(iauto),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g4i3ixcd/lgb.p',i_0_8) ).
cnf(i_0_4,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g4i3ixcd/lgb.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,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cCar(iauto)
| ~ cAutomobile(icar) ),
i_0_11 ).
cnf(c_0_25,negated_conjecture,
( xsd_integer(esk2_0)
| ~ cAutomobile(icar)
| ~ cCar(iauto)
| ~ xsd_string(esk2_0) ),
inference(sr,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( cAutomobile(X1)
| ~ cCar(X1) ),
i_0_6 ).
cnf(c_0_27,plain,
cCar(icar),
i_0_10 ).
cnf(c_0_28,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
i_0_3 ).
cnf(c_0_29,negated_conjecture,
( xsd_string(esk2_0)
| ~ cAutomobile(icar)
| ~ cCar(iauto)
| ~ xsd_integer(esk2_0) ),
inference(sr,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( xsd_integer(esk2_0)
| ~ cCar(iauto) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_31,plain,
( cCar(X1)
| ~ cAutomobile(X1) ),
i_0_5 ).
cnf(c_0_32,plain,
cAutomobile(iauto),
i_0_8 ).
cnf(c_0_33,negated_conjecture,
( xsd_string(esk2_0)
| ~ cCar(iauto) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_26]),c_0_27])]),c_0_30]) ).
cnf(c_0_34,plain,
cCar(iauto),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
i_0_4 ).
cnf(c_0_36,negated_conjecture,
xsd_string(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_37,plain,
~ xsd_integer(esk2_0),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_34])]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS137+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % 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 16:02:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.76/2.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.76/2.36 # No SInE strategy applied
% 7.76/2.36 # Trying AutoSched0 for 150 seconds
% 7.76/2.36 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 7.76/2.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.76/2.36 #
% 7.76/2.36 # Preprocessing time : 0.013 s
% 7.76/2.36
% 7.76/2.36 # Proof found!
% 7.76/2.36 # SZS status Theorem
% 7.76/2.36 # SZS output start CNFRefutation
% See solution above
% 7.76/2.36 # Training examples: 0 positive, 0 negative
% 7.76/2.36
% 7.76/2.36 # -------------------------------------------------
% 7.76/2.36 # User time : 0.014 s
% 7.76/2.36 # System time : 0.005 s
% 7.76/2.36 # Total time : 0.018 s
% 7.76/2.36 # Maximum resident set size: 7124 pages
% 7.76/2.36
%------------------------------------------------------------------------------