TSTP Solution File: CSR115+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:19 EDT 2022
% Result : Theorem 6.95s 2.67s
% Output : CNFRefutation 6.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 6 unt; 0 nHn; 17 RR)
% Number of literals : 34 ( 0 equ; 23 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 34 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_558,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-5bxvp48u/lgb.p',i_0_558) ).
cnf(i_0_579,negated_conjecture,
~ obj(X1,X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5bxvp48u/lgb.p',i_0_579) ).
cnf(i_0_575,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5bxvp48u/lgb.p',i_0_575) ).
cnf(i_0_576,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5bxvp48u/lgb.p',i_0_576) ).
cnf(i_0_577,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5bxvp48u/lgb.p',i_0_577) ).
cnf(i_0_98,hypothesis,
sub(c2383,mark_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5bxvp48u/lgb.p',i_0_98) ).
cnf(c_0_586,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_558 ).
cnf(c_0_587,negated_conjecture,
~ obj(X1,X2),
i_0_579 ).
cnf(c_0_588,plain,
( ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,X3) ),
inference(sr,[status(thm)],[c_0_586,c_0_587]) ).
cnf(c_0_589,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
i_0_575 ).
cnf(c_0_590,plain,
( ~ arg2(esk59_2(X1,X2),X3)
| ~ sub(X1,X2)
| ~ arg1(esk59_2(X1,X2),X4) ),
inference(spm,[status(thm)],[c_0_588,c_0_589]) ).
cnf(c_0_591,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
i_0_576 ).
cnf(c_0_592,plain,
( ~ sub(X1,X2)
| ~ arg1(esk59_2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_590,c_0_591]) ).
cnf(c_0_593,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
i_0_577 ).
cnf(c_0_594,hypothesis,
sub(c2383,mark_1_1),
i_0_98 ).
cnf(c_0_595,plain,
~ sub(X1,X2),
inference(spm,[status(thm)],[c_0_592,c_0_593]) ).
cnf(c_0_596,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_594,c_0_595]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR115+4 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 11 12:40:00 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.42/0.61 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.42/0.61 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.42/0.61 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.42/0.61 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.95/2.67 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.95/2.67 # No SInE strategy applied
% 6.95/2.67 # Trying AutoSched0 for 150 seconds
% 6.95/2.67 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.95/2.67 # and selection function SelectComplexExceptUniqMaxHorn.
% 6.95/2.67 #
% 6.95/2.67 # Preprocessing time : 0.028 s
% 6.95/2.67 # Presaturation interreduction done
% 6.95/2.67
% 6.95/2.67 # Proof found!
% 6.95/2.67 # SZS status Theorem
% 6.95/2.67 # SZS output start CNFRefutation
% See solution above
% 6.95/2.67 # Training examples: 0 positive, 0 negative
% 6.95/2.67
% 6.95/2.67 # -------------------------------------------------
% 6.95/2.67 # User time : 0.046 s
% 6.95/2.67 # System time : 0.006 s
% 6.95/2.67 # Total time : 0.052 s
% 6.95/2.67 # Maximum resident set size: 7124 pages
% 6.95/2.67
%------------------------------------------------------------------------------