TSTP Solution File: SEU138+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU138+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:45 EDT 2022
% Result : Theorem 7.91s 2.37s
% Output : CNFRefutation 7.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 33 ( 9 unt; 10 nHn; 27 RR)
% Number of literals : 81 ( 20 equ; 41 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 : 79 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p8ce479q/lgb.p',i_0_14) ).
cnf(i_0_18,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p8ce479q/lgb.p',i_0_18) ).
cnf(i_0_31,negated_conjecture,
set_difference(esk6_0,set_difference(esk6_0,esk7_0)) != set_intersection2(esk6_0,esk7_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p8ce479q/lgb.p',i_0_31) ).
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/sandbox2/tmp/enigma-theBenchmark.p-p8ce479q/lgb.p',i_0_16) ).
cnf(i_0_12,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p8ce479q/lgb.p',i_0_12) ).
cnf(i_0_13,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p8ce479q/lgb.p',i_0_13) ).
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/sandbox2/tmp/enigma-theBenchmark.p-p8ce479q/lgb.p',i_0_15) ).
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/sandbox2/tmp/enigma-theBenchmark.p-p8ce479q/lgb.p',i_0_17) ).
cnf(i_0_2,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p8ce479q/lgb.p',i_0_2) ).
cnf(i_0_19,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p8ce479q/lgb.p',i_0_19) ).
cnf(c_0_42,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
i_0_14 ).
cnf(c_0_43,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
i_0_18 ).
cnf(c_0_44,negated_conjecture,
set_difference(esk6_0,set_difference(esk6_0,esk7_0)) != set_intersection2(esk6_0,esk7_0),
i_0_31 ).
cnf(c_0_45,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_46,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_47,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
i_0_12 ).
cnf(c_0_48,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_49,negated_conjecture,
in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),esk6_0),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45])]),c_0_46]) ).
cnf(c_0_50,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
i_0_13 ).
cnf(c_0_51,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_52,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_53,plain,
( in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_difference(esk6_0,X1))
| in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_55,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_56,plain,
( in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_intersection2(X1,esk6_0))
| ~ in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_49]) ).
cnf(c_0_57,plain,
in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),esk7_0),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_44]),c_0_54]) ).
cnf(c_0_58,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_2 ).
cnf(c_0_59,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
i_0_19 ).
cnf(c_0_60,negated_conjecture,
( in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_difference(esk6_0,esk7_0))
| ~ in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_intersection2(esk6_0,esk7_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_49]),c_0_44]) ).
cnf(c_0_61,plain,
in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_intersection2(esk6_0,esk7_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_62,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_59]) ).
cnf(c_0_63,negated_conjecture,
in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_difference(esk6_0,esk7_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]) ).
cnf(c_0_64,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU138+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n014.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 : Sun Jun 19 07:30:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.91/2.37 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.91/2.37 # No SInE strategy applied
% 7.91/2.37 # Trying AutoSched0 for 150 seconds
% 7.91/2.37 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S006A
% 7.91/2.37 # and selection function SelectLargestNegLit.
% 7.91/2.37 #
% 7.91/2.37 # Preprocessing time : 0.020 s
% 7.91/2.37 # Presaturation interreduction done
% 7.91/2.37
% 7.91/2.37 # Proof found!
% 7.91/2.37 # SZS status Theorem
% 7.91/2.37 # SZS output start CNFRefutation
% See solution above
% 7.91/2.37 # Training examples: 0 positive, 0 negative
% 7.91/2.37
% 7.91/2.37 # -------------------------------------------------
% 7.91/2.37 # User time : 0.059 s
% 7.91/2.37 # System time : 0.008 s
% 7.91/2.37 # Total time : 0.068 s
% 7.91/2.37 # Maximum resident set size: 7124 pages
% 7.91/2.37
%------------------------------------------------------------------------------