TSTP Solution File: CSR115+72 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+72 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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 6.93s 2.53s
% Output : CNFRefutation 6.93s
% 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_729,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-z51k3mcv/lgb.p',i_0_729) ).
cnf(i_0_231,hypothesis,
val(c596,bmw_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z51k3mcv/lgb.p',i_0_231) ).
cnf(i_0_232,hypothesis,
sub(c596,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z51k3mcv/lgb.p',i_0_232) ).
cnf(i_0_233,hypothesis,
sub(c595,firma_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z51k3mcv/lgb.p',i_0_233) ).
cnf(i_0_234,hypothesis,
attr(c595,c596),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z51k3mcv/lgb.p',i_0_234) ).
cnf(i_0_708,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-z51k3mcv/lgb.p',i_0_708) ).
cnf(i_0_725,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z51k3mcv/lgb.p',i_0_725) ).
cnf(i_0_727,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z51k3mcv/lgb.p',i_0_727) ).
cnf(i_0_726,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z51k3mcv/lgb.p',i_0_726) ).
cnf(i_0_243,hypothesis,
attr(c451,c452),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z51k3mcv/lgb.p',i_0_243) ).
cnf(c_0_740,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_729 ).
cnf(c_0_741,hypothesis,
val(c596,bmw_0),
i_0_231 ).
cnf(c_0_742,hypothesis,
sub(c596,name_1_1),
i_0_232 ).
cnf(c_0_743,hypothesis,
( ~ val(X1,bmw_0)
| ~ sub(X1,name_1_1)
| ~ sub(X2,firma_1_1)
| ~ attr(X2,c596)
| ~ attr(X3,X1)
| ~ attr(X4,X5)
| ~ obj(X6,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_740,c_0_741]),c_0_742])]) ).
cnf(c_0_744,hypothesis,
( ~ sub(X1,firma_1_1)
| ~ attr(X1,c596)
| ~ attr(X2,c596)
| ~ attr(X3,X4)
| ~ obj(X5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_743,c_0_741]),c_0_742])]) ).
cnf(c_0_745,hypothesis,
sub(c595,firma_1_1),
i_0_233 ).
cnf(c_0_746,hypothesis,
attr(c595,c596),
i_0_234 ).
cnf(c_0_747,hypothesis,
( ~ attr(X1,c596)
| ~ attr(X2,X3)
| ~ obj(X4,c595) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_744,c_0_745]),c_0_746])]) ).
cnf(c_0_748,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,c595) ),
inference(spm,[status(thm)],[c_0_747,c_0_746]) ).
cnf(c_0_749,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_708 ).
cnf(c_0_750,plain,
( ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,c595)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_748,c_0_749]) ).
cnf(c_0_751,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
i_0_725 ).
cnf(c_0_752,plain,
( ~ arg2(esk59_2(X1,X2),X3)
| ~ arg1(esk59_2(X1,X2),c595)
| ~ sub(X1,X2)
| ~ attr(X4,X5) ),
inference(spm,[status(thm)],[c_0_750,c_0_751]) ).
cnf(c_0_753,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
i_0_727 ).
cnf(c_0_754,plain,
( ~ arg2(esk59_2(c595,X1),X2)
| ~ sub(c595,X1)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_752,c_0_753]) ).
cnf(c_0_755,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
i_0_726 ).
cnf(c_0_756,plain,
( ~ sub(c595,X1)
| ~ attr(X2,X3) ),
inference(spm,[status(thm)],[c_0_754,c_0_755]) ).
cnf(c_0_757,hypothesis,
attr(c451,c452),
i_0_243 ).
cnf(c_0_758,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_756,c_0_745]) ).
cnf(c_0_759,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_757,c_0_758]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR115+72 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n029.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 : Thu Jun 9 22:29:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.43/0.60 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.60 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.43/0.60 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.43/0.60 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.93/2.53 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.93/2.53 # No SInE strategy applied
% 6.93/2.53 # Trying AutoSched0 for 150 seconds
% 6.93/2.53 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.93/2.53 # and selection function SelectComplexExceptUniqMaxHorn.
% 6.93/2.53 #
% 6.93/2.53 # Preprocessing time : 0.016 s
% 6.93/2.53 # Presaturation interreduction done
% 6.93/2.53
% 6.93/2.53 # Proof found!
% 6.93/2.53 # SZS status Theorem
% 6.93/2.53 # SZS output start CNFRefutation
% See solution above
% 6.93/2.53 # Training examples: 0 positive, 0 negative
% 6.93/2.53
% 6.93/2.53 # -------------------------------------------------
% 6.93/2.53 # User time : 0.028 s
% 6.93/2.53 # System time : 0.008 s
% 6.93/2.53 # Total time : 0.036 s
% 6.93/2.53 # Maximum resident set size: 7128 pages
% 6.93/2.53
%------------------------------------------------------------------------------