TSTP Solution File: SET960+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET960+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:32 EDT 2022
% Result : Theorem 7.88s 2.40s
% Output : CNFRefutation 7.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 29 ( 7 unt; 7 nHn; 25 RR)
% Number of literals : 67 ( 35 equ; 38 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 54 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
( in(X1,X2)
| X2 != cartesian_product2(X3,X4)
| X1 != unordered_pair(unordered_pair(X5,X6),singleton(X5))
| ~ in(X6,X4)
| ~ in(X5,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rgtmc5ex/input.p',i_0_9) ).
cnf(i_0_4,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rgtmc5ex/input.p',i_0_4) ).
cnf(i_0_18,negated_conjecture,
( esk9_0 = empty_set
| esk10_0 = empty_set
| cartesian_product2(esk9_0,esk10_0) = empty_set ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rgtmc5ex/input.p',i_0_18) ).
cnf(i_0_11,plain,
( in(esk3_4(X1,X2,X3,X4),X2)
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rgtmc5ex/input.p',i_0_11) ).
cnf(i_0_3,plain,
( X1 = empty_set
| in(esk1_1(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rgtmc5ex/input.p',i_0_3) ).
cnf(i_0_12,plain,
( in(esk2_4(X1,X2,X3,X4),X1)
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rgtmc5ex/input.p',i_0_12) ).
cnf(i_0_19,negated_conjecture,
( esk10_0 != empty_set
| cartesian_product2(esk9_0,esk10_0) != empty_set ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rgtmc5ex/input.p',i_0_19) ).
cnf(i_0_20,negated_conjecture,
( esk9_0 != empty_set
| cartesian_product2(esk9_0,esk10_0) != empty_set ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rgtmc5ex/input.p',i_0_20) ).
cnf(c_0_29,plain,
( in(X1,X2)
| X2 != cartesian_product2(X3,X4)
| X1 != unordered_pair(unordered_pair(X5,X6),singleton(X5))
| ~ in(X6,X4)
| ~ in(X5,X3) ),
i_0_9 ).
cnf(c_0_30,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
i_0_4 ).
cnf(c_0_31,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_29])]) ).
cnf(c_0_32,negated_conjecture,
( esk9_0 = empty_set
| esk10_0 = empty_set
| cartesian_product2(esk9_0,esk10_0) = empty_set ),
i_0_18 ).
cnf(c_0_33,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
( in(esk3_4(X1,X2,X3,X4),X2)
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
i_0_11 ).
cnf(c_0_35,negated_conjecture,
( esk10_0 = empty_set
| esk9_0 = empty_set
| ~ in(X1,esk10_0)
| ~ in(X2,esk9_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_36,plain,
( X1 = empty_set
| in(esk1_1(X1),X1) ),
i_0_3 ).
cnf(c_0_37,plain,
( in(esk3_4(X1,X2,cartesian_product2(X1,X2),X3),X2)
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_38,plain,
( in(esk2_4(X1,X2,X3,X4),X1)
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
i_0_12 ).
cnf(c_0_39,plain,
( esk9_0 = empty_set
| esk10_0 = empty_set
| ~ in(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
~ in(X1,cartesian_product2(X2,empty_set)),
inference(spm,[status(thm)],[c_0_33,c_0_37]) ).
cnf(c_0_41,plain,
( in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X1)
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( esk10_0 != empty_set
| cartesian_product2(esk9_0,esk10_0) != empty_set ),
i_0_19 ).
cnf(c_0_43,plain,
( esk10_0 = empty_set
| esk9_0 = empty_set ),
inference(spm,[status(thm)],[c_0_39,c_0_36]) ).
cnf(c_0_44,plain,
cartesian_product2(X1,empty_set) = empty_set,
inference(spm,[status(thm)],[c_0_40,c_0_36]) ).
cnf(c_0_45,plain,
~ in(X1,cartesian_product2(empty_set,X2)),
inference(spm,[status(thm)],[c_0_33,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( esk9_0 != empty_set
| cartesian_product2(esk9_0,esk10_0) != empty_set ),
i_0_20 ).
cnf(c_0_47,negated_conjecture,
esk9_0 = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_48,plain,
cartesian_product2(empty_set,X1) = empty_set,
inference(spm,[status(thm)],[c_0_45,c_0_36]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET960+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n009.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 07:10:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.88/2.40 # ENIGMATIC: Solved by autoschedule:
% 7.88/2.40 # No SInE strategy applied
% 7.88/2.40 # Trying AutoSched0 for 150 seconds
% 7.88/2.40 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S05AN
% 7.88/2.40 # and selection function PSelectComplexExceptUniqMaxPosHorn.
% 7.88/2.40 #
% 7.88/2.40 # Preprocessing time : 0.023 s
% 7.88/2.40 # Presaturation interreduction done
% 7.88/2.40
% 7.88/2.40 # Proof found!
% 7.88/2.40 # SZS status Theorem
% 7.88/2.40 # SZS output start CNFRefutation
% See solution above
% 7.88/2.40 # Training examples: 0 positive, 0 negative
% 7.88/2.40
% 7.88/2.40 # -------------------------------------------------
% 7.88/2.40 # User time : 0.024 s
% 7.88/2.40 # System time : 0.008 s
% 7.88/2.40 # Total time : 0.032 s
% 7.88/2.40 # Maximum resident set size: 7120 pages
% 7.88/2.40
%------------------------------------------------------------------------------