TSTP Solution File: SET919+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET919+1 : TPTP v8.1.0. Released v3.2.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 00:15:15 EDT 2022
% Result : Theorem 8.50s 2.42s
% Output : CNFRefutation 8.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of clauses : 41 ( 16 unt; 13 nHn; 33 RR)
% Number of literals : 85 ( 44 equ; 31 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 : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 58 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_23,negated_conjecture,
set_intersection2(unordered_pair(esk6_0,esk8_0),esk7_0) != singleton(esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i9x0sn6h/input.p',i_0_23) ).
cnf(i_0_3,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i9x0sn6h/input.p',i_0_3) ).
cnf(i_0_7,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i9x0sn6h/input.p',i_0_7) ).
cnf(i_0_14,plain,
( X1 = set_intersection2(X2,X3)
| in(esk3_3(X2,X3,X1),X1)
| in(esk3_3(X2,X3,X1),X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i9x0sn6h/input.p',i_0_14) ).
cnf(i_0_15,plain,
( X1 = set_intersection2(X2,X3)
| in(esk3_3(X2,X3,X1),X1)
| in(esk3_3(X2,X3,X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i9x0sn6h/input.p',i_0_15) ).
cnf(i_0_12,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i9x0sn6h/input.p',i_0_12) ).
cnf(i_0_6,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i9x0sn6h/input.p',i_0_6) ).
cnf(i_0_13,plain,
( X1 = X2
| X1 = X3
| X4 != unordered_pair(X3,X2)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i9x0sn6h/input.p',i_0_13) ).
cnf(i_0_16,plain,
( X1 = set_intersection2(X2,X3)
| ~ in(esk3_3(X2,X3,X1),X1)
| ~ in(esk3_3(X2,X3,X1),X3)
| ~ in(esk3_3(X2,X3,X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i9x0sn6h/input.p',i_0_16) ).
cnf(i_0_25,negated_conjecture,
in(esk6_0,esk7_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i9x0sn6h/input.p',i_0_25) ).
cnf(i_0_24,negated_conjecture,
( esk8_0 = esk6_0
| ~ in(esk8_0,esk7_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i9x0sn6h/input.p',i_0_24) ).
cnf(c_0_37,negated_conjecture,
set_intersection2(unordered_pair(esk6_0,esk8_0),esk7_0) != singleton(esk6_0),
i_0_23 ).
cnf(c_0_38,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_3 ).
cnf(c_0_39,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
i_0_7 ).
cnf(c_0_40,negated_conjecture,
set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0)) != singleton(esk6_0),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( X1 = set_intersection2(X2,X3)
| in(esk3_3(X2,X3,X1),X1)
| in(esk3_3(X2,X3,X1),X3) ),
i_0_14 ).
cnf(c_0_42,plain,
( X1 = set_intersection2(X2,X3)
| in(esk3_3(X2,X3,X1),X1)
| in(esk3_3(X2,X3,X1),X2) ),
i_0_15 ).
cnf(c_0_43,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( in(esk3_3(esk7_0,unordered_pair(esk6_0,esk8_0),singleton(esk6_0)),unordered_pair(esk6_0,esk8_0))
| in(esk3_3(esk7_0,unordered_pair(esk6_0,esk8_0),singleton(esk6_0)),singleton(esk6_0)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_45,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X3,X4) ),
i_0_12 ).
cnf(c_0_46,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
i_0_6 ).
cnf(c_0_47,negated_conjecture,
( in(esk3_3(esk7_0,unordered_pair(esk6_0,esk8_0),singleton(esk6_0)),singleton(esk6_0))
| in(esk3_3(esk7_0,unordered_pair(esk6_0,esk8_0),singleton(esk6_0)),esk7_0) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_42])]) ).
cnf(c_0_48,plain,
( X1 = X2
| X1 = X3
| X4 != unordered_pair(X3,X2)
| ~ in(X1,X4) ),
i_0_13 ).
cnf(c_0_49,plain,
( X1 = set_intersection2(X2,X3)
| ~ in(esk3_3(X2,X3,X1),X1)
| ~ in(esk3_3(X2,X3,X1),X3)
| ~ in(esk3_3(X2,X3,X1),X2) ),
i_0_16 ).
cnf(c_0_50,plain,
( esk3_3(esk7_0,unordered_pair(esk6_0,esk8_0),singleton(esk6_0)) = esk6_0
| in(esk3_3(esk7_0,unordered_pair(esk6_0,esk8_0),singleton(esk6_0)),unordered_pair(esk6_0,esk8_0)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_45])]) ).
cnf(c_0_52,negated_conjecture,
in(esk6_0,esk7_0),
i_0_25 ).
cnf(c_0_53,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_46])]) ).
cnf(c_0_54,plain,
( esk3_3(esk7_0,unordered_pair(esk6_0,esk8_0),singleton(esk6_0)) = esk6_0
| in(esk3_3(esk7_0,unordered_pair(esk6_0,esk8_0),singleton(esk6_0)),esk7_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_47]) ).
cnf(c_0_55,plain,
( X1 = X2
| X1 = X3
| ~ in(X1,unordered_pair(X2,X3)) ),
inference(er,[status(thm)],[c_0_48]) ).
cnf(c_0_56,plain,
in(esk3_3(esk7_0,unordered_pair(esk6_0,esk8_0),singleton(esk6_0)),unordered_pair(esk6_0,esk8_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52]),c_0_53])]),c_0_40]) ).
cnf(c_0_57,plain,
in(esk3_3(esk7_0,unordered_pair(esk6_0,esk8_0),singleton(esk6_0)),esk7_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_54]),c_0_51]),c_0_52]),c_0_53])]),c_0_40]) ).
cnf(c_0_58,plain,
( esk3_3(esk7_0,unordered_pair(esk6_0,esk8_0),singleton(esk6_0)) = esk6_0
| esk3_3(esk7_0,unordered_pair(esk6_0,esk8_0),singleton(esk6_0)) = esk8_0 ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,plain,
( esk3_3(esk7_0,unordered_pair(esk6_0,esk8_0),singleton(esk6_0)) = esk6_0
| in(esk8_0,esk7_0) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_60,negated_conjecture,
( esk8_0 = esk6_0
| ~ in(esk8_0,esk7_0) ),
i_0_24 ).
cnf(c_0_61,plain,
in(esk8_0,esk7_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_59]),c_0_51]),c_0_52]),c_0_53])]),c_0_40]) ).
cnf(c_0_62,plain,
( esk3_3(esk7_0,unordered_pair(esk6_0,esk8_0),singleton(esk6_0)) = esk6_0
| esk8_0 != esk6_0 ),
inference(ef,[status(thm)],[c_0_58]) ).
cnf(c_0_63,negated_conjecture,
esk8_0 = esk6_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]) ).
cnf(c_0_64,plain,
esk3_3(esk7_0,unordered_pair(esk6_0,esk6_0),singleton(esk6_0)) = esk6_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63]),c_0_63])]) ).
cnf(c_0_65,negated_conjecture,
set_intersection2(esk7_0,unordered_pair(esk6_0,esk6_0)) != singleton(esk6_0),
inference(rw,[status(thm)],[c_0_40,c_0_63]) ).
cnf(c_0_66,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_64]),c_0_51]),c_0_52]),c_0_53])]),c_0_65]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET919+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n014.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 : Sat Jul 9 18:45:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.50/2.42 # ENIGMATIC: Solved by autoschedule:
% 8.50/2.42 # No SInE strategy applied
% 8.50/2.42 # Trying AutoSched0 for 150 seconds
% 8.50/2.42 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S002A
% 8.50/2.42 # and selection function SelectNegativeLiterals.
% 8.50/2.42 #
% 8.50/2.42 # Preprocessing time : 0.022 s
% 8.50/2.42 # Presaturation interreduction done
% 8.50/2.42
% 8.50/2.42 # Proof found!
% 8.50/2.42 # SZS status Theorem
% 8.50/2.42 # SZS output start CNFRefutation
% See solution above
% 8.50/2.42 # Training examples: 0 positive, 0 negative
% 8.50/2.42
% 8.50/2.42 # -------------------------------------------------
% 8.50/2.42 # User time : 0.029 s
% 8.50/2.42 # System time : 0.009 s
% 8.50/2.42 # Total time : 0.038 s
% 8.50/2.42 # Maximum resident set size: 7120 pages
% 8.50/2.42
%------------------------------------------------------------------------------