TSTP Solution File: NUM409+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM409+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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 : Mon Jul 18 08:35:44 EDT 2022
% Result : Theorem 7.58s 2.32s
% Output : CNFRefutation 7.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of clauses : 45 ( 21 unt; 3 nHn; 36 RR)
% Number of literals : 96 ( 14 equ; 56 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 56 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_97,plain,
( ~ empty(X1)
| ~ in(X2,X3)
| ~ element(X3,powerset(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a491f49t/lgb.p',i_0_97) ).
cnf(i_0_93,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a491f49t/lgb.p',i_0_93) ).
cnf(i_0_92,plain,
subset(empty_set,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a491f49t/lgb.p',i_0_92) ).
cnf(i_0_17,plain,
( in(unordered_pair(unordered_pair(X1,esk1_3(X2,X3,X1)),singleton(X1)),X2)
| X3 != relation_dom(X2)
| ~ relation(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a491f49t/lgb.p',i_0_17) ).
cnf(i_0_13,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a491f49t/lgb.p',i_0_13) ).
cnf(i_0_41,plain,
relation(empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a491f49t/lgb.p',i_0_41) ).
cnf(i_0_91,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a491f49t/lgb.p',i_0_91) ).
cnf(i_0_27,plain,
element(esk5_1(X1),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a491f49t/lgb.p',i_0_27) ).
cnf(i_0_42,plain,
empty(empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a491f49t/lgb.p',i_0_42) ).
cnf(i_0_100,plain,
( X1 = empty_set
| ~ empty(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a491f49t/lgb.p',i_0_100) ).
cnf(i_0_21,plain,
( transfinite_sequence_of(X1,X2)
| ~ function(X1)
| ~ relation(X1)
| ~ transfinite_sequence(X1)
| ~ subset(relation_rng(X1),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a491f49t/lgb.p',i_0_21) ).
cnf(i_0_99,plain,
( relation_rng(X1) = empty_set
| relation_dom(X1) != empty_set
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a491f49t/lgb.p',i_0_99) ).
cnf(i_0_19,plain,
( transfinite_sequence(X1)
| ~ function(X1)
| ~ relation(X1)
| ~ ordinal(relation_dom(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a491f49t/lgb.p',i_0_19) ).
cnf(i_0_33,plain,
ordinal(empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a491f49t/lgb.p',i_0_33) ).
cnf(i_0_38,plain,
function(empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a491f49t/lgb.p',i_0_38) ).
cnf(i_0_95,negated_conjecture,
~ transfinite_sequence_of(empty_set,esk20_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a491f49t/lgb.p',i_0_95) ).
cnf(c_0_117,plain,
( ~ empty(X1)
| ~ in(X2,X3)
| ~ element(X3,powerset(X1)) ),
i_0_97 ).
cnf(c_0_118,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
i_0_93 ).
cnf(c_0_119,plain,
( ~ subset(X1,X2)
| ~ empty(X2)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_120,plain,
subset(empty_set,X1),
i_0_92 ).
cnf(c_0_121,plain,
( in(unordered_pair(unordered_pair(X1,esk1_3(X2,X3,X1)),singleton(X1)),X2)
| X3 != relation_dom(X2)
| ~ relation(X2)
| ~ in(X1,X3) ),
i_0_17 ).
cnf(c_0_122,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_13 ).
cnf(c_0_123,plain,
( ~ empty(X1)
| ~ in(X2,empty_set) ),
inference(spm,[status(thm)],[c_0_119,c_0_120]) ).
cnf(c_0_124,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,esk1_3(X2,X3,X1))),X2)
| X3 != relation_dom(X2)
| ~ relation(X2)
| ~ in(X1,X3) ),
inference(rw,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_125,plain,
relation(empty_set),
i_0_41 ).
cnf(c_0_126,plain,
( X1 != relation_dom(empty_set)
| ~ empty(X2)
| ~ in(X3,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_125])]) ).
cnf(c_0_127,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
i_0_91 ).
cnf(c_0_128,plain,
element(esk5_1(X1),X1),
i_0_27 ).
cnf(c_0_129,plain,
( ~ empty(X1)
| ~ in(X2,relation_dom(empty_set)) ),
inference(er,[status(thm)],[c_0_126]) ).
cnf(c_0_130,plain,
( empty(X1)
| in(esk5_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_127,c_0_128]) ).
cnf(c_0_131,plain,
( empty(relation_dom(empty_set))
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_132,plain,
empty(empty_set),
i_0_42 ).
cnf(c_0_133,plain,
( X1 = empty_set
| ~ empty(X1) ),
i_0_100 ).
cnf(c_0_134,plain,
empty(relation_dom(empty_set)),
inference(spm,[status(thm)],[c_0_131,c_0_132]) ).
cnf(c_0_135,plain,
( transfinite_sequence_of(X1,X2)
| ~ function(X1)
| ~ relation(X1)
| ~ transfinite_sequence(X1)
| ~ subset(relation_rng(X1),X2) ),
i_0_21 ).
cnf(c_0_136,plain,
( relation_rng(X1) = empty_set
| relation_dom(X1) != empty_set
| ~ relation(X1) ),
i_0_99 ).
cnf(c_0_137,plain,
( transfinite_sequence(X1)
| ~ function(X1)
| ~ relation(X1)
| ~ ordinal(relation_dom(X1)) ),
i_0_19 ).
cnf(c_0_138,plain,
relation_dom(empty_set) = empty_set,
inference(spm,[status(thm)],[c_0_133,c_0_134]) ).
cnf(c_0_139,plain,
ordinal(empty_set),
i_0_33 ).
cnf(c_0_140,plain,
function(empty_set),
i_0_38 ).
cnf(c_0_141,plain,
( transfinite_sequence_of(X1,X2)
| relation_dom(X1) != empty_set
| ~ transfinite_sequence(X1)
| ~ function(X1)
| ~ relation(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_136]),c_0_120])]) ).
cnf(c_0_142,plain,
transfinite_sequence(empty_set),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_139]),c_0_140]),c_0_125])]) ).
cnf(c_0_143,negated_conjecture,
~ transfinite_sequence_of(empty_set,esk20_0),
i_0_95 ).
cnf(c_0_144,plain,
transfinite_sequence_of(empty_set,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_138]),c_0_140]),c_0_125])]) ).
cnf(c_0_145,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_143,c_0_144])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM409+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 : n027.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 : Thu Jul 7 23:41:02 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.58/2.32 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.58/2.32 # No SInE strategy applied
% 7.58/2.32 # Trying AutoSched0 for 150 seconds
% 7.58/2.32 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 7.58/2.32 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.58/2.32 #
% 7.58/2.32 # Preprocessing time : 0.024 s
% 7.58/2.32
% 7.58/2.32 # Proof found!
% 7.58/2.32 # SZS status Theorem
% 7.58/2.32 # SZS output start CNFRefutation
% See solution above
% 7.58/2.32 # Training examples: 0 positive, 0 negative
% 7.58/2.32
% 7.58/2.32 # -------------------------------------------------
% 7.58/2.32 # User time : 0.034 s
% 7.58/2.32 # System time : 0.006 s
% 7.58/2.32 # Total time : 0.040 s
% 7.58/2.32 # Maximum resident set size: 7128 pages
% 7.58/2.32
%------------------------------------------------------------------------------