TSTP Solution File: SEU136+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU136+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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 : Tue Jul 19 08:38:43 EDT 2022
% Result : Theorem 28.23s 4.99s
% Output : CNFRefutation 28.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 33 ( 9 unt; 15 nHn; 26 RR)
% Number of literals : 82 ( 21 equ; 38 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 78 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_33,negated_conjecture,
set_difference(set_union2(esk6_0,esk7_0),esk7_0) != set_difference(esk6_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz0oxsb6/lgb.p',i_0_33) ).
cnf(i_0_2,plain,
set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz0oxsb6/lgb.p',i_0_2) ).
cnf(i_0_20,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz0oxsb6/lgb.p',i_0_20) ).
cnf(i_0_16,plain,
( X1 = set_difference(X2,X3)
| in(esk3_3(X2,X3,X1),X1)
| in(esk3_3(X2,X3,X1),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz0oxsb6/lgb.p',i_0_16) ).
cnf(i_0_9,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz0oxsb6/lgb.p',i_0_9) ).
cnf(i_0_11,plain,
( in(X1,X2)
| in(X1,X3)
| X4 != set_union2(X3,X2)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz0oxsb6/lgb.p',i_0_11) ).
cnf(i_0_19,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz0oxsb6/lgb.p',i_0_19) ).
cnf(i_0_18,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz0oxsb6/lgb.p',i_0_18) ).
cnf(i_0_17,plain,
( X1 = set_difference(X2,X3)
| in(esk3_3(X2,X3,X1),X3)
| ~ in(esk3_3(X2,X3,X1),X1)
| ~ in(esk3_3(X2,X3,X1),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz0oxsb6/lgb.p',i_0_17) ).
cnf(i_0_15,plain,
( X1 = set_difference(X2,X3)
| in(esk3_3(X2,X3,X1),X1)
| ~ in(esk3_3(X2,X3,X1),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz0oxsb6/lgb.p',i_0_15) ).
cnf(c_0_44,negated_conjecture,
set_difference(set_union2(esk6_0,esk7_0),esk7_0) != set_difference(esk6_0,esk7_0),
i_0_33 ).
cnf(c_0_45,plain,
set_union2(X1,X2) = set_union2(X2,X1),
i_0_2 ).
cnf(c_0_46,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
i_0_20 ).
cnf(c_0_47,negated_conjecture,
set_difference(set_union2(esk7_0,esk6_0),esk7_0) != set_difference(esk6_0,esk7_0),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
( X1 = set_difference(X2,X3)
| in(esk3_3(X2,X3,X1),X1)
| in(esk3_3(X2,X3,X1),X2) ),
i_0_16 ).
cnf(c_0_49,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X4) ),
i_0_9 ).
cnf(c_0_50,plain,
( in(X1,X2)
| in(X1,X3)
| X4 != set_union2(X3,X2)
| ~ in(X1,X4) ),
i_0_11 ).
cnf(c_0_51,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),set_difference(esk6_0,esk7_0))
| in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),set_union2(esk7_0,esk6_0)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48])]) ).
cnf(c_0_53,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_54,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
i_0_19 ).
cnf(c_0_55,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
i_0_18 ).
cnf(c_0_56,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_57,plain,
in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),set_union2(esk7_0,esk6_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_58,plain,
( X1 = set_difference(X2,X3)
| in(esk3_3(X2,X3,X1),X3)
| ~ in(esk3_3(X2,X3,X1),X1)
| ~ in(esk3_3(X2,X3,X1),X2) ),
i_0_17 ).
cnf(c_0_59,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_54]) ).
cnf(c_0_60,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_55]) ).
cnf(c_0_61,plain,
( in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),esk7_0)
| in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),esk6_0) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,plain,
~ in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),set_difference(esk6_0,esk7_0)),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_57]),c_0_47]),c_0_59]) ).
cnf(c_0_63,plain,
( in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),set_difference(esk6_0,X1))
| in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),esk7_0)
| in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,plain,
( X1 = set_difference(X2,X3)
| in(esk3_3(X2,X3,X1),X1)
| ~ in(esk3_3(X2,X3,X1),X3) ),
i_0_15 ).
cnf(c_0_65,plain,
in(esk3_3(set_union2(esk7_0,esk6_0),esk7_0,set_difference(esk6_0,esk7_0)),esk7_0),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_47]),c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU136+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n010.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 : Mon Jun 20 02:02:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 28.23/4.99 # ENIGMATIC: Solved by autoschedule-lgb:
% 28.23/4.99 # No SInE strategy applied
% 28.23/4.99 # Trying AutoSched0 for 150 seconds
% 28.23/4.99 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S006A
% 28.23/4.99 # and selection function SelectLargestNegLit.
% 28.23/4.99 #
% 28.23/4.99 # Preprocessing time : 0.023 s
% 28.23/4.99 # Presaturation interreduction done
% 28.23/4.99
% 28.23/4.99 # Proof found!
% 28.23/4.99 # SZS status Theorem
% 28.23/4.99 # SZS output start CNFRefutation
% See solution above
% 28.23/4.99 # Training examples: 0 positive, 0 negative
% 28.23/4.99
% 28.23/4.99 # -------------------------------------------------
% 28.23/4.99 # User time : 2.438 s
% 28.23/4.99 # System time : 0.087 s
% 28.23/4.99 # Total time : 2.525 s
% 28.23/4.99 # Maximum resident set size: 7128 pages
% 28.23/4.99
%------------------------------------------------------------------------------