TSTP Solution File: CSR115+10 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+10 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:11 EDT 2022
% Result : Theorem 7.29s 2.62s
% Output : CNFRefutation 7.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_810,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-vy1ub51t/lgb.p',i_0_810) ).
cnf(i_0_295,hypothesis,
val(c57202,bmw_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vy1ub51t/lgb.p',i_0_295) ).
cnf(i_0_296,hypothesis,
sub(c57202,name_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vy1ub51t/lgb.p',i_0_296) ).
cnf(i_0_297,hypothesis,
sub(c57201,firma_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vy1ub51t/lgb.p',i_0_297) ).
cnf(i_0_298,hypothesis,
attr(c57201,c57202),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vy1ub51t/lgb.p',i_0_298) ).
cnf(i_0_789,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-vy1ub51t/lgb.p',i_0_789) ).
cnf(i_0_806,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vy1ub51t/lgb.p',i_0_806) ).
cnf(i_0_808,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vy1ub51t/lgb.p',i_0_808) ).
cnf(i_0_807,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vy1ub51t/lgb.p',i_0_807) ).
cnf(i_0_275,hypothesis,
attr(c59035,c59036),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vy1ub51t/lgb.p',i_0_275) ).
cnf(c_0_821,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_810 ).
cnf(c_0_822,hypothesis,
val(c57202,bmw_0),
i_0_295 ).
cnf(c_0_823,hypothesis,
sub(c57202,name_1_1),
i_0_296 ).
cnf(c_0_824,hypothesis,
( ~ val(X1,bmw_0)
| ~ sub(X1,name_1_1)
| ~ sub(X2,firma_1_1)
| ~ attr(X2,c57202)
| ~ attr(X3,X1)
| ~ attr(X4,X5)
| ~ obj(X6,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_821,c_0_822]),c_0_823])]) ).
cnf(c_0_825,hypothesis,
( ~ sub(X1,firma_1_1)
| ~ attr(X1,c57202)
| ~ attr(X2,c57202)
| ~ attr(X3,X4)
| ~ obj(X5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_824,c_0_822]),c_0_823])]) ).
cnf(c_0_826,hypothesis,
sub(c57201,firma_1_1),
i_0_297 ).
cnf(c_0_827,hypothesis,
attr(c57201,c57202),
i_0_298 ).
cnf(c_0_828,hypothesis,
( ~ attr(X1,c57202)
| ~ attr(X2,X3)
| ~ obj(X4,c57201) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_825,c_0_826]),c_0_827])]) ).
cnf(c_0_829,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,c57201) ),
inference(spm,[status(thm)],[c_0_828,c_0_827]) ).
cnf(c_0_830,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_789 ).
cnf(c_0_831,plain,
( ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,c57201)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_829,c_0_830]) ).
cnf(c_0_832,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
i_0_806 ).
cnf(c_0_833,plain,
( ~ arg2(esk59_2(X1,X2),X3)
| ~ arg1(esk59_2(X1,X2),c57201)
| ~ sub(X1,X2)
| ~ attr(X4,X5) ),
inference(spm,[status(thm)],[c_0_831,c_0_832]) ).
cnf(c_0_834,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
i_0_808 ).
cnf(c_0_835,plain,
( ~ arg2(esk59_2(c57201,X1),X2)
| ~ sub(c57201,X1)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_833,c_0_834]) ).
cnf(c_0_836,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
i_0_807 ).
cnf(c_0_837,plain,
( ~ sub(c57201,X1)
| ~ attr(X2,X3) ),
inference(spm,[status(thm)],[c_0_835,c_0_836]) ).
cnf(c_0_838,hypothesis,
attr(c59035,c59036),
i_0_275 ).
cnf(c_0_839,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_837,c_0_826]) ).
cnf(c_0_840,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_838,c_0_839]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CSR115+10 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n005.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sat Jun 11 11:51:56 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.42 # ENIGMATIC: Selected SinE mode:
% 0.37/0.58 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.58 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.37/0.58 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.37/0.58 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.29/2.62 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.29/2.62 # No SInE strategy applied
% 7.29/2.62 # Trying AutoSched0 for 150 seconds
% 7.29/2.62 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.29/2.62 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.29/2.62 #
% 7.29/2.62 # Preprocessing time : 0.031 s
% 7.29/2.62 # Presaturation interreduction done
% 7.29/2.62
% 7.29/2.62 # Proof found!
% 7.29/2.62 # SZS status Theorem
% 7.29/2.62 # SZS output start CNFRefutation
% See solution above
% 7.29/2.63 # Training examples: 0 positive, 0 negative
% 7.29/2.63
% 7.29/2.63 # -------------------------------------------------
% 7.29/2.63 # User time : 0.061 s
% 7.29/2.63 # System time : 0.010 s
% 7.29/2.63 # Total time : 0.071 s
% 7.29/2.63 # Maximum resident set size: 7120 pages
% 7.29/2.63
%------------------------------------------------------------------------------