TSTP Solution File: CSR115+38 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+38 : TPTP v8.1.0. Released v4.0.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 : Fri Jul 15 02:49:17 EDT 2022
% Result : Theorem 9.70s 2.91s
% Output : CNFRefutation 9.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 30 ( 12 unt; 0 nHn; 30 RR)
% Number of literals : 80 ( 0 equ; 61 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-3 aty)
% Number of variables : 68 ( 37 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_826,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7)
| ~ sub(X6,name_1_1)
| ~ sub(X7,name_1_1)
| ~ sub(X2,firma_1_1)
| ~ val(X6,bmw_0)
| ~ val(X7,bmw_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az320ygy/lgb.p',i_0_826) ).
cnf(i_0_323,hypothesis,
val(c2837,bmw_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az320ygy/lgb.p',i_0_323) ).
cnf(i_0_324,hypothesis,
sub(c2837,name_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az320ygy/lgb.p',i_0_324) ).
cnf(i_0_325,hypothesis,
sub(c2836,firma_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az320ygy/lgb.p',i_0_325) ).
cnf(i_0_326,hypothesis,
attr(c2836,c2837),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az320ygy/lgb.p',i_0_326) ).
cnf(i_0_805,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az320ygy/lgb.p',i_0_805) ).
cnf(i_0_822,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az320ygy/lgb.p',i_0_822) ).
cnf(i_0_824,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az320ygy/lgb.p',i_0_824) ).
cnf(i_0_823,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az320ygy/lgb.p',i_0_823) ).
cnf(i_0_339,hypothesis,
attr(c11,c12),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az320ygy/lgb.p',i_0_339) ).
cnf(c_0_837,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7)
| ~ sub(X6,name_1_1)
| ~ sub(X7,name_1_1)
| ~ sub(X2,firma_1_1)
| ~ val(X6,bmw_0)
| ~ val(X7,bmw_0) ),
i_0_826 ).
cnf(c_0_838,hypothesis,
val(c2837,bmw_0),
i_0_323 ).
cnf(c_0_839,hypothesis,
sub(c2837,name_1_1),
i_0_324 ).
cnf(c_0_840,hypothesis,
( ~ val(X1,bmw_0)
| ~ sub(X1,name_1_1)
| ~ sub(X2,firma_1_1)
| ~ attr(X2,c2837)
| ~ attr(X3,X1)
| ~ attr(X4,X5)
| ~ obj(X6,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_837,c_0_838]),c_0_839])]) ).
cnf(c_0_841,hypothesis,
( ~ sub(X1,firma_1_1)
| ~ attr(X1,c2837)
| ~ attr(X2,c2837)
| ~ attr(X3,X4)
| ~ obj(X5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_840,c_0_838]),c_0_839])]) ).
cnf(c_0_842,hypothesis,
sub(c2836,firma_1_1),
i_0_325 ).
cnf(c_0_843,hypothesis,
attr(c2836,c2837),
i_0_326 ).
cnf(c_0_844,hypothesis,
( ~ attr(X1,c2837)
| ~ attr(X2,X3)
| ~ obj(X4,c2836) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_841,c_0_842]),c_0_843])]) ).
cnf(c_0_845,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,c2836) ),
inference(spm,[status(thm)],[c_0_844,c_0_843]) ).
cnf(c_0_846,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_805 ).
cnf(c_0_847,plain,
( ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,c2836)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_845,c_0_846]) ).
cnf(c_0_848,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
i_0_822 ).
cnf(c_0_849,plain,
( ~ arg2(esk59_2(X1,X2),X3)
| ~ arg1(esk59_2(X1,X2),c2836)
| ~ sub(X1,X2)
| ~ attr(X4,X5) ),
inference(spm,[status(thm)],[c_0_847,c_0_848]) ).
cnf(c_0_850,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
i_0_824 ).
cnf(c_0_851,plain,
( ~ arg2(esk59_2(c2836,X1),X2)
| ~ sub(c2836,X1)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_849,c_0_850]) ).
cnf(c_0_852,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
i_0_823 ).
cnf(c_0_853,plain,
( ~ sub(c2836,X1)
| ~ attr(X2,X3) ),
inference(spm,[status(thm)],[c_0_851,c_0_852]) ).
cnf(c_0_854,hypothesis,
attr(c11,c12),
i_0_339 ).
cnf(c_0_855,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_853,c_0_842]) ).
cnf(c_0_856,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_854,c_0_855]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR115+38 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n024.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 : Sat Jun 11 07:09:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.41/0.59 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.41/0.59 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.41/0.59 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.41/0.59 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.70/2.91 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.70/2.91 # No SInE strategy applied
% 9.70/2.91 # Trying AutoSched0 for 150 seconds
% 9.70/2.91 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 9.70/2.91 # and selection function SelectComplexExceptUniqMaxHorn.
% 9.70/2.91 #
% 9.70/2.91 # Preprocessing time : 0.027 s
% 9.70/2.91 # Presaturation interreduction done
% 9.70/2.91
% 9.70/2.91 # Proof found!
% 9.70/2.91 # SZS status Theorem
% 9.70/2.91 # SZS output start CNFRefutation
% See solution above
% 9.70/2.91 # Training examples: 0 positive, 0 negative
% 9.70/2.91
% 9.70/2.91 # -------------------------------------------------
% 9.70/2.91 # User time : 0.049 s
% 9.70/2.91 # System time : 0.006 s
% 9.70/2.91 # Total time : 0.056 s
% 9.70/2.91 # Maximum resident set size: 7124 pages
% 9.70/2.91
%------------------------------------------------------------------------------