%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET887+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:02 EDT 2022
% Result : Theorem 7.58s 2.31s
% Output : CNFRefutation 7.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 10 unt; 9 nHn; 25 RR)
% Number of literals : 57 ( 46 equ; 23 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 45 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xl0f6xer/lgb.p',i_0_8) ).
cnf(i_0_4,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xl0f6xer/lgb.p',i_0_4) ).
cnf(i_0_16,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-xl0f6xer/lgb.p',i_0_16) ).
cnf(i_0_23,negated_conjecture,
subset(unordered_pair(esk5_0,esk6_0),unordered_pair(esk7_0,esk8_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xl0f6xer/lgb.p',i_0_23) ).
cnf(i_0_24,plain,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xl0f6xer/lgb.p',i_0_24) ).
cnf(i_0_21,negated_conjecture,
esk8_0 != esk5_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xl0f6xer/lgb.p',i_0_21) ).
cnf(i_0_22,negated_conjecture,
esk7_0 != esk5_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xl0f6xer/lgb.p',i_0_22) ).
cnf(i_0_20,plain,
( X1 = X2
| X1 = X3
| unordered_pair(X1,X4) != unordered_pair(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xl0f6xer/lgb.p',i_0_20) ).
cnf(c_0_33,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X4,X3) ),
i_0_8 ).
cnf(c_0_34,plain,
( in(X1,X2)
| X2 != unordered_pair(X3,X1) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_35,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
i_0_4 ).
cnf(c_0_36,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_37,plain,
( X1 = empty_set
| X1 = singleton(X2)
| X1 = singleton(X3)
| X1 = unordered_pair(X3,X2)
| ~ subset(X1,unordered_pair(X3,X2)) ),
i_0_16 ).
cnf(c_0_38,negated_conjecture,
subset(unordered_pair(esk5_0,esk6_0),unordered_pair(esk7_0,esk8_0)),
i_0_23 ).
cnf(c_0_39,plain,
unordered_pair(X1,X2) != empty_set,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
i_0_24 ).
cnf(c_0_41,negated_conjecture,
( unordered_pair(esk7_0,esk8_0) = unordered_pair(esk5_0,esk6_0)
| singleton(esk7_0) = unordered_pair(esk5_0,esk6_0)
| singleton(esk8_0) = unordered_pair(esk5_0,esk6_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_42,plain,
( unordered_pair(esk7_0,esk8_0) = unordered_pair(esk5_0,esk6_0)
| singleton(esk7_0) = unordered_pair(esk5_0,esk6_0)
| esk8_0 = X1
| unordered_pair(esk5_0,esk6_0) != unordered_pair(X1,X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_43,negated_conjecture,
esk8_0 != esk5_0,
i_0_21 ).
cnf(c_0_44,plain,
( unordered_pair(esk7_0,esk8_0) = unordered_pair(esk5_0,esk6_0)
| singleton(esk7_0) = unordered_pair(esk5_0,esk6_0) ),
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_42]),c_0_43]) ).
cnf(c_0_45,plain,
( unordered_pair(esk7_0,esk8_0) = unordered_pair(esk5_0,esk6_0)
| esk7_0 = X1
| unordered_pair(esk5_0,esk6_0) != unordered_pair(X1,X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_44]) ).
cnf(c_0_46,negated_conjecture,
esk7_0 != esk5_0,
i_0_22 ).
cnf(c_0_47,plain,
( X1 = X2
| X1 = X3
| unordered_pair(X1,X4) != unordered_pair(X3,X2) ),
i_0_20 ).
cnf(c_0_48,plain,
unordered_pair(esk7_0,esk8_0) = unordered_pair(esk5_0,esk6_0),
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_45]),c_0_46]) ).
cnf(c_0_49,plain,
( X1 = esk7_0
| X1 = esk8_0
| unordered_pair(X1,X2) != unordered_pair(esk5_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_50,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_49]),c_0_46]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET887+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 : Sun Jul 10 16:46:51 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.58/2.31 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.58/2.31 # No SInE strategy applied
% 7.58/2.31 # Trying AutoSched0 for 150 seconds
% 7.58/2.31 # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 7.58/2.31 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.58/2.31 #
% 7.58/2.31 # Preprocessing time : 0.023 s
% 7.58/2.31
% 7.58/2.31 # Proof found!
% 7.58/2.31 # SZS status Theorem
% 7.58/2.31 # SZS output start CNFRefutation
% See solution above
% 7.58/2.31 # Training examples: 0 positive, 0 negative
% 7.58/2.31
% 7.58/2.31 # -------------------------------------------------
% 7.58/2.31 # User time : 0.023 s
% 7.58/2.31 # System time : 0.006 s
% 7.58/2.31 # Total time : 0.030 s
% 7.58/2.31 # Maximum resident set size: 7128 pages
% 7.58/2.31
%------------------------------------------------------------------------------