TSTP Solution File: CSR115+22 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+22 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:14 EDT 2022
% Result : Theorem 5.34s 2.90s
% Output : CNFRefutation 5.34s
% 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_748,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/sandbox/tmp/enigma-theBenchmark.p-aj1oqpl5/lgb.p',i_0_748) ).
cnf(i_0_244,hypothesis,
val(c818,bmw_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aj1oqpl5/lgb.p',i_0_244) ).
cnf(i_0_245,hypothesis,
sub(c818,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aj1oqpl5/lgb.p',i_0_245) ).
cnf(i_0_246,hypothesis,
sub(c817,firma_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aj1oqpl5/lgb.p',i_0_246) ).
cnf(i_0_247,hypothesis,
attr(c817,c818),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aj1oqpl5/lgb.p',i_0_247) ).
cnf(i_0_727,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aj1oqpl5/lgb.p',i_0_727) ).
cnf(i_0_744,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aj1oqpl5/lgb.p',i_0_744) ).
cnf(i_0_746,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aj1oqpl5/lgb.p',i_0_746) ).
cnf(i_0_745,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aj1oqpl5/lgb.p',i_0_745) ).
cnf(i_0_251,hypothesis,
attr(c436,c437),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aj1oqpl5/lgb.p',i_0_251) ).
cnf(c_0_759,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_748 ).
cnf(c_0_760,hypothesis,
val(c818,bmw_0),
i_0_244 ).
cnf(c_0_761,hypothesis,
sub(c818,name_1_1),
i_0_245 ).
cnf(c_0_762,hypothesis,
( ~ val(X1,bmw_0)
| ~ sub(X1,name_1_1)
| ~ sub(X2,firma_1_1)
| ~ attr(X2,c818)
| ~ attr(X3,X1)
| ~ attr(X4,X5)
| ~ obj(X6,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_759,c_0_760]),c_0_761])]) ).
cnf(c_0_763,hypothesis,
( ~ sub(X1,firma_1_1)
| ~ attr(X1,c818)
| ~ attr(X2,c818)
| ~ attr(X3,X4)
| ~ obj(X5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_762,c_0_760]),c_0_761])]) ).
cnf(c_0_764,hypothesis,
sub(c817,firma_1_1),
i_0_246 ).
cnf(c_0_765,hypothesis,
attr(c817,c818),
i_0_247 ).
cnf(c_0_766,hypothesis,
( ~ attr(X1,c818)
| ~ attr(X2,X3)
| ~ obj(X4,c817) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_763,c_0_764]),c_0_765])]) ).
cnf(c_0_767,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,c817) ),
inference(spm,[status(thm)],[c_0_766,c_0_765]) ).
cnf(c_0_768,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_727 ).
cnf(c_0_769,plain,
( ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,c817)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_767,c_0_768]) ).
cnf(c_0_770,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
i_0_744 ).
cnf(c_0_771,plain,
( ~ arg2(esk59_2(X1,X2),X3)
| ~ arg1(esk59_2(X1,X2),c817)
| ~ sub(X1,X2)
| ~ attr(X4,X5) ),
inference(spm,[status(thm)],[c_0_769,c_0_770]) ).
cnf(c_0_772,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
i_0_746 ).
cnf(c_0_773,plain,
( ~ arg2(esk59_2(c817,X1),X2)
| ~ sub(c817,X1)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_771,c_0_772]) ).
cnf(c_0_774,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
i_0_745 ).
cnf(c_0_775,plain,
( ~ sub(c817,X1)
| ~ attr(X2,X3) ),
inference(spm,[status(thm)],[c_0_773,c_0_774]) ).
cnf(c_0_776,hypothesis,
attr(c436,c437),
i_0_251 ).
cnf(c_0_777,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_775,c_0_764]) ).
cnf(c_0_778,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_776,c_0_777]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : CSR115+22 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 11 00:52:26 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected SinE mode:
% 0.43/0.63 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.63 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.43/0.63 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.43/0.63 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.34/2.90 # ENIGMATIC: Solved by autoschedule-lgb:
% 5.34/2.90 # No SInE strategy applied
% 5.34/2.90 # Trying AutoSched0 for 150 seconds
% 5.34/2.90 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 5.34/2.90 # and selection function SelectComplexExceptUniqMaxHorn.
% 5.34/2.90 #
% 5.34/2.90 # Preprocessing time : 0.029 s
% 5.34/2.90 # Presaturation interreduction done
% 5.34/2.90
% 5.34/2.90 # Proof found!
% 5.34/2.90 # SZS status Theorem
% 5.34/2.90 # SZS output start CNFRefutation
% See solution above
% 5.34/2.90 # Training examples: 0 positive, 0 negative
% 5.34/2.90
% 5.34/2.90 # -------------------------------------------------
% 5.34/2.90 # User time : 0.051 s
% 5.34/2.90 # System time : 0.008 s
% 5.34/2.90 # Total time : 0.059 s
% 5.34/2.90 # Maximum resident set size: 7124 pages
% 5.34/2.90
%------------------------------------------------------------------------------