%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET105+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:09:33 EDT 2022
% Result : Theorem 20.85s 4.09s
% Output : CNFRefutation 20.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of clauses : 55 ( 18 unt; 20 nHn; 30 RR)
% Number of literals : 109 ( 34 equ; 40 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 78 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_91,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1fxm88ct/input.p',i_0_91) ).
cnf(i_0_73,plain,
( subclass(X1,X2)
| member(esk8_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1fxm88ct/input.p',i_0_73) ).
cnf(i_0_72,plain,
( subclass(X1,X2)
| ~ member(esk8_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1fxm88ct/input.p',i_0_72) ).
cnf(i_0_90,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X2
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1fxm88ct/input.p',i_0_90) ).
cnf(i_0_74,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1fxm88ct/input.p',i_0_74) ).
cnf(i_0_4,plain,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1fxm88ct/input.p',i_0_4) ).
cnf(i_0_44,plain,
( member(null_class,X1)
| ~ inductive(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1fxm88ct/input.p',i_0_44) ).
cnf(i_0_46,plain,
inductive(esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1fxm88ct/input.p',i_0_46) ).
cnf(i_0_63,plain,
( X1 = null_class
| member(esk7_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1fxm88ct/input.p',i_0_63) ).
cnf(i_0_64,plain,
( X1 = null_class
| member(esk7_1(X1),universal_class) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1fxm88ct/input.p',i_0_64) ).
cnf(i_0_26,plain,
( X1 = X2
| ~ subclass(X2,X1)
| ~ subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1fxm88ct/input.p',i_0_26) ).
cnf(i_0_58,negated_conjecture,
~ member(esk6_0,universal_class),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1fxm88ct/input.p',i_0_58) ).
cnf(i_0_89,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1fxm88ct/input.p',i_0_89) ).
cnf(i_0_60,negated_conjecture,
unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,unordered_pair(esk6_0,esk6_0))) != unordered_pair(null_class,unordered_pair(null_class,null_class)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1fxm88ct/input.p',i_0_60) ).
cnf(i_0_59,negated_conjecture,
~ member(esk5_0,universal_class),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1fxm88ct/input.p',i_0_59) ).
cnf(c_0_107,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
i_0_91 ).
cnf(c_0_108,plain,
( subclass(X1,X2)
| member(esk8_2(X1,X2),X1) ),
i_0_73 ).
cnf(c_0_109,plain,
( subclass(X1,X2)
| ~ member(esk8_2(X1,X2),X2) ),
i_0_72 ).
cnf(c_0_110,plain,
( esk8_2(unordered_pair(X1,X2),X3) = X1
| esk8_2(unordered_pair(X1,X2),X3) = X2
| subclass(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_111,plain,
( esk8_2(unordered_pair(X1,X2),X3) = X1
| subclass(unordered_pair(X1,X2),X3)
| ~ member(X2,X3) ),
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_112,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X2
| ~ member(X1,universal_class) ),
i_0_90 ).
cnf(c_0_113,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
i_0_74 ).
cnf(c_0_114,plain,
subclass(X1,universal_class),
i_0_4 ).
cnf(c_0_115,plain,
( member(null_class,X1)
| ~ inductive(X1) ),
i_0_44 ).
cnf(c_0_116,plain,
inductive(esk4_0),
i_0_46 ).
cnf(c_0_117,plain,
( X1 = null_class
| member(esk7_1(X1),X1) ),
i_0_63 ).
cnf(c_0_118,plain,
( subclass(unordered_pair(X1,X2),X3)
| member(X1,unordered_pair(X1,X2))
| ~ member(X2,X3) ),
inference(spm,[status(thm)],[c_0_108,c_0_111]) ).
cnf(c_0_119,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[c_0_112]) ).
cnf(c_0_120,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_121,plain,
member(null_class,esk4_0),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_122,plain,
( esk7_1(unordered_pair(X1,X2)) = X1
| esk7_1(unordered_pair(X1,X2)) = X2
| unordered_pair(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_107,c_0_117]) ).
cnf(c_0_123,plain,
( esk8_2(unordered_pair(X1,X1),X2) = X1
| subclass(unordered_pair(X1,X1),X2) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_110])]) ).
cnf(c_0_124,plain,
( subclass(unordered_pair(X1,X2),unordered_pair(X2,X3))
| member(X1,unordered_pair(X1,X2))
| ~ member(X2,universal_class) ),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_125,plain,
member(null_class,universal_class),
inference(spm,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_126,plain,
( X1 = null_class
| member(esk7_1(X1),universal_class) ),
i_0_64 ).
cnf(c_0_127,plain,
( esk7_1(unordered_pair(X1,X1)) = X1
| unordered_pair(X1,X1) = null_class ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_122])]) ).
cnf(c_0_128,plain,
( X1 = X2
| ~ subclass(X2,X1)
| ~ subclass(X1,X2) ),
i_0_26 ).
cnf(c_0_129,plain,
( subclass(unordered_pair(X1,X1),X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_109,c_0_123]) ).
cnf(c_0_130,plain,
( subclass(unordered_pair(X1,null_class),unordered_pair(null_class,X2))
| member(X1,unordered_pair(X1,null_class)) ),
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_131,negated_conjecture,
~ member(esk6_0,universal_class),
i_0_58 ).
cnf(c_0_132,plain,
( unordered_pair(X1,X1) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_133,plain,
( X1 = unordered_pair(X2,X2)
| ~ subclass(X1,unordered_pair(X2,X2))
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_134,plain,
( subclass(unordered_pair(X1,null_class),unordered_pair(null_class,X2))
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_120,c_0_130]) ).
cnf(c_0_135,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3
| ~ member(X1,universal_class) ),
i_0_89 ).
cnf(c_0_136,negated_conjecture,
unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,unordered_pair(esk6_0,esk6_0))) != unordered_pair(null_class,unordered_pair(null_class,null_class)),
i_0_60 ).
cnf(c_0_137,negated_conjecture,
unordered_pair(esk6_0,esk6_0) = null_class,
inference(spm,[status(thm)],[c_0_131,c_0_132]) ).
cnf(c_0_138,negated_conjecture,
~ member(esk5_0,universal_class),
i_0_59 ).
cnf(c_0_139,plain,
( unordered_pair(X1,null_class) = unordered_pair(null_class,null_class)
| member(X1,universal_class)
| ~ member(null_class,unordered_pair(X1,null_class)) ),
inference(spm,[status(thm)],[c_0_133,c_0_134]) ).
cnf(c_0_140,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[c_0_135]) ).
cnf(c_0_141,negated_conjecture,
unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,null_class)) != unordered_pair(null_class,unordered_pair(null_class,null_class)),
inference(rw,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_142,negated_conjecture,
unordered_pair(esk5_0,esk5_0) = null_class,
inference(spm,[status(thm)],[c_0_138,c_0_132]) ).
cnf(c_0_143,plain,
( unordered_pair(X1,null_class) = unordered_pair(null_class,null_class)
| member(X1,universal_class) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_125])]) ).
cnf(c_0_144,negated_conjecture,
unordered_pair(null_class,unordered_pair(esk5_0,null_class)) != unordered_pair(null_class,unordered_pair(null_class,null_class)),
inference(rw,[status(thm)],[c_0_141,c_0_142]) ).
cnf(c_0_145,negated_conjecture,
unordered_pair(esk5_0,null_class) = unordered_pair(null_class,null_class),
inference(spm,[status(thm)],[c_0_138,c_0_143]) ).
cnf(c_0_146,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_144,c_0_145])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET105+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n007.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 : Sat Jul 9 19:01:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 20.85/4.09 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 20.85/4.09 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d45-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 34; version: 991; iters: 150)
% 20.85/4.09 # Preprocessing time : 1.140 s
% 20.85/4.09
% 20.85/4.09 # Proof found!
% 20.85/4.09 # SZS status Theorem
% 20.85/4.09 # SZS output start CNFRefutation
% See solution above
% 20.85/4.09 # Training examples: 0 positive, 0 negative
% 20.85/4.09
% 20.85/4.09 # -------------------------------------------------
% 20.85/4.09 # User time : 1.173 s
% 20.85/4.09 # System time : 0.136 s
% 20.85/4.09 # Total time : 1.309 s
% 20.85/4.09 # ...preprocessing : 1.140 s
% 20.85/4.09 # ...main loop : 0.169 s
% 20.85/4.09 # Maximum resident set size: 175888 pages
% 20.85/4.09
%------------------------------------------------------------------------------