TSTP Solution File: NUN081+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN081+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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 : Mon Jul 18 16:24:57 EDT 2022
% Result : Theorem 7.37s 2.46s
% Output : CNFRefutation 7.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of clauses : 22 ( 10 unt; 0 nHn; 15 RR)
% Number of literals : 48 ( 9 equ; 33 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 45 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( X1 = esk5_0
| ~ r1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9bjzdf8l/lgb.p',i_0_8) ).
cnf(i_0_26,plain,
r1(esk13_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9bjzdf8l/lgb.p',i_0_26) ).
cnf(i_0_40,negated_conjecture,
( X1 != X2
| ~ r1(X3)
| ~ r2(X3,X4)
| ~ r2(X4,X5)
| ~ r2(X5,X2)
| ~ r3(X6,X7,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9bjzdf8l/lgb.p',i_0_40) ).
cnf(i_0_25,plain,
r3(X1,esk13_1(X1),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9bjzdf8l/lgb.p',i_0_25) ).
cnf(i_0_16,plain,
( r2(X1,X2)
| X2 != esk10_1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9bjzdf8l/lgb.p',i_0_16) ).
cnf(i_0_7,plain,
( r1(X1)
| X1 != esk5_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9bjzdf8l/lgb.p',i_0_7) ).
cnf(c_0_47,plain,
( X1 = esk5_0
| ~ r1(X1) ),
i_0_8 ).
cnf(c_0_48,plain,
r1(esk13_1(X1)),
i_0_26 ).
cnf(c_0_49,negated_conjecture,
( X1 != X2
| ~ r1(X3)
| ~ r2(X3,X4)
| ~ r2(X4,X5)
| ~ r2(X5,X2)
| ~ r3(X6,X7,X1) ),
i_0_40 ).
cnf(c_0_50,plain,
r3(X1,esk13_1(X1),X1),
i_0_25 ).
cnf(c_0_51,plain,
esk13_1(X1) = esk5_0,
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
( ~ r3(X1,X2,X3)
| ~ r2(X4,X3)
| ~ r2(X5,X4)
| ~ r2(X6,X5)
| ~ r1(X6) ),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_53,plain,
r3(X1,esk5_0,X1),
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,plain,
( r2(X1,X2)
| X2 != esk10_1(X1) ),
i_0_16 ).
cnf(c_0_55,plain,
( ~ r2(X1,X2)
| ~ r2(X3,X1)
| ~ r2(X4,X3)
| ~ r1(X4) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,plain,
r2(X1,esk10_1(X1)),
inference(er,[status(thm)],[c_0_54]) ).
cnf(c_0_57,plain,
( ~ r2(X1,X2)
| ~ r2(X3,X1)
| ~ r1(X3) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_58,plain,
( r1(X1)
| X1 != esk5_0 ),
i_0_7 ).
cnf(c_0_59,plain,
( ~ r2(X1,X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_56]) ).
cnf(c_0_60,plain,
r1(esk5_0),
inference(er,[status(thm)],[c_0_58]) ).
cnf(c_0_61,plain,
~ r1(X1),
inference(spm,[status(thm)],[c_0_59,c_0_56]) ).
cnf(c_0_62,plain,
$false,
inference(sr,[status(thm)],[c_0_60,c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUN081+2 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 2 09:59:07 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.37/2.46 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.37/2.46 # No SInE strategy applied
% 7.37/2.46 # Trying AutoSched0 for 150 seconds
% 7.37/2.46 # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I
% 7.37/2.46 # and selection function SelectCQArEqLast.
% 7.37/2.46 #
% 7.37/2.46 # Preprocessing time : 0.012 s
% 7.37/2.46 # Presaturation interreduction done
% 7.37/2.46
% 7.37/2.46 # Proof found!
% 7.37/2.46 # SZS status Theorem
% 7.37/2.46 # SZS output start CNFRefutation
% See solution above
% 7.37/2.46 # Training examples: 0 positive, 0 negative
% 7.37/2.46
% 7.37/2.46 # -------------------------------------------------
% 7.37/2.46 # User time : 0.014 s
% 7.37/2.46 # System time : 0.006 s
% 7.37/2.46 # Total time : 0.020 s
% 7.37/2.46 # Maximum resident set size: 7124 pages
% 7.37/2.46
%------------------------------------------------------------------------------