%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET976+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:38 EDT 2022
% Result : Theorem 8.25s 2.45s
% Output : CNFRefutation 8.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 5 unt; 5 nHn; 23 RR)
% Number of literals : 51 ( 14 equ; 26 neg)
% Maximal clause size : 3 ( 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; 4 con; 0-2 aty)
% Number of variables : 39 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trabvumi/input.p',i_0_6) ).
cnf(i_0_10,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trabvumi/input.p',i_0_10) ).
cnf(i_0_14,negated_conjecture,
( esk5_0 = esk7_0
| in(unordered_pair(unordered_pair(esk4_0,esk5_0),singleton(esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trabvumi/input.p',i_0_14) ).
cnf(i_0_15,negated_conjecture,
( in(esk4_0,esk6_0)
| in(unordered_pair(unordered_pair(esk4_0,esk5_0),singleton(esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trabvumi/input.p',i_0_15) ).
cnf(i_0_16,negated_conjecture,
( esk5_0 != esk7_0
| ~ in(esk4_0,esk6_0)
| ~ in(unordered_pair(unordered_pair(esk4_0,esk5_0),singleton(esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trabvumi/input.p',i_0_16) ).
cnf(i_0_11,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trabvumi/input.p',i_0_11) ).
cnf(i_0_5,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trabvumi/input.p',i_0_5) ).
cnf(i_0_9,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-trabvumi/input.p',i_0_9) ).
cnf(c_0_25,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
i_0_6 ).
cnf(c_0_26,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
i_0_10 ).
cnf(c_0_27,negated_conjecture,
( esk5_0 = esk7_0
| in(unordered_pair(unordered_pair(esk4_0,esk5_0),singleton(esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0))) ),
i_0_14 ).
cnf(c_0_28,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( in(esk4_0,esk6_0)
| in(unordered_pair(unordered_pair(esk4_0,esk5_0),singleton(esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0))) ),
i_0_15 ).
cnf(c_0_30,negated_conjecture,
esk5_0 = esk7_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( esk5_0 != esk7_0
| ~ in(esk4_0,esk6_0)
| ~ in(unordered_pair(unordered_pair(esk4_0,esk5_0),singleton(esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0))) ),
i_0_16 ).
cnf(c_0_32,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
i_0_11 ).
cnf(c_0_33,negated_conjecture,
( in(unordered_pair(unordered_pair(esk4_0,esk7_0),singleton(esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0)))
| in(esk4_0,esk6_0) ),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( ~ in(unordered_pair(unordered_pair(esk4_0,esk7_0),singleton(esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0)))
| ~ in(esk4_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_30]),c_0_30])]) ).
cnf(c_0_35,negated_conjecture,
in(esk4_0,esk6_0),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
i_0_5 ).
cnf(c_0_37,negated_conjecture,
~ in(unordered_pair(unordered_pair(esk4_0,esk7_0),singleton(esk4_0)),cartesian_product2(esk6_0,singleton(esk7_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_38,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
i_0_9 ).
cnf(c_0_39,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_36])]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET976+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n012.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 : Mon Jul 11 09:36:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 8.25/2.45 # ENIGMATIC: Solved by autoschedule:
% 8.25/2.45 # No SInE strategy applied
% 8.25/2.45 # Trying AutoSched0 for 150 seconds
% 8.25/2.45 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 8.25/2.45 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.25/2.45 #
% 8.25/2.45 # Preprocessing time : 0.012 s
% 8.25/2.45 # Presaturation interreduction done
% 8.25/2.45
% 8.25/2.45 # Proof found!
% 8.25/2.45 # SZS status Theorem
% 8.25/2.45 # SZS output start CNFRefutation
% See solution above
% 8.25/2.45 # Training examples: 0 positive, 0 negative
% 8.25/2.45
% 8.25/2.45 # -------------------------------------------------
% 8.25/2.45 # User time : 0.014 s
% 8.25/2.45 # System time : 0.005 s
% 8.25/2.45 # Total time : 0.019 s
% 8.25/2.45 # Maximum resident set size: 7120 pages
% 8.25/2.45
%------------------------------------------------------------------------------