%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET622+3 : TPTP v8.1.0. Released v2.2.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 00:12:54 EDT 2022
% Result : Theorem 7.70s 2.31s
% Output : CNFRefutation 7.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 4 RR)
% Number of literals : 15 ( 14 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_17,plain,
union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t3p4g_au/input.p',i_0_17) ).
cnf(i_0_2,plain,
union(difference(X1,X2),intersection(X1,X3)) = difference(X1,difference(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t3p4g_au/input.p',i_0_2) ).
cnf(i_0_18,plain,
intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t3p4g_au/input.p',i_0_18) ).
cnf(i_0_1,plain,
intersection(intersection(X1,X2),X3) = intersection(X1,intersection(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t3p4g_au/input.p',i_0_1) ).
cnf(i_0_28,negated_conjecture,
union(difference(esk3_0,union(esk4_0,esk5_0)),intersection(intersection(esk3_0,esk4_0),esk5_0)) != difference(esk3_0,difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t3p4g_au/input.p',i_0_28) ).
cnf(c_0_34,plain,
union(X1,X2) = union(X2,X1),
i_0_17 ).
cnf(c_0_35,plain,
union(difference(X1,X2),intersection(X1,X3)) = difference(X1,difference(X2,X3)),
i_0_2 ).
cnf(c_0_36,plain,
intersection(X1,X2) = intersection(X2,X1),
i_0_18 ).
cnf(c_0_37,plain,
intersection(intersection(X1,X2),X3) = intersection(X1,intersection(X2,X3)),
i_0_1 ).
cnf(c_0_38,negated_conjecture,
union(difference(esk3_0,union(esk4_0,esk5_0)),intersection(intersection(esk3_0,esk4_0),esk5_0)) != difference(esk3_0,difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0))),
i_0_28 ).
cnf(c_0_39,plain,
union(intersection(X1,X2),difference(X1,X3)) = difference(X1,difference(X3,X2)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
intersection(X1,intersection(X2,X3)) = intersection(X3,intersection(X1,X2)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
union(intersection(esk4_0,intersection(esk5_0,esk3_0)),difference(esk3_0,union(esk4_0,esk5_0))) != difference(esk3_0,difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_36]),c_0_37]),c_0_36]),c_0_34]) ).
cnf(c_0_42,plain,
union(intersection(X1,intersection(X2,X3)),difference(X3,X4)) = difference(X3,difference(X4,intersection(X1,X2))),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SET622+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/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 : Sun Jul 10 00:21:02 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.70/2.31 # ENIGMATIC: Solved by autoschedule:
% 7.70/2.31 # No SInE strategy applied
% 7.70/2.31 # Trying AutoSched0 for 150 seconds
% 7.70/2.31 # AutoSched0-Mode selected heuristic G_E___012_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 7.70/2.31 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.70/2.31 #
% 7.70/2.31 # Preprocessing time : 0.012 s
% 7.70/2.31 # Presaturation interreduction done
% 7.70/2.31
% 7.70/2.31 # Proof found!
% 7.70/2.31 # SZS status Theorem
% 7.70/2.31 # SZS output start CNFRefutation
% See solution above
% 7.70/2.31 # Training examples: 0 positive, 0 negative
% 7.70/2.31
% 7.70/2.31 # -------------------------------------------------
% 7.70/2.31 # User time : 0.016 s
% 7.70/2.31 # System time : 0.003 s
% 7.70/2.31 # Total time : 0.019 s
% 7.70/2.31 # Maximum resident set size: 7120 pages
% 7.70/2.31
%------------------------------------------------------------------------------