TSTP Solution File: CSR115+64 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+64 : 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:22 EDT 2022
% Result : Theorem 8.17s 2.83s
% Output : CNFRefutation 8.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 10 unt; 0 nHn; 28 RR)
% Number of literals : 78 ( 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 : 8 ( 8 usr; 6 con; 0-3 aty)
% Number of variables : 68 ( 37 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_688,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-l3g2zsv5/lgb.p',i_0_688) ).
cnf(i_0_202,hypothesis,
val(c201,bmw_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l3g2zsv5/lgb.p',i_0_202) ).
cnf(i_0_203,hypothesis,
sub(c201,name_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l3g2zsv5/lgb.p',i_0_203) ).
cnf(i_0_204,hypothesis,
sub(c200,firma_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l3g2zsv5/lgb.p',i_0_204) ).
cnf(i_0_205,hypothesis,
attr(c200,c201),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l3g2zsv5/lgb.p',i_0_205) ).
cnf(i_0_667,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-l3g2zsv5/lgb.p',i_0_667) ).
cnf(i_0_684,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l3g2zsv5/lgb.p',i_0_684) ).
cnf(i_0_686,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l3g2zsv5/lgb.p',i_0_686) ).
cnf(i_0_685,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l3g2zsv5/lgb.p',i_0_685) ).
cnf(c_0_698,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_688 ).
cnf(c_0_699,hypothesis,
val(c201,bmw_0),
i_0_202 ).
cnf(c_0_700,hypothesis,
sub(c201,name_1_1),
i_0_203 ).
cnf(c_0_701,hypothesis,
( ~ val(X1,bmw_0)
| ~ sub(X1,name_1_1)
| ~ sub(X2,firma_1_1)
| ~ attr(X2,c201)
| ~ attr(X3,X1)
| ~ attr(X4,X5)
| ~ obj(X6,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_698,c_0_699]),c_0_700])]) ).
cnf(c_0_702,hypothesis,
( ~ sub(X1,firma_1_1)
| ~ attr(X1,c201)
| ~ attr(X2,c201)
| ~ attr(X3,X4)
| ~ obj(X5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_701,c_0_699]),c_0_700])]) ).
cnf(c_0_703,hypothesis,
sub(c200,firma_1_1),
i_0_204 ).
cnf(c_0_704,hypothesis,
attr(c200,c201),
i_0_205 ).
cnf(c_0_705,hypothesis,
( ~ attr(X1,c201)
| ~ attr(X2,X3)
| ~ obj(X4,c200) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_702,c_0_703]),c_0_704])]) ).
cnf(c_0_706,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,c200) ),
inference(spm,[status(thm)],[c_0_705,c_0_704]) ).
cnf(c_0_707,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_667 ).
cnf(c_0_708,plain,
( ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,c200)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_706,c_0_707]) ).
cnf(c_0_709,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
i_0_684 ).
cnf(c_0_710,plain,
( ~ arg2(esk59_2(X1,X2),X3)
| ~ arg1(esk59_2(X1,X2),c200)
| ~ sub(X1,X2)
| ~ attr(X4,X5) ),
inference(spm,[status(thm)],[c_0_708,c_0_709]) ).
cnf(c_0_711,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
i_0_686 ).
cnf(c_0_712,plain,
( ~ arg2(esk59_2(c200,X1),X2)
| ~ sub(c200,X1)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_710,c_0_711]) ).
cnf(c_0_713,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
i_0_685 ).
cnf(c_0_714,plain,
( ~ sub(c200,X1)
| ~ attr(X2,X3) ),
inference(spm,[status(thm)],[c_0_712,c_0_713]) ).
cnf(c_0_715,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_714,c_0_703]) ).
cnf(c_0_716,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_704,c_0_715]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : CSR115+64 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 11 01:24:26 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.48 # ENIGMATIC: Selected SinE mode:
% 0.46/0.65 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.46/0.65 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.46/0.65 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.46/0.65 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.17/2.83 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.17/2.83 # No SInE strategy applied
% 8.17/2.83 # Trying AutoSched0 for 150 seconds
% 8.17/2.83 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.17/2.83 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.17/2.83 #
% 8.17/2.83 # Preprocessing time : 0.016 s
% 8.17/2.83 # Presaturation interreduction done
% 8.17/2.83
% 8.17/2.83 # Proof found!
% 8.17/2.83 # SZS status Theorem
% 8.17/2.83 # SZS output start CNFRefutation
% See solution above
% 8.17/2.83 # Training examples: 0 positive, 0 negative
% 8.17/2.83
% 8.17/2.83 # -------------------------------------------------
% 8.17/2.83 # User time : 0.026 s
% 8.17/2.83 # System time : 0.010 s
% 8.17/2.83 # Total time : 0.036 s
% 8.17/2.83 # Maximum resident set size: 7124 pages
% 8.17/2.83
%------------------------------------------------------------------------------