TSTP Solution File: CSR115+98 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+98 : TPTP v8.1.0. Released v4.0.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 : Fri Jul 15 02:49:28 EDT 2022
% Result : Theorem 9.29s 2.82s
% Output : CNFRefutation 9.29s
% 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_782,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/sandbox/tmp/enigma-theBenchmark.p-d1yrqs8q/lgb.p',i_0_782) ).
cnf(i_0_275,hypothesis,
val(c9771,bmw_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d1yrqs8q/lgb.p',i_0_275) ).
cnf(i_0_276,hypothesis,
sub(c9771,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d1yrqs8q/lgb.p',i_0_276) ).
cnf(i_0_277,hypothesis,
sub(c9770,firma_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d1yrqs8q/lgb.p',i_0_277) ).
cnf(i_0_278,hypothesis,
attr(c9770,c9771),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d1yrqs8q/lgb.p',i_0_278) ).
cnf(i_0_761,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d1yrqs8q/lgb.p',i_0_761) ).
cnf(i_0_778,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d1yrqs8q/lgb.p',i_0_778) ).
cnf(i_0_780,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d1yrqs8q/lgb.p',i_0_780) ).
cnf(i_0_779,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d1yrqs8q/lgb.p',i_0_779) ).
cnf(i_0_296,hypothesis,
attr(c11400,c11401),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d1yrqs8q/lgb.p',i_0_296) ).
cnf(c_0_793,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_782 ).
cnf(c_0_794,hypothesis,
val(c9771,bmw_0),
i_0_275 ).
cnf(c_0_795,hypothesis,
sub(c9771,name_1_1),
i_0_276 ).
cnf(c_0_796,hypothesis,
( ~ val(X1,bmw_0)
| ~ sub(X1,name_1_1)
| ~ sub(X2,firma_1_1)
| ~ attr(X2,c9771)
| ~ attr(X3,X1)
| ~ attr(X4,X5)
| ~ obj(X6,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_793,c_0_794]),c_0_795])]) ).
cnf(c_0_797,hypothesis,
( ~ sub(X1,firma_1_1)
| ~ attr(X1,c9771)
| ~ attr(X2,c9771)
| ~ attr(X3,X4)
| ~ obj(X5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_796,c_0_794]),c_0_795])]) ).
cnf(c_0_798,hypothesis,
sub(c9770,firma_1_1),
i_0_277 ).
cnf(c_0_799,hypothesis,
attr(c9770,c9771),
i_0_278 ).
cnf(c_0_800,hypothesis,
( ~ attr(X1,c9771)
| ~ attr(X2,X3)
| ~ obj(X4,c9770) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_797,c_0_798]),c_0_799])]) ).
cnf(c_0_801,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,c9770) ),
inference(spm,[status(thm)],[c_0_800,c_0_799]) ).
cnf(c_0_802,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_761 ).
cnf(c_0_803,plain,
( ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,c9770)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_801,c_0_802]) ).
cnf(c_0_804,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
i_0_778 ).
cnf(c_0_805,plain,
( ~ arg2(esk59_2(X1,X2),X3)
| ~ arg1(esk59_2(X1,X2),c9770)
| ~ sub(X1,X2)
| ~ attr(X4,X5) ),
inference(spm,[status(thm)],[c_0_803,c_0_804]) ).
cnf(c_0_806,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
i_0_780 ).
cnf(c_0_807,plain,
( ~ arg2(esk59_2(c9770,X1),X2)
| ~ sub(c9770,X1)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_805,c_0_806]) ).
cnf(c_0_808,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
i_0_779 ).
cnf(c_0_809,plain,
( ~ sub(c9770,X1)
| ~ attr(X2,X3) ),
inference(spm,[status(thm)],[c_0_807,c_0_808]) ).
cnf(c_0_810,hypothesis,
attr(c11400,c11401),
i_0_296 ).
cnf(c_0_811,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_809,c_0_798]) ).
cnf(c_0_812,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_810,c_0_811]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : CSR115+98 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jun 11 12:26:35 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.42/0.61 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.61 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.42/0.61 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.42/0.61 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.29/2.82 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.29/2.82 # No SInE strategy applied
% 9.29/2.82 # Trying AutoSched0 for 150 seconds
% 9.29/2.82 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 9.29/2.82 # and selection function SelectComplexExceptUniqMaxHorn.
% 9.29/2.82 #
% 9.29/2.82 # Preprocessing time : 0.030 s
% 9.29/2.82 # Presaturation interreduction done
% 9.29/2.82
% 9.29/2.82 # Proof found!
% 9.29/2.82 # SZS status Theorem
% 9.29/2.82 # SZS output start CNFRefutation
% See solution above
% 9.29/2.82 # Training examples: 0 positive, 0 negative
% 9.29/2.82
% 9.29/2.82 # -------------------------------------------------
% 9.29/2.82 # User time : 0.056 s
% 9.29/2.82 # System time : 0.014 s
% 9.29/2.82 # Total time : 0.070 s
% 9.29/2.82 # Maximum resident set size: 7124 pages
% 9.29/2.82
%------------------------------------------------------------------------------