TSTP Solution File: SET635+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET635+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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 00:13:04 EDT 2022
% Result : Theorem 8.03s 2.31s
% Output : CNFRefutation 8.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 23 unt; 0 nHn; 8 RR)
% Number of literals : 27 ( 22 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 42 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_29,negated_conjecture,
difference(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)) != intersection(esk4_0,difference(esk5_0,esk6_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c3vs9r2i/input.p',i_0_29) ).
cnf(i_0_6,plain,
difference(intersection(X1,X2),X3) = intersection(X1,difference(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c3vs9r2i/input.p',i_0_6) ).
cnf(i_0_5,plain,
union(difference(X1,X2),difference(X1,X3)) = difference(X1,intersection(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c3vs9r2i/input.p',i_0_5) ).
cnf(i_0_18,plain,
intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c3vs9r2i/input.p',i_0_18) ).
cnf(i_0_2,plain,
( difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c3vs9r2i/input.p',i_0_2) ).
cnf(i_0_1,plain,
subset(intersection(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c3vs9r2i/input.p',i_0_1) ).
cnf(i_0_4,plain,
union(X1,empty_set) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c3vs9r2i/input.p',i_0_4) ).
cnf(i_0_16,plain,
union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c3vs9r2i/input.p',i_0_16) ).
cnf(c_0_38,negated_conjecture,
difference(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)) != intersection(esk4_0,difference(esk5_0,esk6_0)),
i_0_29 ).
cnf(c_0_39,plain,
difference(intersection(X1,X2),X3) = intersection(X1,difference(X2,X3)),
i_0_6 ).
cnf(c_0_40,negated_conjecture,
intersection(esk4_0,difference(esk5_0,intersection(esk4_0,esk6_0))) != intersection(esk4_0,difference(esk5_0,esk6_0)),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,plain,
union(difference(X1,X2),difference(X1,X3)) = difference(X1,intersection(X2,X3)),
i_0_5 ).
cnf(c_0_42,plain,
intersection(X1,X2) = intersection(X2,X1),
i_0_18 ).
cnf(c_0_43,plain,
( difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
i_0_2 ).
cnf(c_0_44,plain,
subset(intersection(X1,X2),X1),
i_0_1 ).
cnf(c_0_45,negated_conjecture,
intersection(esk4_0,union(difference(esk5_0,esk4_0),difference(esk5_0,esk6_0))) != intersection(esk4_0,difference(esk5_0,esk6_0)),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
intersection(X1,difference(X2,X3)) = intersection(X2,difference(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_42]),c_0_39]) ).
cnf(c_0_47,plain,
difference(intersection(X1,X2),X1) = empty_set,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
union(X1,empty_set) = X1,
i_0_4 ).
cnf(c_0_49,plain,
union(X1,X2) = union(X2,X1),
i_0_16 ).
cnf(c_0_50,negated_conjecture,
intersection(esk4_0,union(difference(esk5_0,esk4_0),difference(esk5_0,esk6_0))) != intersection(esk5_0,difference(esk4_0,esk6_0)),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
intersection(X1,union(difference(X2,X3),difference(X2,X4))) = union(intersection(X1,difference(X2,X3)),intersection(X1,difference(X2,X4))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_41]),c_0_39]),c_0_39]),c_0_41]) ).
cnf(c_0_52,plain,
intersection(X1,difference(X2,X1)) = empty_set,
inference(rw,[status(thm)],[c_0_47,c_0_39]) ).
cnf(c_0_53,plain,
union(empty_set,X1) = X1,
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_46]),c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET635+3 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 13:54:13 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 8.03/2.31 # ENIGMATIC: Solved by autoschedule:
% 8.03/2.31 # No SInE strategy applied
% 8.03/2.31 # Trying AutoSched0 for 150 seconds
% 8.03/2.31 # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I
% 8.03/2.31 # and selection function SelectCQArEqLast.
% 8.03/2.31 #
% 8.03/2.31 # Preprocessing time : 0.023 s
% 8.03/2.31 # Presaturation interreduction done
% 8.03/2.31
% 8.03/2.31 # Proof found!
% 8.03/2.31 # SZS status Theorem
% 8.03/2.31 # SZS output start CNFRefutation
% See solution above
% 8.03/2.31 # Training examples: 0 positive, 0 negative
% 8.03/2.31
% 8.03/2.31 # -------------------------------------------------
% 8.03/2.31 # User time : 0.031 s
% 8.03/2.31 # System time : 0.005 s
% 8.03/2.31 # Total time : 0.036 s
% 8.03/2.31 # Maximum resident set size: 7116 pages
% 8.03/2.31
%------------------------------------------------------------------------------