TSTP Solution File: CSR115+26 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+26 : 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:14 EDT 2022
% Result : Theorem 9.89s 2.95s
% Output : CNFRefutation 9.89s
% 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 : 9 ( 9 usr; 7 con; 0-3 aty)
% Number of variables : 68 ( 37 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_778,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-al1l6s7r/lgb.p',i_0_778) ).
cnf(i_0_275,hypothesis,
val(c1099,bmw_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-al1l6s7r/lgb.p',i_0_275) ).
cnf(i_0_276,hypothesis,
sub(c1099,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-al1l6s7r/lgb.p',i_0_276) ).
cnf(i_0_290,hypothesis,
sub(c1022,firma_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-al1l6s7r/lgb.p',i_0_290) ).
cnf(i_0_291,hypothesis,
attr(c1022,c1099),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-al1l6s7r/lgb.p',i_0_291) ).
cnf(i_0_757,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-al1l6s7r/lgb.p',i_0_757) ).
cnf(i_0_774,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-al1l6s7r/lgb.p',i_0_774) ).
cnf(i_0_776,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-al1l6s7r/lgb.p',i_0_776) ).
cnf(i_0_775,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-al1l6s7r/lgb.p',i_0_775) ).
cnf(i_0_292,hypothesis,
attr(c1022,c1023),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-al1l6s7r/lgb.p',i_0_292) ).
cnf(c_0_789,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_778 ).
cnf(c_0_790,hypothesis,
val(c1099,bmw_0),
i_0_275 ).
cnf(c_0_791,hypothesis,
sub(c1099,name_1_1),
i_0_276 ).
cnf(c_0_792,hypothesis,
( ~ val(X1,bmw_0)
| ~ sub(X1,name_1_1)
| ~ sub(X2,firma_1_1)
| ~ attr(X2,c1099)
| ~ attr(X3,X1)
| ~ attr(X4,X5)
| ~ obj(X6,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_789,c_0_790]),c_0_791])]) ).
cnf(c_0_793,hypothesis,
( ~ sub(X1,firma_1_1)
| ~ attr(X1,c1099)
| ~ attr(X2,c1099)
| ~ attr(X3,X4)
| ~ obj(X5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_792,c_0_790]),c_0_791])]) ).
cnf(c_0_794,hypothesis,
sub(c1022,firma_1_1),
i_0_290 ).
cnf(c_0_795,hypothesis,
attr(c1022,c1099),
i_0_291 ).
cnf(c_0_796,hypothesis,
( ~ attr(X1,c1099)
| ~ attr(X2,X3)
| ~ obj(X4,c1022) ),
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,
( ~ attr(X1,X2)
| ~ obj(X3,c1022) ),
inference(spm,[status(thm)],[c_0_796,c_0_795]) ).
cnf(c_0_798,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_757 ).
cnf(c_0_799,plain,
( ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,c1022)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_797,c_0_798]) ).
cnf(c_0_800,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
i_0_774 ).
cnf(c_0_801,plain,
( ~ arg2(esk59_2(X1,X2),X3)
| ~ arg1(esk59_2(X1,X2),c1022)
| ~ sub(X1,X2)
| ~ attr(X4,X5) ),
inference(spm,[status(thm)],[c_0_799,c_0_800]) ).
cnf(c_0_802,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
i_0_776 ).
cnf(c_0_803,plain,
( ~ arg2(esk59_2(c1022,X1),X2)
| ~ sub(c1022,X1)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_801,c_0_802]) ).
cnf(c_0_804,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
i_0_775 ).
cnf(c_0_805,plain,
( ~ sub(c1022,X1)
| ~ attr(X2,X3) ),
inference(spm,[status(thm)],[c_0_803,c_0_804]) ).
cnf(c_0_806,hypothesis,
attr(c1022,c1023),
i_0_292 ).
cnf(c_0_807,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_805,c_0_794]) ).
cnf(c_0_808,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_806,c_0_807]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : CSR115+26 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n022.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 : Fri Jun 10 04:29:21 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.42/0.60 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.60 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.42/0.60 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.42/0.60 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.89/2.95 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.89/2.95 # No SInE strategy applied
% 9.89/2.95 # Trying AutoSched0 for 150 seconds
% 9.89/2.95 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 9.89/2.95 # and selection function SelectComplexExceptUniqMaxHorn.
% 9.89/2.95 #
% 9.89/2.95 # Preprocessing time : 0.018 s
% 9.89/2.95 # Presaturation interreduction done
% 9.89/2.95
% 9.89/2.95 # Proof found!
% 9.89/2.95 # SZS status Theorem
% 9.89/2.95 # SZS output start CNFRefutation
% See solution above
% 9.89/2.95 # Training examples: 0 positive, 0 negative
% 9.89/2.95
% 9.89/2.95 # -------------------------------------------------
% 9.89/2.95 # User time : 0.041 s
% 9.89/2.95 # System time : 0.003 s
% 9.89/2.95 # Total time : 0.045 s
% 9.89/2.95 # Maximum resident set size: 7132 pages
% 9.89/2.95
%------------------------------------------------------------------------------