TSTP Solution File: CSR115+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:15 EDT 2022
% Result : Theorem 8.19s 2.75s
% Output : CNFRefutation 8.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 10 unt; 0 nHn; 27 RR)
% Number of literals : 64 ( 0 equ; 47 neg)
% Maximal clause size : 6 ( 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 : 60 ( 33 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_830,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ sub(X2,firma_1_1)
| ~ sub(X6,name_1_1)
| ~ val(X6,bmw_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8hk2nlh7/lgb.p',i_0_830) ).
cnf(i_0_311,hypothesis,
val(c1167,bmw_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8hk2nlh7/lgb.p',i_0_311) ).
cnf(i_0_312,hypothesis,
sub(c1167,name_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8hk2nlh7/lgb.p',i_0_312) ).
cnf(i_0_292,hypothesis,
sub(c73,firma_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8hk2nlh7/lgb.p',i_0_292) ).
cnf(i_0_314,hypothesis,
attr(c1166,c1167),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8hk2nlh7/lgb.p',i_0_314) ).
cnf(i_0_809,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-8hk2nlh7/lgb.p',i_0_809) ).
cnf(i_0_826,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8hk2nlh7/lgb.p',i_0_826) ).
cnf(i_0_828,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8hk2nlh7/lgb.p',i_0_828) ).
cnf(i_0_827,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8hk2nlh7/lgb.p',i_0_827) ).
cnf(c_0_840,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ sub(X2,firma_1_1)
| ~ sub(X6,name_1_1)
| ~ val(X6,bmw_0) ),
i_0_830 ).
cnf(c_0_841,hypothesis,
val(c1167,bmw_0),
i_0_311 ).
cnf(c_0_842,hypothesis,
sub(c1167,name_1_1),
i_0_312 ).
cnf(c_0_843,hypothesis,
( ~ sub(X1,firma_1_1)
| ~ attr(X2,c1167)
| ~ attr(X3,X4)
| ~ obj(X5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_840,c_0_841]),c_0_842])]) ).
cnf(c_0_844,hypothesis,
sub(c73,firma_1_1),
i_0_292 ).
cnf(c_0_845,hypothesis,
( ~ attr(X1,c1167)
| ~ attr(X2,X3)
| ~ obj(X4,c73) ),
inference(spm,[status(thm)],[c_0_843,c_0_844]) ).
cnf(c_0_846,hypothesis,
attr(c1166,c1167),
i_0_314 ).
cnf(c_0_847,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,c73) ),
inference(spm,[status(thm)],[c_0_845,c_0_846]) ).
cnf(c_0_848,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_809 ).
cnf(c_0_849,hypothesis,
( ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,c73)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_847,c_0_848]) ).
cnf(c_0_850,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
i_0_826 ).
cnf(c_0_851,plain,
( ~ arg2(esk59_2(X1,X2),X3)
| ~ arg1(esk59_2(X1,X2),c73)
| ~ sub(X1,X2)
| ~ attr(X4,X5) ),
inference(spm,[status(thm)],[c_0_849,c_0_850]) ).
cnf(c_0_852,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
i_0_828 ).
cnf(c_0_853,plain,
( ~ arg2(esk59_2(c73,X1),X2)
| ~ sub(c73,X1)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_851,c_0_852]) ).
cnf(c_0_854,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
i_0_827 ).
cnf(c_0_855,plain,
( ~ sub(c73,X1)
| ~ attr(X2,X3) ),
inference(spm,[status(thm)],[c_0_853,c_0_854]) ).
cnf(c_0_856,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_855,c_0_844]) ).
cnf(c_0_857,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_846,c_0_856]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : CSR115+2 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.31 % Computer : n028.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Sat Jun 11 16:09:52 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.17/0.42 # ENIGMATIC: Selected SinE mode:
% 0.17/0.57 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.57 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.17/0.57 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.17/0.57 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.19/2.75 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.19/2.75 # No SInE strategy applied
% 8.19/2.75 # Trying AutoSched0 for 150 seconds
% 8.19/2.75 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.19/2.75 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.19/2.75 #
% 8.19/2.75 # Preprocessing time : 0.028 s
% 8.19/2.75 # Presaturation interreduction done
% 8.19/2.75
% 8.19/2.75 # Proof found!
% 8.19/2.75 # SZS status Theorem
% 8.19/2.75 # SZS output start CNFRefutation
% See solution above
% 8.19/2.75 # Training examples: 0 positive, 0 negative
% 8.19/2.75
% 8.19/2.75 # -------------------------------------------------
% 8.19/2.75 # User time : 0.058 s
% 8.19/2.75 # System time : 0.006 s
% 8.19/2.75 # Total time : 0.065 s
% 8.19/2.75 # Maximum resident set size: 7120 pages
% 8.19/2.75
%------------------------------------------------------------------------------