TSTP Solution File: SET601+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET601+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:12:37 EDT 2022
% Result : Theorem 7.81s 2.31s
% Output : CNFRefutation 7.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 8 RR)
% Number of literals : 34 ( 33 equ; 7 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 59 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
union(X1,intersection(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o3hd58fr/input.p',i_0_4) ).
cnf(i_0_5,plain,
intersection(union(X1,X2),union(X1,X3)) = union(X1,intersection(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o3hd58fr/input.p',i_0_5) ).
cnf(i_0_2,plain,
intersection(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o3hd58fr/input.p',i_0_2) ).
cnf(i_0_25,negated_conjecture,
intersection(intersection(union(esk3_0,esk4_0),union(esk4_0,esk5_0)),union(esk5_0,esk3_0)) != union(union(intersection(esk3_0,esk4_0),intersection(esk4_0,esk5_0)),intersection(esk5_0,esk3_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o3hd58fr/input.p',i_0_25) ).
cnf(i_0_16,plain,
intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o3hd58fr/input.p',i_0_16) ).
cnf(i_0_15,plain,
union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o3hd58fr/input.p',i_0_15) ).
cnf(i_0_3,plain,
intersection(intersection(X1,X2),X3) = intersection(X1,intersection(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o3hd58fr/input.p',i_0_3) ).
cnf(i_0_1,plain,
union(union(X1,X2),X3) = union(X1,union(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o3hd58fr/input.p',i_0_1) ).
cnf(c_0_34,plain,
union(X1,intersection(X1,X2)) = X1,
i_0_4 ).
cnf(c_0_35,plain,
intersection(union(X1,X2),union(X1,X3)) = union(X1,intersection(X2,X3)),
i_0_5 ).
cnf(c_0_36,plain,
intersection(X1,X1) = X1,
i_0_2 ).
cnf(c_0_37,plain,
intersection(union(X1,X1),union(X1,X2)) = X1,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
intersection(intersection(union(esk3_0,esk4_0),union(esk4_0,esk5_0)),union(esk5_0,esk3_0)) != union(union(intersection(esk3_0,esk4_0),intersection(esk4_0,esk5_0)),intersection(esk5_0,esk3_0)),
i_0_25 ).
cnf(c_0_39,plain,
intersection(X1,X2) = intersection(X2,X1),
i_0_16 ).
cnf(c_0_40,plain,
union(X1,X2) = union(X2,X1),
i_0_15 ).
cnf(c_0_41,plain,
intersection(intersection(X1,X2),X3) = intersection(X1,intersection(X2,X3)),
i_0_3 ).
cnf(c_0_42,plain,
union(union(X1,X2),X3) = union(X1,union(X2,X3)),
i_0_1 ).
cnf(c_0_43,plain,
union(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,negated_conjecture,
intersection(union(esk3_0,union(esk3_0,esk4_0)),intersection(union(esk3_0,union(esk4_0,esk4_0)),intersection(union(esk3_0,union(esk3_0,esk5_0)),intersection(union(esk3_0,union(esk4_0,esk5_0)),intersection(union(esk5_0,union(esk3_0,esk4_0)),intersection(union(esk5_0,union(esk4_0,esk4_0)),intersection(union(esk5_0,union(esk3_0,esk5_0)),union(esk5_0,union(esk4_0,esk5_0))))))))) != intersection(union(esk3_0,esk4_0),intersection(union(esk3_0,esk5_0),union(esk4_0,esk5_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_35]),c_0_40]),c_0_35]),c_0_40]),c_0_40]),c_0_35]),c_0_40]),c_0_40]),c_0_41]),c_0_35]),c_0_40]),c_0_35]),c_0_35]),c_0_35]),c_0_40]),c_0_35]),c_0_35]),c_0_35]),c_0_41]),c_0_41]),c_0_41]),c_0_40]),c_0_41]),c_0_39]) ).
cnf(c_0_45,plain,
union(X1,union(X1,X2)) = union(X1,X2),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
intersection(X1,intersection(X1,X2)) = intersection(X1,X2),
inference(spm,[status(thm)],[c_0_41,c_0_36]) ).
cnf(c_0_47,negated_conjecture,
intersection(union(esk3_0,union(esk3_0,esk4_0)),intersection(union(esk3_0,esk4_0),intersection(union(esk3_0,union(esk3_0,esk5_0)),intersection(union(esk3_0,union(esk4_0,esk5_0)),intersection(union(esk5_0,union(esk3_0,esk4_0)),intersection(union(esk4_0,esk5_0),intersection(union(esk5_0,union(esk3_0,esk5_0)),union(esk5_0,union(esk4_0,esk5_0))))))))) != intersection(union(esk3_0,esk4_0),intersection(union(esk3_0,esk5_0),union(esk4_0,esk5_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_43]),c_0_43]),c_0_40]) ).
cnf(c_0_48,plain,
union(X1,union(X2,X1)) = union(X2,X1),
inference(spm,[status(thm)],[c_0_45,c_0_40]) ).
cnf(c_0_49,plain,
intersection(X1,intersection(X2,X1)) = intersection(X2,X1),
inference(spm,[status(thm)],[c_0_46,c_0_39]) ).
cnf(c_0_50,plain,
intersection(X1,union(X1,X2)) = X1,
inference(rw,[status(thm)],[c_0_37,c_0_43]) ).
cnf(c_0_51,negated_conjecture,
intersection(union(esk3_0,esk4_0),intersection(union(esk3_0,esk5_0),intersection(union(esk3_0,union(esk4_0,esk5_0)),intersection(union(esk3_0,esk5_0),intersection(union(esk4_0,esk5_0),union(esk5_0,union(esk3_0,esk4_0))))))) != intersection(union(esk3_0,esk4_0),intersection(union(esk3_0,esk5_0),union(esk4_0,esk5_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_45]),c_0_45]),c_0_46]),c_0_48]),c_0_48]),c_0_49]),c_0_39]),c_0_41]) ).
cnf(c_0_52,plain,
intersection(X1,intersection(X2,intersection(X1,X3))) = intersection(X2,intersection(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_49]),c_0_41]),c_0_41]) ).
cnf(c_0_53,plain,
intersection(X1,union(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_50,c_0_40]) ).
cnf(c_0_54,negated_conjecture,
intersection(union(esk3_0,esk4_0),intersection(union(esk3_0,union(esk4_0,esk5_0)),intersection(union(esk3_0,esk5_0),intersection(union(esk4_0,esk5_0),union(esk5_0,union(esk3_0,esk4_0)))))) != intersection(union(esk3_0,esk4_0),intersection(union(esk3_0,esk5_0),union(esk4_0,esk5_0))),
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,plain,
intersection(X1,intersection(X2,X3)) = intersection(X2,intersection(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_39]),c_0_41]) ).
cnf(c_0_56,plain,
intersection(X1,intersection(union(X2,X1),X3)) = intersection(X1,X3),
inference(spm,[status(thm)],[c_0_41,c_0_53]) ).
cnf(c_0_57,negated_conjecture,
intersection(union(esk3_0,esk4_0),intersection(union(esk3_0,esk5_0),intersection(union(esk4_0,esk5_0),union(esk5_0,union(esk3_0,esk4_0))))) != intersection(union(esk3_0,esk4_0),intersection(union(esk3_0,esk5_0),union(esk4_0,esk5_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_55]),c_0_56]) ).
cnf(c_0_58,plain,
union(X1,union(X2,X3)) = union(X3,union(X1,X2)),
inference(spm,[status(thm)],[c_0_40,c_0_42]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58]),c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET601+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n029.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 22:33:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 7.81/2.31 # ENIGMATIC: Solved by autoschedule:
% 7.81/2.31 # No SInE strategy applied
% 7.81/2.31 # Trying AutoSched0 for 150 seconds
% 7.81/2.31 # AutoSched0-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2k
% 7.81/2.31 # and selection function SelectCQArNTEqFirst.
% 7.81/2.31 #
% 7.81/2.31 # Preprocessing time : 0.023 s
% 7.81/2.31
% 7.81/2.31 # Proof found!
% 7.81/2.31 # SZS status Theorem
% 7.81/2.31 # SZS output start CNFRefutation
% See solution above
% 7.81/2.31 # Training examples: 0 positive, 0 negative
% 7.81/2.31
% 7.81/2.31 # -------------------------------------------------
% 7.81/2.31 # User time : 0.050 s
% 7.81/2.31 # System time : 0.005 s
% 7.81/2.31 # Total time : 0.055 s
% 7.81/2.31 # Maximum resident set size: 7120 pages
% 7.81/2.31
%------------------------------------------------------------------------------