%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU319+1 : TPTP v8.1.0. Released v3.3.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 : Tue Jul 19 08:40:45 EDT 2022
% Result : Theorem 6.85s 2.27s
% Output : CNFRefutation 6.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 7 unt; 2 nHn; 21 RR)
% Number of literals : 49 ( 2 equ; 29 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( closed_subset(X1,X2)
| ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ open_subset(subset_difference(the_carrier(X2),cast_as_carrier_subset(X2),X1),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-41i8ces9/input.p',i_0_1) ).
cnf(i_0_18,plain,
( subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2) = subset_complement(the_carrier(X1),X2)
| ~ one_sorted_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-41i8ces9/input.p',i_0_18) ).
cnf(i_0_8,plain,
( one_sorted_str(X1)
| ~ top_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-41i8ces9/input.p',i_0_8) ).
cnf(i_0_19,negated_conjecture,
( closed_subset(esk5_0,esk4_0)
| open_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-41i8ces9/input.p',i_0_19) ).
cnf(i_0_21,negated_conjecture,
element(esk5_0,powerset(the_carrier(esk4_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-41i8ces9/input.p',i_0_21) ).
cnf(i_0_22,negated_conjecture,
top_str(esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-41i8ces9/input.p',i_0_22) ).
cnf(i_0_20,negated_conjecture,
( ~ closed_subset(esk5_0,esk4_0)
| ~ open_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-41i8ces9/input.p',i_0_20) ).
cnf(i_0_2,plain,
( open_subset(subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2),X1)
| ~ top_str(X1)
| ~ closed_subset(X2,X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-41i8ces9/input.p',i_0_2) ).
cnf(c_0_31,plain,
( closed_subset(X1,X2)
| ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ open_subset(subset_difference(the_carrier(X2),cast_as_carrier_subset(X2),X1),X2) ),
i_0_1 ).
cnf(c_0_32,plain,
( subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2) = subset_complement(the_carrier(X1),X2)
| ~ one_sorted_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
i_0_18 ).
cnf(c_0_33,plain,
( one_sorted_str(X1)
| ~ top_str(X1) ),
i_0_8 ).
cnf(c_0_34,plain,
( closed_subset(X1,X2)
| ~ open_subset(subset_complement(the_carrier(X2),X1),X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ top_str(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_35,negated_conjecture,
( closed_subset(esk5_0,esk4_0)
| open_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0) ),
i_0_19 ).
cnf(c_0_36,negated_conjecture,
element(esk5_0,powerset(the_carrier(esk4_0))),
i_0_21 ).
cnf(c_0_37,negated_conjecture,
top_str(esk4_0),
i_0_22 ).
cnf(c_0_38,negated_conjecture,
( ~ closed_subset(esk5_0,esk4_0)
| ~ open_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0) ),
i_0_20 ).
cnf(c_0_39,negated_conjecture,
closed_subset(esk5_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37])]) ).
cnf(c_0_40,plain,
( open_subset(subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2),X1)
| ~ top_str(X1)
| ~ closed_subset(X2,X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
i_0_2 ).
cnf(c_0_41,negated_conjecture,
~ open_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_42,plain,
( open_subset(subset_complement(the_carrier(X1),X2),X1)
| ~ closed_subset(X2,X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ top_str(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_32]),c_0_33]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_39]),c_0_36]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU319+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 11:00:26 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 6.85/2.27 # ENIGMATIC: Solved by autoschedule:
% 6.85/2.27 # No SInE strategy applied
% 6.85/2.27 # Trying AutoSched0 for 150 seconds
% 6.85/2.27 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S060N
% 6.85/2.27 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.85/2.27 #
% 6.85/2.27 # Preprocessing time : 0.013 s
% 6.85/2.27 # Presaturation interreduction done
% 6.85/2.27
% 6.85/2.27 # Proof found!
% 6.85/2.27 # SZS status Theorem
% 6.85/2.27 # SZS output start CNFRefutation
% See solution above
% 6.85/2.27 # Training examples: 0 positive, 0 negative
% 6.85/2.27
% 6.85/2.27 # -------------------------------------------------
% 6.85/2.27 # User time : 0.015 s
% 6.85/2.27 # System time : 0.003 s
% 6.85/2.27 # Total time : 0.018 s
% 6.85/2.27 # Maximum resident set size: 7124 pages
% 6.85/2.27
%------------------------------------------------------------------------------