%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET901+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:07 EDT 2022
% Result : Theorem 7.28s 2.22s
% Output : CNFRefutation 7.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 32 ( 11 unt; 9 nHn; 18 RR)
% Number of literals : 71 ( 45 equ; 23 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 34 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
( subset(X1,unordered_pair(X2,X3))
| X1 != singleton(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nh82kmw/input.p',i_0_12) ).
cnf(i_0_15,plain,
( X1 = empty_set
| X1 = singleton(X2)
| X1 = singleton(X3)
| X1 = unordered_pair(X3,X2)
| ~ subset(X1,unordered_pair(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nh82kmw/input.p',i_0_15) ).
cnf(i_0_6,negated_conjecture,
( empty_set = esk3_0
| singleton(esk4_0) = esk3_0
| singleton(esk5_0) = esk3_0
| unordered_pair(esk4_0,esk5_0) = esk3_0
| subset(esk3_0,unordered_pair(esk4_0,esk5_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nh82kmw/input.p',i_0_6) ).
cnf(i_0_1,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nh82kmw/input.p',i_0_1) ).
cnf(i_0_8,negated_conjecture,
( singleton(esk5_0) != esk3_0
| ~ subset(esk3_0,unordered_pair(esk4_0,esk5_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nh82kmw/input.p',i_0_8) ).
cnf(i_0_9,negated_conjecture,
( singleton(esk4_0) != esk3_0
| ~ subset(esk3_0,unordered_pair(esk4_0,esk5_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nh82kmw/input.p',i_0_9) ).
cnf(i_0_7,negated_conjecture,
( unordered_pair(esk4_0,esk5_0) != esk3_0
| ~ subset(esk3_0,unordered_pair(esk4_0,esk5_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nh82kmw/input.p',i_0_7) ).
cnf(i_0_2,plain,
subset(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nh82kmw/input.p',i_0_2) ).
cnf(i_0_14,plain,
( subset(X1,unordered_pair(X2,X3))
| X1 != empty_set ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nh82kmw/input.p',i_0_14) ).
cnf(i_0_10,negated_conjecture,
( empty_set != esk3_0
| ~ subset(esk3_0,unordered_pair(esk4_0,esk5_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nh82kmw/input.p',i_0_10) ).
cnf(c_0_26,plain,
( subset(X1,unordered_pair(X2,X3))
| X1 != singleton(X3) ),
i_0_12 ).
cnf(c_0_27,plain,
( X1 = empty_set
| X1 = singleton(X2)
| X1 = singleton(X3)
| X1 = unordered_pair(X3,X2)
| ~ subset(X1,unordered_pair(X3,X2)) ),
i_0_15 ).
cnf(c_0_28,negated_conjecture,
( empty_set = esk3_0
| singleton(esk4_0) = esk3_0
| singleton(esk5_0) = esk3_0
| unordered_pair(esk4_0,esk5_0) = esk3_0
| subset(esk3_0,unordered_pair(esk4_0,esk5_0)) ),
i_0_6 ).
cnf(c_0_29,plain,
subset(singleton(X1),unordered_pair(X2,X1)),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( unordered_pair(esk4_0,esk5_0) = esk3_0
| singleton(esk4_0) = esk3_0
| singleton(esk5_0) = esk3_0
| empty_set = esk3_0 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_1 ).
cnf(c_0_32,negated_conjecture,
( singleton(esk5_0) != esk3_0
| ~ subset(esk3_0,unordered_pair(esk4_0,esk5_0)) ),
i_0_8 ).
cnf(c_0_33,plain,
( unordered_pair(esk4_0,esk5_0) = esk3_0
| singleton(esk4_0) = esk3_0
| empty_set = esk3_0
| subset(esk3_0,unordered_pair(X1,esk5_0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
subset(singleton(X1),unordered_pair(X1,X2)),
inference(spm,[status(thm)],[c_0_29,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( unordered_pair(esk4_0,esk5_0) = esk3_0
| singleton(esk4_0) = esk3_0
| empty_set = esk3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_30]),c_0_33]) ).
cnf(c_0_36,negated_conjecture,
( singleton(esk4_0) != esk3_0
| ~ subset(esk3_0,unordered_pair(esk4_0,esk5_0)) ),
i_0_9 ).
cnf(c_0_37,plain,
( unordered_pair(esk4_0,esk5_0) = esk3_0
| empty_set = esk3_0
| subset(esk3_0,unordered_pair(esk4_0,X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
( unordered_pair(esk4_0,esk5_0) != esk3_0
| ~ subset(esk3_0,unordered_pair(esk4_0,esk5_0)) ),
i_0_7 ).
cnf(c_0_39,negated_conjecture,
( unordered_pair(esk4_0,esk5_0) = esk3_0
| empty_set = esk3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_35]),c_0_37]) ).
cnf(c_0_40,plain,
subset(X1,X1),
i_0_2 ).
cnf(c_0_41,plain,
( subset(X1,unordered_pair(X2,X3))
| X1 != empty_set ),
i_0_14 ).
cnf(c_0_42,negated_conjecture,
( empty_set != esk3_0
| ~ subset(esk3_0,unordered_pair(esk4_0,esk5_0)) ),
i_0_10 ).
cnf(c_0_43,negated_conjecture,
empty_set = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_44,plain,
subset(empty_set,unordered_pair(X1,X2)),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_45,negated_conjecture,
~ subset(esk3_0,unordered_pair(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_46,plain,
subset(esk3_0,unordered_pair(X1,X2)),
inference(rw,[status(thm)],[c_0_44,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET901+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n012.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 13:50:45 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.28/2.22 # ENIGMATIC: Solved by autoschedule:
% 7.28/2.22 # No SInE strategy applied
% 7.28/2.22 # Trying AutoSched0 for 150 seconds
% 7.28/2.22 # AutoSched0-Mode selected heuristic G_____0026_C18_F1_SE_CS_SP_S4S
% 7.28/2.22 # and selection function SelectNewComplexAHPNS.
% 7.28/2.22 #
% 7.28/2.22 # Preprocessing time : 0.022 s
% 7.28/2.22
% 7.28/2.22 # Proof found!
% 7.28/2.22 # SZS status Theorem
% 7.28/2.22 # SZS output start CNFRefutation
% See solution above
% 7.28/2.22 # Training examples: 0 positive, 0 negative
% 7.28/2.22
% 7.28/2.22 # -------------------------------------------------
% 7.28/2.22 # User time : 0.025 s
% 7.28/2.22 # System time : 0.006 s
% 7.28/2.22 # Total time : 0.030 s
% 7.28/2.22 # Maximum resident set size: 7120 pages
% 7.28/2.22
%------------------------------------------------------------------------------