TSTP Solution File: SET598+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET598+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:35 EDT 2022
% Result : Theorem 7.43s 2.32s
% Output : CNFRefutation 7.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 35 ( 12 unt; 8 nHn; 30 RR)
% Number of literals : 80 ( 23 equ; 41 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_18,negated_conjecture,
( intersection(esk4_0,esk5_0) = esk3_0
| subset(X1,esk3_0)
| ~ subset(X1,esk4_0)
| ~ subset(X1,esk5_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_ajlpfq0/input.p',i_0_18) ).
cnf(i_0_1,plain,
subset(intersection(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_ajlpfq0/input.p',i_0_1) ).
cnf(i_0_12,plain,
intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_ajlpfq0/input.p',i_0_12) ).
cnf(i_0_9,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_ajlpfq0/input.p',i_0_9) ).
cnf(i_0_19,negated_conjecture,
( intersection(esk4_0,esk5_0) = esk3_0
| subset(esk3_0,esk5_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_ajlpfq0/input.p',i_0_19) ).
cnf(i_0_20,negated_conjecture,
( intersection(esk4_0,esk5_0) = esk3_0
| subset(esk3_0,esk4_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_ajlpfq0/input.p',i_0_20) ).
cnf(i_0_2,plain,
( subset(X1,intersection(X2,X3))
| ~ subset(X1,X3)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_ajlpfq0/input.p',i_0_2) ).
cnf(i_0_22,negated_conjecture,
( subset(esk6_0,esk5_0)
| intersection(esk4_0,esk5_0) != esk3_0
| ~ subset(esk3_0,esk4_0)
| ~ subset(esk3_0,esk5_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_ajlpfq0/input.p',i_0_22) ).
cnf(i_0_23,negated_conjecture,
( subset(esk6_0,esk4_0)
| intersection(esk4_0,esk5_0) != esk3_0
| ~ subset(esk3_0,esk4_0)
| ~ subset(esk3_0,esk5_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_ajlpfq0/input.p',i_0_23) ).
cnf(i_0_21,negated_conjecture,
( intersection(esk4_0,esk5_0) != esk3_0
| ~ subset(esk3_0,esk4_0)
| ~ subset(esk3_0,esk5_0)
| ~ subset(esk6_0,esk3_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_ajlpfq0/input.p',i_0_21) ).
cnf(c_0_34,negated_conjecture,
( intersection(esk4_0,esk5_0) = esk3_0
| subset(X1,esk3_0)
| ~ subset(X1,esk4_0)
| ~ subset(X1,esk5_0) ),
i_0_18 ).
cnf(c_0_35,plain,
subset(intersection(X1,X2),X1),
i_0_1 ).
cnf(c_0_36,plain,
intersection(X1,X2) = intersection(X2,X1),
i_0_12 ).
cnf(c_0_37,plain,
( intersection(esk4_0,esk5_0) = esk3_0
| subset(intersection(esk4_0,X1),esk3_0)
| ~ subset(intersection(esk4_0,X1),esk5_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
subset(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_9 ).
cnf(c_0_40,plain,
( intersection(esk4_0,esk5_0) = esk3_0
| subset(intersection(esk4_0,esk5_0),esk3_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
( intersection(esk4_0,esk5_0) = esk3_0
| subset(esk3_0,esk5_0) ),
i_0_19 ).
cnf(c_0_42,negated_conjecture,
( intersection(esk4_0,esk5_0) = esk3_0
| subset(esk3_0,esk4_0) ),
i_0_20 ).
cnf(c_0_43,plain,
( intersection(esk4_0,esk5_0) = esk3_0
| ~ subset(esk3_0,intersection(esk4_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
( subset(X1,intersection(X2,X3))
| ~ subset(X1,X3)
| ~ subset(X1,X2) ),
i_0_2 ).
cnf(c_0_45,plain,
subset(esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_38,c_0_41]) ).
cnf(c_0_46,plain,
subset(esk3_0,esk4_0),
inference(spm,[status(thm)],[c_0_35,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
( subset(esk6_0,esk5_0)
| intersection(esk4_0,esk5_0) != esk3_0
| ~ subset(esk3_0,esk4_0)
| ~ subset(esk3_0,esk5_0) ),
i_0_22 ).
cnf(c_0_48,negated_conjecture,
( subset(esk6_0,esk4_0)
| intersection(esk4_0,esk5_0) != esk3_0
| ~ subset(esk3_0,esk4_0)
| ~ subset(esk3_0,esk5_0) ),
i_0_23 ).
cnf(c_0_49,negated_conjecture,
( intersection(esk4_0,esk5_0) != esk3_0
| ~ subset(esk3_0,esk4_0)
| ~ subset(esk3_0,esk5_0)
| ~ subset(esk6_0,esk3_0) ),
i_0_21 ).
cnf(c_0_50,plain,
intersection(esk4_0,esk5_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46])]) ).
cnf(c_0_51,negated_conjecture,
( subset(esk6_0,esk5_0)
| intersection(esk4_0,esk5_0) != esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_46]),c_0_45])]) ).
cnf(c_0_52,negated_conjecture,
( subset(esk6_0,esk4_0)
| intersection(esk4_0,esk5_0) != esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_46]),c_0_45])]) ).
cnf(c_0_53,negated_conjecture,
( intersection(esk4_0,esk5_0) != esk3_0
| ~ subset(esk6_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_46]),c_0_45])]) ).
cnf(c_0_54,plain,
( subset(X1,esk3_0)
| ~ subset(X1,esk5_0)
| ~ subset(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_50]) ).
cnf(c_0_55,negated_conjecture,
subset(esk6_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_50])]) ).
cnf(c_0_56,negated_conjecture,
subset(esk6_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_50])]) ).
cnf(c_0_57,negated_conjecture,
~ subset(esk6_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_50])]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET598+3 : TPTP v8.1.0. Released v2.2.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 08:53:03 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.43 # ENIGMATIC: Selected complete mode:
% 7.43/2.32 # ENIGMATIC: Solved by autoschedule:
% 7.43/2.32 # No SInE strategy applied
% 7.43/2.32 # Trying AutoSched0 for 150 seconds
% 7.43/2.32 # AutoSched0-Mode selected heuristic G_____X1276__C12_02_nc_F1_AE_CS_SP_RG_S04AN
% 7.43/2.32 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.43/2.32 #
% 7.43/2.32 # Preprocessing time : 0.012 s
% 7.43/2.32 # Presaturation interreduction done
% 7.43/2.32
% 7.43/2.32 # Proof found!
% 7.43/2.32 # SZS status Theorem
% 7.43/2.32 # SZS output start CNFRefutation
% See solution above
% 7.43/2.32 # Training examples: 0 positive, 0 negative
% 7.43/2.32
% 7.43/2.32 # -------------------------------------------------
% 7.43/2.32 # User time : 0.014 s
% 7.43/2.32 # System time : 0.004 s
% 7.43/2.32 # Total time : 0.017 s
% 7.43/2.32 # Maximum resident set size: 7116 pages
% 7.43/2.32
%------------------------------------------------------------------------------