TSTP Solution File: SEU345+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU345+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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 08:41:01 EDT 2022
% Result : Theorem 16.86s 3.54s
% Output : CNFRefutation 16.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of clauses : 59 ( 25 unt; 17 nHn; 37 RR)
% Number of literals : 138 ( 34 equ; 66 neg)
% Maximal clause size : 7 ( 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 : 85 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_34,plain,
( powerset(X1) = the_carrier(X2)
| X2 != boole_lattice(X1)
| ~ latt_str(X2)
| ~ strict_latt_str(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1l3d1lda/input.p',i_0_34) ).
cnf(i_0_43,plain,
strict_latt_str(boole_lattice(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1l3d1lda/input.p',i_0_43) ).
cnf(i_0_42,plain,
latt_str(boole_lattice(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1l3d1lda/input.p',i_0_42) ).
cnf(i_0_63,plain,
( meet_semilatt_str(X1)
| ~ latt_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1l3d1lda/input.p',i_0_63) ).
cnf(i_0_20,plain,
( empty_carrier(X1)
| lower_bounded_semilattstr(X1)
| element(esk2_2(X1,X2),the_carrier(X1))
| ~ meet_semilatt_str(X1)
| ~ element(X2,the_carrier(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1l3d1lda/input.p',i_0_20) ).
cnf(i_0_82,plain,
~ empty_carrier(boole_lattice(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1l3d1lda/input.p',i_0_82) ).
cnf(i_0_169,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1l3d1lda/input.p',i_0_169) ).
cnf(i_0_167,plain,
subset(empty_set,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1l3d1lda/input.p',i_0_167) ).
cnf(i_0_162,plain,
( meet(boole_lattice(X1),X2,X3) = set_intersection2(X2,X3)
| ~ element(X3,the_carrier(boole_lattice(X1)))
| ~ element(X2,the_carrier(boole_lattice(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1l3d1lda/input.p',i_0_162) ).
cnf(i_0_165,plain,
set_intersection2(X1,empty_set) = empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1l3d1lda/input.p',i_0_165) ).
cnf(i_0_15,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1l3d1lda/input.p',i_0_15) ).
cnf(i_0_166,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1l3d1lda/input.p',i_0_166) ).
cnf(i_0_57,plain,
( empty_carrier(X1)
| element(bottom_of_semilattstr(X1),the_carrier(X1))
| ~ meet_semilatt_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1l3d1lda/input.p',i_0_57) ).
cnf(i_0_27,plain,
( meet(X1,X2,X3) = X2
| empty_carrier(X1)
| X2 != bottom_of_semilattstr(X1)
| ~ meet_semilatt_str(X1)
| ~ lower_bounded_semilattstr(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1l3d1lda/input.p',i_0_27) ).
cnf(i_0_84,plain,
~ empty(powerset(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1l3d1lda/input.p',i_0_84) ).
cnf(i_0_19,plain,
( empty_carrier(X1)
| lower_bounded_semilattstr(X1)
| meet(X1,X2,esk2_2(X1,X2)) != X2
| meet(X1,esk2_2(X1,X2),X2) != X2
| ~ meet_semilatt_str(X1)
| ~ element(X2,the_carrier(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1l3d1lda/input.p',i_0_19) ).
cnf(i_0_164,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1l3d1lda/input.p',i_0_164) ).
cnf(i_0_168,negated_conjecture,
( bottom_of_semilattstr(boole_lattice(esk22_0)) != empty_set
| ~ lower_bounded_semilattstr(boole_lattice(esk22_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1l3d1lda/input.p',i_0_168) ).
cnf(c_0_188,plain,
( powerset(X1) = the_carrier(X2)
| X2 != boole_lattice(X1)
| ~ latt_str(X2)
| ~ strict_latt_str(X2) ),
i_0_34 ).
cnf(c_0_189,plain,
strict_latt_str(boole_lattice(X1)),
i_0_43 ).
cnf(c_0_190,plain,
latt_str(boole_lattice(X1)),
i_0_42 ).
cnf(c_0_191,plain,
( meet_semilatt_str(X1)
| ~ latt_str(X1) ),
i_0_63 ).
cnf(c_0_192,plain,
( empty_carrier(X1)
| lower_bounded_semilattstr(X1)
| element(esk2_2(X1,X2),the_carrier(X1))
| ~ meet_semilatt_str(X1)
| ~ element(X2,the_carrier(X1)) ),
i_0_20 ).
cnf(c_0_193,plain,
the_carrier(boole_lattice(X1)) = powerset(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_188]),c_0_189]),c_0_190])]) ).
cnf(c_0_194,plain,
~ empty_carrier(boole_lattice(X1)),
i_0_82 ).
cnf(c_0_195,plain,
meet_semilatt_str(boole_lattice(X1)),
inference(spm,[status(thm)],[c_0_191,c_0_190]) ).
cnf(c_0_196,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
i_0_169 ).
cnf(c_0_197,plain,
subset(empty_set,X1),
i_0_167 ).
cnf(c_0_198,plain,
( meet(boole_lattice(X1),X2,X3) = set_intersection2(X2,X3)
| ~ element(X3,the_carrier(boole_lattice(X1)))
| ~ element(X2,the_carrier(boole_lattice(X1))) ),
i_0_162 ).
cnf(c_0_199,plain,
( lower_bounded_semilattstr(boole_lattice(X1))
| element(esk2_2(boole_lattice(X1),X2),powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_192,c_0_193]),c_0_194]),c_0_195])]) ).
cnf(c_0_200,plain,
element(empty_set,powerset(X1)),
inference(spm,[status(thm)],[c_0_196,c_0_197]) ).
cnf(c_0_201,plain,
( meet(boole_lattice(X1),X2,X3) = set_intersection2(X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_198,c_0_193]),c_0_193]) ).
cnf(c_0_202,plain,
( lower_bounded_semilattstr(boole_lattice(X1))
| element(esk2_2(boole_lattice(X1),empty_set),powerset(X1)) ),
inference(spm,[status(thm)],[c_0_199,c_0_200]) ).
cnf(c_0_203,plain,
set_intersection2(X1,empty_set) = empty_set,
i_0_165 ).
cnf(c_0_204,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_15 ).
cnf(c_0_205,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
i_0_166 ).
cnf(c_0_206,plain,
( empty_carrier(X1)
| element(bottom_of_semilattstr(X1),the_carrier(X1))
| ~ meet_semilatt_str(X1) ),
i_0_57 ).
cnf(c_0_207,plain,
( meet(boole_lattice(X1),X2,esk2_2(boole_lattice(X1),empty_set)) = set_intersection2(X2,esk2_2(boole_lattice(X1),empty_set))
| lower_bounded_semilattstr(boole_lattice(X1))
| ~ element(X2,powerset(X1)) ),
inference(spm,[status(thm)],[c_0_201,c_0_202]) ).
cnf(c_0_208,plain,
set_intersection2(empty_set,X1) = empty_set,
inference(spm,[status(thm)],[c_0_203,c_0_204]) ).
cnf(c_0_209,plain,
( meet(X1,X2,X3) = X2
| empty_carrier(X1)
| X2 != bottom_of_semilattstr(X1)
| ~ meet_semilatt_str(X1)
| ~ lower_bounded_semilattstr(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
i_0_27 ).
cnf(c_0_210,plain,
( in(bottom_of_semilattstr(X1),the_carrier(X1))
| empty_carrier(X1)
| empty(the_carrier(X1))
| ~ meet_semilatt_str(X1) ),
inference(spm,[status(thm)],[c_0_205,c_0_206]) ).
cnf(c_0_211,plain,
~ empty(powerset(X1)),
i_0_84 ).
cnf(c_0_212,plain,
( empty_carrier(X1)
| lower_bounded_semilattstr(X1)
| meet(X1,X2,esk2_2(X1,X2)) != X2
| meet(X1,esk2_2(X1,X2),X2) != X2
| ~ meet_semilatt_str(X1)
| ~ element(X2,the_carrier(X1)) ),
i_0_19 ).
cnf(c_0_213,plain,
( meet(boole_lattice(X1),empty_set,esk2_2(boole_lattice(X1),empty_set)) = empty_set
| lower_bounded_semilattstr(boole_lattice(X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_207,c_0_200]),c_0_208]) ).
cnf(c_0_214,plain,
( meet(boole_lattice(X1),X2,empty_set) = empty_set
| ~ element(X2,powerset(X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_201,c_0_200]),c_0_203]) ).
cnf(c_0_215,plain,
( meet(X1,bottom_of_semilattstr(X1),X2) = bottom_of_semilattstr(X1)
| empty_carrier(X1)
| ~ lower_bounded_semilattstr(X1)
| ~ element(bottom_of_semilattstr(X1),the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ meet_semilatt_str(X1) ),
inference(er,[status(thm)],[c_0_209]) ).
cnf(c_0_216,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
i_0_164 ).
cnf(c_0_217,plain,
in(bottom_of_semilattstr(boole_lattice(X1)),powerset(X1)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_210,c_0_193]),c_0_195])]),c_0_194]),c_0_211]) ).
cnf(c_0_218,plain,
( lower_bounded_semilattstr(boole_lattice(X1))
| meet(boole_lattice(X1),esk2_2(boole_lattice(X1),empty_set),empty_set) != empty_set ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_212,c_0_213]),c_0_193]),c_0_200]),c_0_195])]),c_0_194]) ).
cnf(c_0_219,plain,
( meet(boole_lattice(X1),esk2_2(boole_lattice(X1),empty_set),empty_set) = empty_set
| lower_bounded_semilattstr(boole_lattice(X1)) ),
inference(spm,[status(thm)],[c_0_214,c_0_202]) ).
cnf(c_0_220,plain,
( meet(boole_lattice(X1),bottom_of_semilattstr(boole_lattice(X1)),X2) = bottom_of_semilattstr(boole_lattice(X1))
| ~ lower_bounded_semilattstr(boole_lattice(X1))
| ~ element(bottom_of_semilattstr(boole_lattice(X1)),powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_215,c_0_193]),c_0_194]),c_0_195])]) ).
cnf(c_0_221,plain,
element(bottom_of_semilattstr(boole_lattice(X1)),powerset(X1)),
inference(spm,[status(thm)],[c_0_216,c_0_217]) ).
cnf(c_0_222,plain,
lower_bounded_semilattstr(boole_lattice(X1)),
inference(spm,[status(thm)],[c_0_218,c_0_219]) ).
cnf(c_0_223,negated_conjecture,
( bottom_of_semilattstr(boole_lattice(esk22_0)) != empty_set
| ~ lower_bounded_semilattstr(boole_lattice(esk22_0)) ),
i_0_168 ).
cnf(c_0_224,plain,
( meet(boole_lattice(X1),bottom_of_semilattstr(boole_lattice(X1)),X2) = bottom_of_semilattstr(boole_lattice(X1))
| ~ element(X2,powerset(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_220,c_0_221])]),c_0_222])]) ).
cnf(c_0_225,plain,
meet(boole_lattice(X1),bottom_of_semilattstr(boole_lattice(X1)),empty_set) = empty_set,
inference(spm,[status(thm)],[c_0_214,c_0_221]) ).
cnf(c_0_226,negated_conjecture,
bottom_of_semilattstr(boole_lattice(esk22_0)) != empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_223,c_0_222])]) ).
cnf(c_0_227,plain,
bottom_of_semilattstr(boole_lattice(X1)) = empty_set,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_200]),c_0_225]) ).
cnf(c_0_228,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_226,c_0_227])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU345+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n010.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 : Mon Jun 20 06:43:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 16.86/3.54 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 16.86/3.54 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 30; version: 991; iters: 150)
% 16.86/3.54 # Preprocessing time : 0.822 s
% 16.86/3.54 # Presaturation interreduction done
% 16.86/3.54
% 16.86/3.54 # Proof found!
% 16.86/3.54 # SZS status Theorem
% 16.86/3.54 # SZS output start CNFRefutation
% See solution above
% 16.86/3.54 # Training examples: 0 positive, 0 negative
% 16.86/3.54
% 16.86/3.54 # -------------------------------------------------
% 16.86/3.54 # User time : 0.884 s
% 16.86/3.54 # System time : 0.107 s
% 16.86/3.54 # Total time : 0.990 s
% 16.86/3.54 # ...preprocessing : 0.822 s
% 16.86/3.54 # ...main loop : 0.168 s
% 16.86/3.54 # Maximum resident set size: 168264 pages
% 16.86/3.54
%------------------------------------------------------------------------------