TSTP Solution File: SEU394+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU394+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:50 EDT 2022
% Result : Theorem 8.66s 2.64s
% Output : CNFRefutation 8.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 14
% Syntax : Number of clauses : 34 ( 22 unt; 6 nHn; 32 RR)
% Number of literals : 75 ( 7 equ; 44 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 24 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_385,plain,
( empty(X1)
| empty(X2)
| ~ empty(X3)
| ~ in(X3,X1)
| ~ filtered_subset(X1,boole_POSet(X2))
| ~ upper_relstr_subset(X1,boole_POSet(X2))
| ~ element(X1,powerset(the_carrier(boole_POSet(X2))))
| ~ proper_element(X1,powerset(the_carrier(boole_POSet(X2)))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6e2nkvv7/lgb.p',i_0_385) ).
cnf(i_0_395,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6e2nkvv7/lgb.p',i_0_395) ).
cnf(i_0_127,plain,
( empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ empty(cast_as_carrier_subset(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6e2nkvv7/lgb.p',i_0_127) ).
cnf(i_0_379,negated_conjecture,
one_sorted_str(esk38_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6e2nkvv7/lgb.p',i_0_379) ).
cnf(i_0_380,negated_conjecture,
~ empty_carrier(esk38_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6e2nkvv7/lgb.p',i_0_380) ).
cnf(i_0_373,negated_conjecture,
filter_of_net_str(esk38_0,net_of_bool_filter(esk38_0,cast_as_carrier_subset(esk38_0),esk39_0)) != esk39_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6e2nkvv7/lgb.p',i_0_373) ).
cnf(i_0_372,plain,
( filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) = set_difference(X2,singleton(empty_set))
| empty_carrier(X1)
| empty(X2)
| ~ one_sorted_str(X1)
| ~ filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
| ~ upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
| ~ element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6e2nkvv7/lgb.p',i_0_372) ).
cnf(i_0_374,negated_conjecture,
element(esk39_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk38_0))))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6e2nkvv7/lgb.p',i_0_374) ).
cnf(i_0_376,negated_conjecture,
upper_relstr_subset(esk39_0,boole_POSet(cast_as_carrier_subset(esk38_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6e2nkvv7/lgb.p',i_0_376) ).
cnf(i_0_377,negated_conjecture,
filtered_subset(esk39_0,boole_POSet(cast_as_carrier_subset(esk38_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6e2nkvv7/lgb.p',i_0_377) ).
cnf(i_0_378,negated_conjecture,
~ empty(esk39_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6e2nkvv7/lgb.p',i_0_378) ).
cnf(i_0_375,negated_conjecture,
proper_element(esk39_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk38_0))))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6e2nkvv7/lgb.p',i_0_375) ).
cnf(i_0_392,plain,
( set_difference(X1,singleton(X2)) = X1
| in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6e2nkvv7/lgb.p',i_0_392) ).
cnf(i_0_93,plain,
empty(empty_set),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6e2nkvv7/lgb.p',i_0_93) ).
cnf(c_0_410,plain,
( empty(X1)
| empty(X2)
| ~ empty(X3)
| ~ in(X3,X1)
| ~ filtered_subset(X1,boole_POSet(X2))
| ~ upper_relstr_subset(X1,boole_POSet(X2))
| ~ element(X1,powerset(the_carrier(boole_POSet(X2))))
| ~ proper_element(X1,powerset(the_carrier(boole_POSet(X2)))) ),
i_0_385 ).
cnf(c_0_411,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
i_0_395 ).
cnf(c_0_412,plain,
( empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ empty(cast_as_carrier_subset(X1)) ),
i_0_127 ).
cnf(c_0_413,negated_conjecture,
one_sorted_str(esk38_0),
i_0_379 ).
cnf(c_0_414,negated_conjecture,
~ empty_carrier(esk38_0),
i_0_380 ).
cnf(c_0_415,negated_conjecture,
filter_of_net_str(esk38_0,net_of_bool_filter(esk38_0,cast_as_carrier_subset(esk38_0),esk39_0)) != esk39_0,
i_0_373 ).
cnf(c_0_416,plain,
( filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) = set_difference(X2,singleton(empty_set))
| empty_carrier(X1)
| empty(X2)
| ~ one_sorted_str(X1)
| ~ filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
| ~ upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
| ~ element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) ),
i_0_372 ).
cnf(c_0_417,negated_conjecture,
element(esk39_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk38_0))))),
i_0_374 ).
cnf(c_0_418,negated_conjecture,
upper_relstr_subset(esk39_0,boole_POSet(cast_as_carrier_subset(esk38_0))),
i_0_376 ).
cnf(c_0_419,negated_conjecture,
filtered_subset(esk39_0,boole_POSet(cast_as_carrier_subset(esk38_0))),
i_0_377 ).
cnf(c_0_420,negated_conjecture,
~ empty(esk39_0),
i_0_378 ).
cnf(c_0_421,plain,
( empty(X1)
| ~ in(X2,X3)
| ~ empty(X2)
| ~ element(X3,powerset(the_carrier(boole_POSet(X1))))
| ~ proper_element(X3,powerset(the_carrier(boole_POSet(X1))))
| ~ upper_relstr_subset(X3,boole_POSet(X1))
| ~ filtered_subset(X3,boole_POSet(X1)) ),
inference(csr,[status(thm)],[c_0_410,c_0_411]) ).
cnf(c_0_422,negated_conjecture,
proper_element(esk39_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk38_0))))),
i_0_375 ).
cnf(c_0_423,negated_conjecture,
~ empty(cast_as_carrier_subset(esk38_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_412,c_0_413]),c_0_414]) ).
cnf(c_0_424,negated_conjecture,
set_difference(esk39_0,singleton(empty_set)) != esk39_0,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_415,c_0_416]),c_0_413]),c_0_417]),c_0_418]),c_0_419])]),c_0_420]),c_0_414]) ).
cnf(c_0_425,plain,
( set_difference(X1,singleton(X2)) = X1
| in(X2,X1) ),
i_0_392 ).
cnf(c_0_426,negated_conjecture,
( ~ in(X1,esk39_0)
| ~ empty(X1) ),
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_421,c_0_422]),c_0_417]),c_0_418]),c_0_419])]),c_0_423]) ).
cnf(c_0_427,plain,
in(empty_set,esk39_0),
inference(spm,[status(thm)],[c_0_424,c_0_425]) ).
cnf(c_0_428,plain,
empty(empty_set),
i_0_93 ).
cnf(c_0_429,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_426,c_0_427]),c_0_428])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU394+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n021.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 : Sun Jun 19 18:40:49 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 8.66/2.64 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.66/2.64 # No SInE strategy applied
% 8.66/2.64 # Trying AutoSched0 for 150 seconds
% 8.66/2.64 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 8.66/2.64 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.66/2.64 #
% 8.66/2.64 # Preprocessing time : 0.027 s
% 8.66/2.64
% 8.66/2.64 # Proof found!
% 8.66/2.64 # SZS status Theorem
% 8.66/2.64 # SZS output start CNFRefutation
% See solution above
% 8.66/2.64 # Training examples: 0 positive, 0 negative
% 8.66/2.64
% 8.66/2.64 # -------------------------------------------------
% 8.66/2.64 # User time : 0.028 s
% 8.66/2.64 # System time : 0.009 s
% 8.66/2.64 # Total time : 0.038 s
% 8.66/2.64 # Maximum resident set size: 7124 pages
% 8.66/2.64
%------------------------------------------------------------------------------