TSTP Solution File: CSR115+16 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+16 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:12 EDT 2022
% Result : Theorem 8.04s 2.79s
% Output : CNFRefutation 8.04s
% 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_699,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-n4t4gd41/lgb.p',i_0_699) ).
cnf(i_0_207,hypothesis,
val(c408,bmw_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n4t4gd41/lgb.p',i_0_207) ).
cnf(i_0_208,hypothesis,
sub(c408,name_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n4t4gd41/lgb.p',i_0_208) ).
cnf(i_0_209,hypothesis,
sub(c407,firma_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n4t4gd41/lgb.p',i_0_209) ).
cnf(i_0_211,hypothesis,
attr(c407,c408),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n4t4gd41/lgb.p',i_0_211) ).
cnf(i_0_678,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-n4t4gd41/lgb.p',i_0_678) ).
cnf(i_0_695,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n4t4gd41/lgb.p',i_0_695) ).
cnf(i_0_697,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n4t4gd41/lgb.p',i_0_697) ).
cnf(i_0_696,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n4t4gd41/lgb.p',i_0_696) ).
cnf(i_0_210,hypothesis,
attr(c407,c413),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n4t4gd41/lgb.p',i_0_210) ).
cnf(c_0_710,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_699 ).
cnf(c_0_711,hypothesis,
val(c408,bmw_0),
i_0_207 ).
cnf(c_0_712,hypothesis,
sub(c408,name_1_1),
i_0_208 ).
cnf(c_0_713,hypothesis,
( ~ val(X1,bmw_0)
| ~ sub(X1,name_1_1)
| ~ sub(X2,firma_1_1)
| ~ attr(X2,c408)
| ~ attr(X3,X1)
| ~ attr(X4,X5)
| ~ obj(X6,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_710,c_0_711]),c_0_712])]) ).
cnf(c_0_714,hypothesis,
( ~ sub(X1,firma_1_1)
| ~ attr(X1,c408)
| ~ attr(X2,c408)
| ~ attr(X3,X4)
| ~ obj(X5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_713,c_0_711]),c_0_712])]) ).
cnf(c_0_715,hypothesis,
sub(c407,firma_1_1),
i_0_209 ).
cnf(c_0_716,hypothesis,
attr(c407,c408),
i_0_211 ).
cnf(c_0_717,hypothesis,
( ~ attr(X1,c408)
| ~ attr(X2,X3)
| ~ obj(X4,c407) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_714,c_0_715]),c_0_716])]) ).
cnf(c_0_718,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,c407) ),
inference(spm,[status(thm)],[c_0_717,c_0_716]) ).
cnf(c_0_719,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_678 ).
cnf(c_0_720,plain,
( ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,c407)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_718,c_0_719]) ).
cnf(c_0_721,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
i_0_695 ).
cnf(c_0_722,plain,
( ~ arg2(esk59_2(X1,X2),X3)
| ~ arg1(esk59_2(X1,X2),c407)
| ~ sub(X1,X2)
| ~ attr(X4,X5) ),
inference(spm,[status(thm)],[c_0_720,c_0_721]) ).
cnf(c_0_723,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
i_0_697 ).
cnf(c_0_724,plain,
( ~ arg2(esk59_2(c407,X1),X2)
| ~ sub(c407,X1)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_722,c_0_723]) ).
cnf(c_0_725,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
i_0_696 ).
cnf(c_0_726,plain,
( ~ sub(c407,X1)
| ~ attr(X2,X3) ),
inference(spm,[status(thm)],[c_0_724,c_0_725]) ).
cnf(c_0_727,hypothesis,
attr(c407,c413),
i_0_210 ).
cnf(c_0_728,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_726,c_0_715]) ).
cnf(c_0_729,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_727,c_0_728]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR115+16 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n027.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 : Fri Jun 10 23:22:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.39/0.58 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.58 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.39/0.58 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.39/0.58 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.04/2.79 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.04/2.79 # No SInE strategy applied
% 8.04/2.79 # Trying AutoSched0 for 150 seconds
% 8.04/2.79 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.04/2.79 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.04/2.79 #
% 8.04/2.79 # Preprocessing time : 0.028 s
% 8.04/2.79 # Presaturation interreduction done
% 8.04/2.79
% 8.04/2.79 # Proof found!
% 8.04/2.79 # SZS status Theorem
% 8.04/2.79 # SZS output start CNFRefutation
% See solution above
% 8.04/2.79 # Training examples: 0 positive, 0 negative
% 8.04/2.79
% 8.04/2.79 # -------------------------------------------------
% 8.04/2.79 # User time : 0.046 s
% 8.04/2.79 # System time : 0.008 s
% 8.04/2.79 # Total time : 0.054 s
% 8.04/2.79 # Maximum resident set size: 7124 pages
% 8.04/2.79
%------------------------------------------------------------------------------