TSTP Solution File: CSR115+71 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+71 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:23 EDT 2022
% Result : Theorem 8.12s 2.73s
% Output : CNFRefutation 8.12s
% 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_664,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-uc2loaie/lgb.p',i_0_664) ).
cnf(i_0_170,hypothesis,
val(c1566,bmw_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc2loaie/lgb.p',i_0_170) ).
cnf(i_0_171,hypothesis,
sub(c1566,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc2loaie/lgb.p',i_0_171) ).
cnf(i_0_172,hypothesis,
sub(c1565,firma_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc2loaie/lgb.p',i_0_172) ).
cnf(i_0_173,hypothesis,
attr(c1565,c1566),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc2loaie/lgb.p',i_0_173) ).
cnf(i_0_643,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-uc2loaie/lgb.p',i_0_643) ).
cnf(i_0_660,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc2loaie/lgb.p',i_0_660) ).
cnf(i_0_662,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc2loaie/lgb.p',i_0_662) ).
cnf(i_0_661,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc2loaie/lgb.p',i_0_661) ).
cnf(c_0_674,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_664 ).
cnf(c_0_675,hypothesis,
val(c1566,bmw_0),
i_0_170 ).
cnf(c_0_676,hypothesis,
sub(c1566,name_1_1),
i_0_171 ).
cnf(c_0_677,hypothesis,
( ~ val(X1,bmw_0)
| ~ sub(X1,name_1_1)
| ~ sub(X2,firma_1_1)
| ~ attr(X2,c1566)
| ~ attr(X3,X1)
| ~ attr(X4,X5)
| ~ obj(X6,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_674,c_0_675]),c_0_676])]) ).
cnf(c_0_678,hypothesis,
( ~ sub(X1,firma_1_1)
| ~ attr(X1,c1566)
| ~ attr(X2,c1566)
| ~ attr(X3,X4)
| ~ obj(X5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_677,c_0_675]),c_0_676])]) ).
cnf(c_0_679,hypothesis,
sub(c1565,firma_1_1),
i_0_172 ).
cnf(c_0_680,hypothesis,
attr(c1565,c1566),
i_0_173 ).
cnf(c_0_681,hypothesis,
( ~ attr(X1,c1566)
| ~ attr(X2,X3)
| ~ obj(X4,c1565) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_678,c_0_679]),c_0_680])]) ).
cnf(c_0_682,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,c1565) ),
inference(spm,[status(thm)],[c_0_681,c_0_680]) ).
cnf(c_0_683,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_643 ).
cnf(c_0_684,plain,
( ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,c1565)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_682,c_0_683]) ).
cnf(c_0_685,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
i_0_660 ).
cnf(c_0_686,plain,
( ~ arg2(esk59_2(X1,X2),X3)
| ~ arg1(esk59_2(X1,X2),c1565)
| ~ sub(X1,X2)
| ~ attr(X4,X5) ),
inference(spm,[status(thm)],[c_0_684,c_0_685]) ).
cnf(c_0_687,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
i_0_662 ).
cnf(c_0_688,plain,
( ~ arg2(esk59_2(c1565,X1),X2)
| ~ sub(c1565,X1)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_686,c_0_687]) ).
cnf(c_0_689,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
i_0_661 ).
cnf(c_0_690,plain,
( ~ sub(c1565,X1)
| ~ attr(X2,X3) ),
inference(spm,[status(thm)],[c_0_688,c_0_689]) ).
cnf(c_0_691,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_690,c_0_679]) ).
cnf(c_0_692,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_680,c_0_691]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR115+71 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n020.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 : Fri Jun 10 13:41:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.40/0.59 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.59 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.40/0.59 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.40/0.59 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.12/2.73 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.12/2.73 # No SInE strategy applied
% 8.12/2.73 # Trying AutoSched0 for 150 seconds
% 8.12/2.73 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.12/2.73 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.12/2.73 #
% 8.12/2.73 # Preprocessing time : 0.019 s
% 8.12/2.73 # Presaturation interreduction done
% 8.12/2.73
% 8.12/2.73 # Proof found!
% 8.12/2.73 # SZS status Theorem
% 8.12/2.73 # SZS output start CNFRefutation
% See solution above
% 8.12/2.73 # Training examples: 0 positive, 0 negative
% 8.12/2.73
% 8.12/2.73 # -------------------------------------------------
% 8.12/2.73 # User time : 0.043 s
% 8.12/2.73 # System time : 0.004 s
% 8.12/2.73 # Total time : 0.047 s
% 8.12/2.73 # Maximum resident set size: 7124 pages
% 8.12/2.73
%------------------------------------------------------------------------------