TSTP Solution File: SET104+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET104+1 : TPTP v8.1.0. Bugfixed v5.4.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:09:32 EDT 2022
% Result : Theorem 18.58s 3.82s
% Output : CNFRefutation 18.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of clauses : 44 ( 11 unt; 21 nHn; 21 RR)
% Number of literals : 96 ( 32 equ; 34 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 77 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_73,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6mjfx006/input.p',i_0_73) ).
cnf(i_0_4,plain,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6mjfx006/input.p',i_0_4) ).
cnf(i_0_90,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6mjfx006/input.p',i_0_90) ).
cnf(i_0_72,plain,
( subclass(X1,X2)
| member(esk8_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6mjfx006/input.p',i_0_72) ).
cnf(i_0_71,plain,
( subclass(X1,X2)
| ~ member(esk8_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6mjfx006/input.p',i_0_71) ).
cnf(i_0_62,plain,
( X1 = null_class
| member(esk7_1(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6mjfx006/input.p',i_0_62) ).
cnf(i_0_26,plain,
( X1 = X2
| ~ subclass(X2,X1)
| ~ subclass(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6mjfx006/input.p',i_0_26) ).
cnf(i_0_88,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6mjfx006/input.p',i_0_88) ).
cnf(i_0_63,plain,
( X1 = null_class
| member(esk7_1(X1),universal_class) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6mjfx006/input.p',i_0_63) ).
cnf(i_0_58,negated_conjecture,
~ member(esk5_0,universal_class),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6mjfx006/input.p',i_0_58) ).
cnf(i_0_59,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(unordered_pair(esk6_0,esk6_0),unordered_pair(esk6_0,esk6_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6mjfx006/input.p',i_0_59) ).
cnf(i_0_87,plain,
member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6mjfx006/input.p',i_0_87) ).
cnf(c_0_103,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
i_0_73 ).
cnf(c_0_104,plain,
subclass(X1,universal_class),
i_0_4 ).
cnf(c_0_105,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
i_0_90 ).
cnf(c_0_106,plain,
( subclass(X1,X2)
| member(esk8_2(X1,X2),X1) ),
i_0_72 ).
cnf(c_0_107,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_108,plain,
( subclass(X1,X2)
| ~ member(esk8_2(X1,X2),X2) ),
i_0_71 ).
cnf(c_0_109,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_105,c_0_106]) ).
cnf(c_0_110,plain,
( subclass(X1,X2)
| member(esk8_2(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_107,c_0_106]) ).
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_108,c_0_109]) ).
cnf(c_0_112,plain,
( X1 = null_class
| member(esk7_1(X1),X1) ),
i_0_62 ).
cnf(c_0_113,plain,
( X1 = X2
| ~ subclass(X2,X1)
| ~ subclass(X1,X2) ),
i_0_26 ).
cnf(c_0_114,plain,
( subclass(unordered_pair(X1,X2),X3)
| member(X1,universal_class)
| ~ member(X2,X3) ),
inference(spm,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_115,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_109])]) ).
cnf(c_0_116,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_105,c_0_112]) ).
cnf(c_0_117,plain,
( X1 = unordered_pair(X2,X3)
| member(X2,universal_class)
| ~ subclass(X1,unordered_pair(X2,X3))
| ~ member(X3,X1) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_118,plain,
( subclass(unordered_pair(X1,X1),X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_108,c_0_115]) ).
cnf(c_0_119,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3
| ~ member(X1,universal_class) ),
i_0_88 ).
cnf(c_0_120,plain,
( X1 = null_class
| member(esk7_1(X1),universal_class) ),
i_0_63 ).
cnf(c_0_121,plain,
( esk7_1(unordered_pair(X1,X1)) = X1
| unordered_pair(X1,X1) = null_class ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_116])]) ).
cnf(c_0_122,plain,
( unordered_pair(X1,X1) = unordered_pair(X2,X3)
| member(X2,universal_class)
| ~ member(X3,unordered_pair(X1,X1))
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(spm,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_123,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[c_0_119]) ).
cnf(c_0_124,negated_conjecture,
~ member(esk5_0,universal_class),
i_0_58 ).
cnf(c_0_125,plain,
( unordered_pair(X1,X1) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_126,plain,
( unordered_pair(X1,X1) = unordered_pair(X2,X1)
| member(X2,universal_class)
| ~ member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_122,c_0_123]) ).
cnf(c_0_127,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(unordered_pair(esk6_0,esk6_0),unordered_pair(esk6_0,esk6_0))),
i_0_59 ).
cnf(c_0_128,negated_conjecture,
unordered_pair(esk5_0,esk5_0) = null_class,
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_129,plain,
( unordered_pair(X1,X1) = unordered_pair(X2,X1)
| member(X2,universal_class)
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_126,c_0_123]) ).
cnf(c_0_130,plain,
member(unordered_pair(X1,X2),universal_class),
i_0_87 ).
cnf(c_0_131,negated_conjecture,
unordered_pair(null_class,unordered_pair(unordered_pair(esk6_0,esk6_0),unordered_pair(esk6_0,esk6_0))) != unordered_pair(null_class,unordered_pair(esk5_0,unordered_pair(esk6_0,esk6_0))),
inference(rw,[status(thm)],[c_0_127,c_0_128]) ).
cnf(c_0_132,plain,
( unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X2)) = unordered_pair(X3,unordered_pair(X1,X2))
| member(X3,universal_class) ),
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_133,negated_conjecture,
( member(X1,universal_class)
| unordered_pair(null_class,unordered_pair(X1,unordered_pair(esk6_0,esk6_0))) != unordered_pair(null_class,unordered_pair(esk5_0,unordered_pair(esk6_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_131,c_0_132]) ).
cnf(c_0_134,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_133]),c_0_124]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET104+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n022.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 16:35:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 18.58/3.82 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 18.58/3.82 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d60-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 33; version: 991; iters: 150)
% 18.58/3.82 # Preprocessing time : 1.180 s
% 18.58/3.82 # Presaturation interreduction done
% 18.58/3.82
% 18.58/3.82 # Proof found!
% 18.58/3.82 # SZS status Theorem
% 18.58/3.82 # SZS output start CNFRefutation
% See solution above
% 18.58/3.82 # Training examples: 0 positive, 0 negative
% 18.58/3.82
% 18.58/3.82 # -------------------------------------------------
% 18.58/3.82 # User time : 1.133 s
% 18.58/3.82 # System time : 0.142 s
% 18.58/3.82 # Total time : 1.275 s
% 18.58/3.82 # ...preprocessing : 1.180 s
% 18.58/3.82 # ...main loop : 0.095 s
% 18.58/3.82 # Maximum resident set size: 188440 pages
% 18.58/3.82
%------------------------------------------------------------------------------