TSTP Solution File: CSR115+31 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+31 : 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:15 EDT 2022
% Result : Theorem 7.50s 2.73s
% Output : CNFRefutation 7.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of clauses : 39 ( 17 unt; 0 nHn; 39 RR)
% Number of literals : 106 ( 0 equ; 81 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-3 aty)
% Number of variables : 82 ( 30 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_796,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7)
| ~ val(X4,X8)
| ~ sub(X4,jahr__1_1)
| ~ sub(X6,name_1_1)
| ~ sub(X7,name_1_1)
| ~ has_card_leq(X8,int1994) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c2k6aw63/lgb.p',i_0_796) ).
cnf(i_0_618,plain,
( has_card_leq(X1,X2)
| ~ card(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c2k6aw63/lgb.p',i_0_618) ).
cnf(i_0_152,hypothesis,
card(c5136,int1994),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c2k6aw63/lgb.p',i_0_152) ).
cnf(i_0_310,hypothesis,
sub(c12,name_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c2k6aw63/lgb.p',i_0_310) ).
cnf(i_0_302,hypothesis,
sub(c5139,jahr__1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c2k6aw63/lgb.p',i_0_302) ).
cnf(i_0_301,hypothesis,
val(c5139,c5136),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c2k6aw63/lgb.p',i_0_301) ).
cnf(i_0_312,hypothesis,
attr(c11,c12),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c2k6aw63/lgb.p',i_0_312) ).
cnf(i_0_303,hypothesis,
attr(c5138,c5139),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c2k6aw63/lgb.p',i_0_303) ).
cnf(i_0_775,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-c2k6aw63/lgb.p',i_0_775) ).
cnf(i_0_792,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c2k6aw63/lgb.p',i_0_792) ).
cnf(i_0_793,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c2k6aw63/lgb.p',i_0_793) ).
cnf(i_0_794,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c2k6aw63/lgb.p',i_0_794) ).
cnf(i_0_311,hypothesis,
sub(c11,stadt__1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c2k6aw63/lgb.p',i_0_311) ).
cnf(c_0_810,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7)
| ~ val(X4,X8)
| ~ sub(X4,jahr__1_1)
| ~ sub(X6,name_1_1)
| ~ sub(X7,name_1_1)
| ~ has_card_leq(X8,int1994) ),
i_0_796 ).
cnf(c_0_811,plain,
( has_card_leq(X1,X2)
| ~ card(X1,X2) ),
i_0_618 ).
cnf(c_0_812,plain,
( ~ card(X1,int1994)
| ~ sub(X2,name_1_1)
| ~ sub(X3,name_1_1)
| ~ sub(X4,jahr__1_1)
| ~ val(X4,X1)
| ~ attr(X5,X3)
| ~ attr(X6,X4)
| ~ attr(X7,X2)
| ~ obj(X8,X7) ),
inference(spm,[status(thm)],[c_0_810,c_0_811]) ).
cnf(c_0_813,hypothesis,
card(c5136,int1994),
i_0_152 ).
cnf(c_0_814,hypothesis,
( ~ sub(X1,name_1_1)
| ~ sub(X2,name_1_1)
| ~ sub(X3,jahr__1_1)
| ~ val(X3,c5136)
| ~ attr(X4,X2)
| ~ attr(X5,X3)
| ~ attr(X6,X1)
| ~ obj(X7,X6) ),
inference(spm,[status(thm)],[c_0_812,c_0_813]) ).
cnf(c_0_815,hypothesis,
sub(c12,name_1_1),
i_0_310 ).
cnf(c_0_816,hypothesis,
( ~ sub(X1,name_1_1)
| ~ sub(X2,jahr__1_1)
| ~ val(X2,c5136)
| ~ attr(X3,c12)
| ~ attr(X4,X1)
| ~ attr(X5,X2)
| ~ obj(X6,X3) ),
inference(spm,[status(thm)],[c_0_814,c_0_815]) ).
cnf(c_0_817,hypothesis,
( ~ sub(X1,jahr__1_1)
| ~ val(X1,c5136)
| ~ attr(X2,c12)
| ~ attr(X3,c12)
| ~ attr(X4,X1)
| ~ obj(X5,X2) ),
inference(spm,[status(thm)],[c_0_816,c_0_815]) ).
cnf(c_0_818,hypothesis,
sub(c5139,jahr__1_1),
i_0_302 ).
cnf(c_0_819,hypothesis,
val(c5139,c5136),
i_0_301 ).
cnf(c_0_820,hypothesis,
( ~ attr(X1,c12)
| ~ attr(X2,c12)
| ~ attr(X3,c5139)
| ~ obj(X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_817,c_0_818]),c_0_819])]) ).
cnf(c_0_821,hypothesis,
attr(c11,c12),
i_0_312 ).
cnf(c_0_822,hypothesis,
( ~ attr(X1,c12)
| ~ attr(X2,c5139)
| ~ obj(X3,c11) ),
inference(spm,[status(thm)],[c_0_820,c_0_821]) ).
cnf(c_0_823,hypothesis,
( ~ attr(X1,c5139)
| ~ obj(X2,c11) ),
inference(spm,[status(thm)],[c_0_822,c_0_821]) ).
cnf(c_0_824,hypothesis,
attr(c5138,c5139),
i_0_303 ).
cnf(c_0_825,hypothesis,
~ obj(X1,c11),
inference(spm,[status(thm)],[c_0_823,c_0_824]) ).
cnf(c_0_826,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_775 ).
cnf(c_0_827,plain,
( ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,c11) ),
inference(spm,[status(thm)],[c_0_825,c_0_826]) ).
cnf(c_0_828,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
i_0_792 ).
cnf(c_0_829,plain,
( ~ arg2(esk59_2(X1,X2),X3)
| ~ arg1(esk59_2(X1,X2),c11)
| ~ sub(X1,X2) ),
inference(spm,[status(thm)],[c_0_827,c_0_828]) ).
cnf(c_0_830,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
i_0_793 ).
cnf(c_0_831,plain,
( ~ arg1(esk59_2(X1,X2),c11)
| ~ sub(X1,X2) ),
inference(spm,[status(thm)],[c_0_829,c_0_830]) ).
cnf(c_0_832,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
i_0_794 ).
cnf(c_0_833,hypothesis,
sub(c11,stadt__1_1),
i_0_311 ).
cnf(c_0_834,plain,
~ sub(c11,X1),
inference(spm,[status(thm)],[c_0_831,c_0_832]) ).
cnf(c_0_835,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_833,c_0_834]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : CSR115+31 : TPTP v8.1.0. Released v4.0.0.
% 0.10/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 : Sat Jun 11 06:52:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.58 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.58 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.58 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.58 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.50/2.73 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.50/2.73 # No SInE strategy applied
% 7.50/2.73 # Trying AutoSched0 for 150 seconds
% 7.50/2.73 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.50/2.73 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.50/2.73 #
% 7.50/2.73 # Preprocessing time : 0.037 s
% 7.50/2.73 # Presaturation interreduction done
% 7.50/2.73
% 7.50/2.73 # Proof found!
% 7.50/2.73 # SZS status Theorem
% 7.50/2.73 # SZS output start CNFRefutation
% See solution above
% 7.50/2.73 # Training examples: 0 positive, 0 negative
% 7.50/2.73
% 7.50/2.73 # -------------------------------------------------
% 7.50/2.73 # User time : 0.069 s
% 7.50/2.73 # System time : 0.009 s
% 7.50/2.73 # Total time : 0.079 s
% 7.50/2.73 # Maximum resident set size: 7124 pages
% 7.50/2.73
%------------------------------------------------------------------------------