%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET894+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:04 EDT 2022
% Result : Theorem 8.42s 2.46s
% Output : CNFRefutation 8.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 33 ( 8 unt; 3 nHn; 28 RR)
% Number of literals : 74 ( 36 equ; 39 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-4 aty)
% Number of variables : 80 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ajed695q/input.p',i_0_6) ).
cnf(i_0_14,plain,
( in(esk2_4(X1,X2,X3,X4),X1)
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ajed695q/input.p',i_0_14) ).
cnf(i_0_12,plain,
( unordered_pair(unordered_pair(esk2_4(X1,X2,X3,X4),esk3_4(X1,X2,X3,X4)),singleton(esk2_4(X1,X2,X3,X4))) = X4
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ajed695q/input.p',i_0_12) ).
cnf(i_0_2,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ajed695q/input.p',i_0_2) ).
cnf(i_0_13,plain,
( in(esk3_4(X1,X2,X3,X4),X2)
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ajed695q/input.p',i_0_13) ).
cnf(i_0_24,negated_conjecture,
singleton(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk10_0))) != cartesian_product2(singleton(esk10_0),singleton(esk11_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ajed695q/input.p',i_0_24) ).
cnf(i_0_3,plain,
( X1 = singleton(X2)
| esk1_2(X2,X1) = X2
| in(esk1_2(X2,X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ajed695q/input.p',i_0_3) ).
cnf(i_0_4,plain,
( X1 = singleton(X2)
| esk1_2(X2,X1) != X2
| ~ in(esk1_2(X2,X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ajed695q/input.p',i_0_4) ).
cnf(i_0_5,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ajed695q/input.p',i_0_5) ).
cnf(i_0_17,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ajed695q/input.p',i_0_17) ).
cnf(c_0_35,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
i_0_6 ).
cnf(c_0_36,plain,
( in(esk2_4(X1,X2,X3,X4),X1)
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
i_0_14 ).
cnf(c_0_37,plain,
( unordered_pair(unordered_pair(esk2_4(X1,X2,X3,X4),esk3_4(X1,X2,X3,X4)),singleton(esk2_4(X1,X2,X3,X4))) = X4
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
i_0_12 ).
cnf(c_0_38,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_2 ).
cnf(c_0_39,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
( in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X1)
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_41,plain,
( in(esk3_4(X1,X2,X3,X4),X2)
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
i_0_13 ).
cnf(c_0_42,plain,
( unordered_pair(singleton(esk2_4(X1,X2,cartesian_product2(X1,X2),X3)),unordered_pair(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),esk3_4(X1,X2,cartesian_product2(X1,X2),X3))) = X3
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_37]),c_0_38]) ).
cnf(c_0_43,plain,
( esk2_4(singleton(X1),X2,cartesian_product2(singleton(X1),X2),X3) = X1
| ~ in(X3,cartesian_product2(singleton(X1),X2)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
( in(esk3_4(X1,X2,cartesian_product2(X1,X2),X3),X2)
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_45,plain,
( unordered_pair(singleton(X1),unordered_pair(X1,esk3_4(singleton(X1),X2,cartesian_product2(singleton(X1),X2),X3))) = X3
| ~ in(X3,cartesian_product2(singleton(X1),X2)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
( esk3_4(X1,singleton(X2),cartesian_product2(X1,singleton(X2)),X3) = X2
| ~ in(X3,cartesian_product2(X1,singleton(X2))) ),
inference(spm,[status(thm)],[c_0_39,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
singleton(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk10_0))) != cartesian_product2(singleton(esk10_0),singleton(esk11_0)),
i_0_24 ).
cnf(c_0_48,plain,
( X1 = singleton(X2)
| esk1_2(X2,X1) = X2
| in(esk1_2(X2,X1),X1) ),
i_0_3 ).
cnf(c_0_49,plain,
( unordered_pair(singleton(X1),unordered_pair(X1,X2)) = X3
| ~ in(X3,cartesian_product2(singleton(X1),singleton(X2))) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( esk1_2(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk10_0)),cartesian_product2(singleton(esk10_0),singleton(esk11_0))) = unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk10_0))
| in(esk1_2(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk10_0)),cartesian_product2(singleton(esk10_0),singleton(esk11_0))),cartesian_product2(singleton(esk10_0),singleton(esk11_0))) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48])]) ).
cnf(c_0_51,plain,
( X1 = singleton(X2)
| esk1_2(X2,X1) != X2
| ~ in(esk1_2(X2,X1),X1) ),
i_0_4 ).
cnf(c_0_52,negated_conjecture,
esk1_2(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk10_0)),cartesian_product2(singleton(esk10_0),singleton(esk11_0))) = unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk10_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_38])]) ).
cnf(c_0_53,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
i_0_5 ).
cnf(c_0_54,plain,
~ in(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk10_0)),cartesian_product2(singleton(esk10_0),singleton(esk11_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_47]) ).
cnf(c_0_55,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
i_0_17 ).
cnf(c_0_56,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_53])]) ).
cnf(c_0_57,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET894+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 16:47:42 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.42/2.46 # ENIGMATIC: Solved by autoschedule:
% 8.42/2.46 # No SInE strategy applied
% 8.42/2.46 # Trying AutoSched0 for 150 seconds
% 8.42/2.46 # AutoSched0-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.42/2.46 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.42/2.46 #
% 8.42/2.46 # Preprocessing time : 0.014 s
% 8.42/2.46 # Presaturation interreduction done
% 8.42/2.46
% 8.42/2.46 # Proof found!
% 8.42/2.46 # SZS status Theorem
% 8.42/2.46 # SZS output start CNFRefutation
% See solution above
% 8.42/2.46 # Training examples: 0 positive, 0 negative
% 8.42/2.46
% 8.42/2.46 # -------------------------------------------------
% 8.42/2.46 # User time : 0.132 s
% 8.42/2.46 # System time : 0.007 s
% 8.42/2.46 # Total time : 0.139 s
% 8.42/2.46 # Maximum resident set size: 7124 pages
% 8.42/2.46
%------------------------------------------------------------------------------