TSTP Solution File: SET071+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET071+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:01 EDT 2022
% Result : Theorem 8.99s 2.62s
% Output : CNFRefutation 8.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of clauses : 35 ( 14 unt; 12 nHn; 23 RR)
% Number of literals : 64 ( 22 equ; 24 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 47 ( 8 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-x5kctwfu/lgb.p',i_0_91) ).
cnf(i_0_63,plain,
( X1 = null_class
| member(esk7_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x5kctwfu/lgb.p',i_0_63) ).
cnf(i_0_74,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x5kctwfu/lgb.p',i_0_74) ).
cnf(i_0_22,plain,
subclass(element_relation,cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x5kctwfu/lgb.p',i_0_22) ).
cnf(i_0_64,plain,
( X1 = null_class
| member(esk7_1(X1),universal_class) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x5kctwfu/lgb.p',i_0_64) ).
cnf(i_0_15,plain,
( member(X1,X2)
| ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X3,X3))),cross_product(X2,X4)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x5kctwfu/lgb.p',i_0_15) ).
cnf(i_0_54,negated_conjecture,
~ member(esk6_0,universal_class),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x5kctwfu/lgb.p',i_0_54) ).
cnf(i_0_23,plain,
( member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),element_relation)
| ~ member(X1,X2)
| ~ member(X2,universal_class) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x5kctwfu/lgb.p',i_0_23) ).
cnf(i_0_88,plain,
member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x5kctwfu/lgb.p',i_0_88) ).
cnf(i_0_55,negated_conjecture,
~ member(esk5_0,universal_class),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x5kctwfu/lgb.p',i_0_55) ).
cnf(i_0_53,negated_conjecture,
unordered_pair(esk5_0,esk6_0) != null_class,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x5kctwfu/lgb.p',i_0_53) ).
cnf(c_0_103,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
i_0_91 ).
cnf(c_0_104,plain,
( X1 = null_class
| member(esk7_1(X1),X1) ),
i_0_63 ).
cnf(c_0_105,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_103,c_0_104]) ).
cnf(c_0_106,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
i_0_74 ).
cnf(c_0_107,plain,
subclass(element_relation,cross_product(universal_class,universal_class)),
i_0_22 ).
cnf(c_0_108,plain,
( X1 = null_class
| member(esk7_1(X1),universal_class) ),
i_0_64 ).
cnf(c_0_109,plain,
( esk7_1(unordered_pair(X1,X1)) = X1
| unordered_pair(X1,X1) = null_class ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_105])]) ).
cnf(c_0_110,plain,
( member(X1,X2)
| ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X3,X3))),cross_product(X2,X4)) ),
i_0_15 ).
cnf(c_0_111,plain,
( member(X1,cross_product(universal_class,universal_class))
| ~ member(X1,element_relation) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_112,negated_conjecture,
~ member(esk6_0,universal_class),
i_0_54 ).
cnf(c_0_113,plain,
( unordered_pair(X1,X1) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_114,plain,
( member(X1,universal_class)
| ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),element_relation) ),
inference(spm,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_115,negated_conjecture,
unordered_pair(esk6_0,esk6_0) = null_class,
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_116,plain,
( member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),element_relation)
| ~ member(X1,X2)
| ~ member(X2,universal_class) ),
i_0_23 ).
cnf(c_0_117,negated_conjecture,
~ member(unordered_pair(null_class,unordered_pair(esk6_0,unordered_pair(X1,X1))),element_relation),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_112]) ).
cnf(c_0_118,plain,
( ~ member(X1,universal_class)
| ~ member(esk6_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_115]),c_0_117]) ).
cnf(c_0_119,plain,
member(unordered_pair(X1,X2),universal_class),
i_0_88 ).
cnf(c_0_120,plain,
~ member(esk6_0,unordered_pair(X1,X2)),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_121,plain,
( esk7_1(unordered_pair(X1,X2)) = X1
| unordered_pair(X1,X2) = null_class
| member(X2,unordered_pair(X1,X2)) ),
inference(spm,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_122,plain,
( esk7_1(unordered_pair(X1,esk6_0)) = X1
| unordered_pair(X1,esk6_0) = null_class ),
inference(spm,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_123,negated_conjecture,
~ member(esk5_0,universal_class),
i_0_55 ).
cnf(c_0_124,plain,
( unordered_pair(X1,esk6_0) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_108,c_0_122]) ).
cnf(c_0_125,negated_conjecture,
unordered_pair(esk5_0,esk6_0) != null_class,
i_0_53 ).
cnf(c_0_126,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_125]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SET071+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.08/0.15 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.37 % Computer : n028.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 600
% 0.14/0.37 % DateTime : Sun Jul 10 09:01:59 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.22/0.46 # ENIGMATIC: Selected SinE mode:
% 0.22/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.99/2.62 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.99/2.62 # No SInE strategy applied
% 8.99/2.62 # Trying AutoSched0 for 150 seconds
% 8.99/2.62 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 8.99/2.62 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.99/2.62 #
% 8.99/2.62 # Preprocessing time : 0.024 s
% 8.99/2.62
% 8.99/2.62 # Proof found!
% 8.99/2.62 # SZS status Theorem
% 8.99/2.62 # SZS output start CNFRefutation
% See solution above
% 8.99/2.62 # Training examples: 0 positive, 0 negative
% 8.99/2.62
% 8.99/2.62 # -------------------------------------------------
% 8.99/2.62 # User time : 0.132 s
% 8.99/2.62 # System time : 0.014 s
% 8.99/2.62 # Total time : 0.147 s
% 8.99/2.62 # Maximum resident set size: 7124 pages
% 8.99/2.62
%------------------------------------------------------------------------------