TSTP Solution File: CSR115+74 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+74 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:24 EDT 2022
% Result : Theorem 6.90s 2.67s
% Output : CNFRefutation 6.90s
% 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_643,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-8ztc3gvc/lgb.p',i_0_643) ).
cnf(i_0_155,hypothesis,
val(c79,bmw_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8ztc3gvc/lgb.p',i_0_155) ).
cnf(i_0_156,hypothesis,
sub(c79,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8ztc3gvc/lgb.p',i_0_156) ).
cnf(i_0_157,hypothesis,
sub(c78,firma_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8ztc3gvc/lgb.p',i_0_157) ).
cnf(i_0_158,hypothesis,
attr(c78,c79),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8ztc3gvc/lgb.p',i_0_158) ).
cnf(i_0_622,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-8ztc3gvc/lgb.p',i_0_622) ).
cnf(i_0_639,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8ztc3gvc/lgb.p',i_0_639) ).
cnf(i_0_641,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8ztc3gvc/lgb.p',i_0_641) ).
cnf(i_0_640,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8ztc3gvc/lgb.p',i_0_640) ).
cnf(c_0_653,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_643 ).
cnf(c_0_654,hypothesis,
val(c79,bmw_0),
i_0_155 ).
cnf(c_0_655,hypothesis,
sub(c79,name_1_1),
i_0_156 ).
cnf(c_0_656,hypothesis,
( ~ val(X1,bmw_0)
| ~ sub(X1,name_1_1)
| ~ sub(X2,firma_1_1)
| ~ attr(X2,c79)
| ~ attr(X3,X1)
| ~ attr(X4,X5)
| ~ obj(X6,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_653,c_0_654]),c_0_655])]) ).
cnf(c_0_657,hypothesis,
( ~ sub(X1,firma_1_1)
| ~ attr(X1,c79)
| ~ attr(X2,c79)
| ~ attr(X3,X4)
| ~ obj(X5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_656,c_0_654]),c_0_655])]) ).
cnf(c_0_658,hypothesis,
sub(c78,firma_1_1),
i_0_157 ).
cnf(c_0_659,hypothesis,
attr(c78,c79),
i_0_158 ).
cnf(c_0_660,hypothesis,
( ~ attr(X1,c79)
| ~ attr(X2,X3)
| ~ obj(X4,c78) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_657,c_0_658]),c_0_659])]) ).
cnf(c_0_661,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,c78) ),
inference(spm,[status(thm)],[c_0_660,c_0_659]) ).
cnf(c_0_662,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_622 ).
cnf(c_0_663,plain,
( ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,c78)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_661,c_0_662]) ).
cnf(c_0_664,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
i_0_639 ).
cnf(c_0_665,plain,
( ~ arg2(esk59_2(X1,X2),X3)
| ~ arg1(esk59_2(X1,X2),c78)
| ~ sub(X1,X2)
| ~ attr(X4,X5) ),
inference(spm,[status(thm)],[c_0_663,c_0_664]) ).
cnf(c_0_666,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
i_0_641 ).
cnf(c_0_667,plain,
( ~ arg2(esk59_2(c78,X1),X2)
| ~ sub(c78,X1)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_665,c_0_666]) ).
cnf(c_0_668,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
i_0_640 ).
cnf(c_0_669,plain,
( ~ sub(c78,X1)
| ~ attr(X2,X3) ),
inference(spm,[status(thm)],[c_0_667,c_0_668]) ).
cnf(c_0_670,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_669,c_0_658]) ).
cnf(c_0_671,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_659,c_0_670]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : CSR115+74 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.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.18/0.33 % WCLimit : 600
% 0.18/0.33 % DateTime : Sat Jun 11 18:33:12 EDT 2022
% 0.18/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.41/0.59 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.59 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.41/0.59 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.41/0.59 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.90/2.67 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.90/2.67 # No SInE strategy applied
% 6.90/2.67 # Trying AutoSched0 for 150 seconds
% 6.90/2.67 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.90/2.67 # and selection function SelectComplexExceptUniqMaxHorn.
% 6.90/2.67 #
% 6.90/2.67 # Preprocessing time : 0.028 s
% 6.90/2.67 # Presaturation interreduction done
% 6.90/2.67
% 6.90/2.67 # Proof found!
% 6.90/2.67 # SZS status Theorem
% 6.90/2.67 # SZS output start CNFRefutation
% See solution above
% 6.90/2.67 # Training examples: 0 positive, 0 negative
% 6.90/2.67
% 6.90/2.67 # -------------------------------------------------
% 6.90/2.67 # User time : 0.045 s
% 6.90/2.67 # System time : 0.009 s
% 6.90/2.67 # Total time : 0.054 s
% 6.90/2.67 # Maximum resident set size: 7124 pages
% 6.90/2.67
%------------------------------------------------------------------------------