TSTP Solution File: SEU341+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU341+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 09:19:09 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 42 ( 14 unt; 0 def)
% Number of atoms : 150 ( 8 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 181 ( 73 ~; 63 |; 24 &)
% ( 1 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 63 ( 4 sgn 40 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t5_connsp_2,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( ( open_subset(X2,X1)
& in(X3,X2) )
=> point_neighbourhood(X2,X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t5_connsp_2) ).
fof(t55_tops_1,axiom,
! [X1] :
( ( topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( top_str(X2)
=> ! [X3] :
( element(X3,powerset(the_carrier(X1)))
=> ! [X4] :
( element(X4,powerset(the_carrier(X2)))
=> ( ( open_subset(X4,X2)
=> interior(X2,X4) = X4 )
& ( interior(X1,X3) = X3
=> open_subset(X3,X1) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t55_tops_1) ).
fof(rc1_subset_1,axiom,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc1_subset_1) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t5_subset) ).
fof(d1_connsp_2,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,powerset(the_carrier(X1)))
=> ( point_neighbourhood(X3,X1,X2)
<=> in(X2,interior(X1,X3)) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_connsp_2) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_subset) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_subset) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_boole) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( ( open_subset(X2,X1)
& in(X3,X2) )
=> point_neighbourhood(X2,X1,X3) ) ) ) ),
inference(assume_negation,[status(cth)],[t5_connsp_2]) ).
fof(c_0_9,plain,
! [X5,X6,X7,X8] :
( ( ~ open_subset(X8,X6)
| interior(X6,X8) = X8
| ~ element(X8,powerset(the_carrier(X6)))
| ~ element(X7,powerset(the_carrier(X5)))
| ~ top_str(X6)
| ~ topological_space(X5)
| ~ top_str(X5) )
& ( interior(X5,X7) != X7
| open_subset(X7,X5)
| ~ element(X8,powerset(the_carrier(X6)))
| ~ element(X7,powerset(the_carrier(X5)))
| ~ top_str(X6)
| ~ topological_space(X5)
| ~ top_str(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t55_tops_1])])])])])]) ).
fof(c_0_10,plain,
! [X3] :
( ( element(esk7_1(X3),powerset(X3))
| empty(X3) )
& ( ~ empty(esk7_1(X3))
| empty(X3) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[rc1_subset_1])])])])])])]) ).
fof(c_0_11,plain,
! [X4,X5,X6] :
( ~ in(X4,X5)
| ~ element(X5,powerset(X6))
| ~ empty(X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])]) ).
fof(c_0_12,negated_conjecture,
( ~ empty_carrier(esk1_0)
& topological_space(esk1_0)
& top_str(esk1_0)
& element(esk2_0,powerset(the_carrier(esk1_0)))
& element(esk3_0,the_carrier(esk1_0))
& open_subset(esk2_0,esk1_0)
& in(esk3_0,esk2_0)
& ~ point_neighbourhood(esk2_0,esk1_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_8])])])])])]) ).
fof(c_0_13,plain,
! [X4,X5,X6] :
( ( ~ point_neighbourhood(X6,X4,X5)
| in(X5,interior(X4,X6))
| ~ element(X6,powerset(the_carrier(X4)))
| ~ element(X5,the_carrier(X4))
| empty_carrier(X4)
| ~ topological_space(X4)
| ~ top_str(X4) )
& ( ~ in(X5,interior(X4,X6))
| point_neighbourhood(X6,X4,X5)
| ~ element(X6,powerset(the_carrier(X4)))
| ~ element(X5,the_carrier(X4))
| empty_carrier(X4)
| ~ topological_space(X4)
| ~ top_str(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[d1_connsp_2])])])])])])]) ).
cnf(c_0_14,plain,
( interior(X2,X4) = X4
| ~ top_str(X1)
| ~ topological_space(X1)
| ~ top_str(X2)
| ~ element(X3,powerset(the_carrier(X1)))
| ~ element(X4,powerset(the_carrier(X2)))
| ~ open_subset(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( empty(X1)
| element(esk7_1(X1),powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ empty(X1)
| ~ element(X2,powerset(X1))
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
element(esk2_0,powerset(the_carrier(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
~ point_neighbourhood(esk2_0,esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( empty_carrier(X1)
| point_neighbourhood(X3,X1,X2)
| ~ top_str(X1)
| ~ topological_space(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,powerset(the_carrier(X1)))
| ~ in(X2,interior(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
topological_space(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,negated_conjecture,
element(esk3_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_24,plain,
! [X3,X4] :
( ~ element(X3,X4)
| empty(X4)
| in(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_25,plain,
( interior(X1,X2) = X2
| empty(the_carrier(X3))
| ~ open_subset(X2,X1)
| ~ top_str(X1)
| ~ top_str(X3)
| ~ topological_space(X3)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_26,negated_conjecture,
open_subset(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,negated_conjecture,
( ~ empty(the_carrier(esk1_0))
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_28,negated_conjecture,
in(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_29,plain,
! [X3,X4] :
( ~ in(X3,X4)
| element(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
fof(c_0_30,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
cnf(c_0_31,negated_conjecture,
~ in(esk3_0,interior(esk1_0,esk2_0)),
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_18,c_0_19]),c_0_20]),c_0_21]),c_0_17]),c_0_22])]),c_0_23]) ).
cnf(c_0_32,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,negated_conjecture,
( interior(esk1_0,esk2_0) = esk2_0
| empty(the_carrier(X1))
| ~ top_str(X1)
| ~ topological_space(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_20]),c_0_17])]) ).
cnf(c_0_34,negated_conjecture,
~ empty(the_carrier(esk1_0)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( empty(interior(esk1_0,esk2_0))
| ~ element(esk3_0,interior(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
interior(esk1_0,esk2_0) = esk2_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_21]),c_0_20])]),c_0_34]) ).
cnf(c_0_39,negated_conjecture,
element(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_35,c_0_28]) ).
cnf(c_0_40,negated_conjecture,
~ empty(esk2_0),
inference(spm,[status(thm)],[c_0_36,c_0_28]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_38]),c_0_39])]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU341+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 10:54:39 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.016 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 42
% 0.23/1.40 # Proof object clause steps : 25
% 0.23/1.40 # Proof object formula steps : 17
% 0.23/1.40 # Proof object conjectures : 20
% 0.23/1.40 # Proof object clause conjectures : 17
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 15
% 0.23/1.40 # Proof object initial formulas used : 8
% 0.23/1.40 # Proof object generating inferences : 9
% 0.23/1.40 # Proof object simplifying inferences : 17
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 45
% 0.23/1.40 # Removed by relevancy pruning/SinE : 27
% 0.23/1.40 # Initial clauses : 29
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 29
% 0.23/1.40 # Processed clauses : 91
% 0.23/1.40 # ...of these trivial : 0
% 0.23/1.40 # ...subsumed : 24
% 0.23/1.40 # ...remaining for further processing : 67
% 0.23/1.40 # Other redundant clauses eliminated : 0
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 3
% 0.23/1.40 # Backward-rewritten : 9
% 0.23/1.40 # Generated clauses : 115
% 0.23/1.40 # ...of the previous two non-trivial : 103
% 0.23/1.40 # Contextual simplify-reflections : 5
% 0.23/1.40 # Paramodulations : 115
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 0
% 0.23/1.40 # Current number of processed clauses : 55
% 0.23/1.40 # Positive orientable unit clauses : 12
% 0.23/1.40 # Positive unorientable unit clauses: 1
% 0.23/1.40 # Negative unit clauses : 6
% 0.23/1.40 # Non-unit-clauses : 36
% 0.23/1.40 # Current number of unprocessed clauses: 26
% 0.23/1.40 # ...number of literals in the above : 104
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 12
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 403
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 200
% 0.23/1.40 # Non-unit clause-clause subsumptions : 28
% 0.23/1.40 # Unit Clause-clause subsumption calls : 32
% 0.23/1.40 # Rewrite failures with RHS unbound : 12
% 0.23/1.40 # BW rewrite match attempts : 6
% 0.23/1.40 # BW rewrite match successes : 6
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 3836
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.019 s
% 0.23/1.40 # System time : 0.003 s
% 0.23/1.40 # Total time : 0.022 s
% 0.23/1.40 # Maximum resident set size: 3028 pages
%------------------------------------------------------------------------------