TSTP Solution File: SEU324+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU324+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:25:59 EDT 2023
% Result : Timeout 408.24s 300.22s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 9 unt; 0 def)
% Number of atoms : 132 ( 28 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 148 ( 54 ~; 52 |; 18 &)
% ( 1 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn; 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_tops_1,axiom,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> interior(X1,X2) = subset_complement(the_carrier(X1),topstr_closure(X1,subset_complement(the_carrier(X1),X2))) ) ),
file('/export/starexec/sandbox/tmp/tmp.2vyhpBPLry/E---3.1_32505.p',d1_tops_1) ).
fof(involutiveness_k3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,subset_complement(X1,X2)) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.2vyhpBPLry/E---3.1_32505.p',involutiveness_k3_subset_1) ).
fof(dt_k3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> element(subset_complement(X1,X2),powerset(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.2vyhpBPLry/E---3.1_32505.p',dt_k3_subset_1) ).
fof(t52_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( ( closed_subset(X2,X1)
=> topstr_closure(X1,X2) = X2 )
& ( ( topological_space(X1)
& topstr_closure(X1,X2) = X2 )
=> closed_subset(X2,X1) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.2vyhpBPLry/E---3.1_32505.p',t52_pre_topc) ).
fof(t55_tops_1,conjecture,
! [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/sandbox/tmp/tmp.2vyhpBPLry/E---3.1_32505.p',t55_tops_1) ).
fof(t30_tops_1,axiom,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( open_subset(X2,X1)
<=> closed_subset(subset_complement(the_carrier(X1),X2),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.2vyhpBPLry/E---3.1_32505.p',t30_tops_1) ).
fof(fc6_tops_1,axiom,
! [X1,X2] :
( ( topological_space(X1)
& top_str(X1)
& element(X2,powerset(the_carrier(X1))) )
=> open_subset(interior(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/tmp.2vyhpBPLry/E---3.1_32505.p',fc6_tops_1) ).
fof(c_0_7,plain,
! [X21,X22] :
( ~ top_str(X21)
| ~ element(X22,powerset(the_carrier(X21)))
| interior(X21,X22) = subset_complement(the_carrier(X21),topstr_closure(X21,subset_complement(the_carrier(X21),X22))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_tops_1])])]) ).
fof(c_0_8,plain,
! [X33,X34] :
( ~ element(X34,powerset(X33))
| subset_complement(X33,subset_complement(X33,X34)) = X34 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[involutiveness_k3_subset_1])]) ).
fof(c_0_9,plain,
! [X25,X26] :
( ~ element(X26,powerset(X25))
| element(subset_complement(X25,X26),powerset(X25)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k3_subset_1])]) ).
cnf(c_0_10,plain,
( interior(X1,X2) = subset_complement(the_carrier(X1),topstr_closure(X1,subset_complement(the_carrier(X1),X2)))
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( subset_complement(X2,subset_complement(X2,X1)) = X1
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( element(subset_complement(X2,X1),powerset(X2))
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X37,X38] :
( ( ~ closed_subset(X38,X37)
| topstr_closure(X37,X38) = X38
| ~ element(X38,powerset(the_carrier(X37)))
| ~ top_str(X37) )
& ( ~ topological_space(X37)
| topstr_closure(X37,X38) != X38
| closed_subset(X38,X37)
| ~ element(X38,powerset(the_carrier(X37)))
| ~ top_str(X37) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t52_pre_topc])])])]) ).
cnf(c_0_14,plain,
( subset_complement(the_carrier(X1),topstr_closure(X1,X2)) = interior(X1,subset_complement(the_carrier(X1),X2))
| ~ element(X2,powerset(the_carrier(X1)))
| ~ top_str(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,plain,
( topstr_closure(X2,X1) = X1
| ~ closed_subset(X1,X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ top_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,negated_conjecture,
~ ! [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) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t55_tops_1]) ).
cnf(c_0_17,plain,
( interior(X1,subset_complement(the_carrier(X1),X2)) = subset_complement(the_carrier(X1),X2)
| ~ closed_subset(X2,X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ top_str(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_18,plain,
! [X19,X20] :
( ( ~ open_subset(X20,X19)
| closed_subset(subset_complement(the_carrier(X19),X20),X19)
| ~ element(X20,powerset(the_carrier(X19)))
| ~ top_str(X19) )
& ( ~ closed_subset(subset_complement(the_carrier(X19),X20),X19)
| open_subset(X20,X19)
| ~ element(X20,powerset(the_carrier(X19)))
| ~ top_str(X19) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t30_tops_1])])])]) ).
fof(c_0_19,plain,
! [X13,X14] :
( ~ topological_space(X13)
| ~ top_str(X13)
| ~ element(X14,powerset(the_carrier(X13)))
| open_subset(interior(X13,X14),X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc6_tops_1])]) ).
fof(c_0_20,negated_conjecture,
( topological_space(esk1_0)
& top_str(esk1_0)
& top_str(esk2_0)
& element(esk3_0,powerset(the_carrier(esk1_0)))
& element(esk4_0,powerset(the_carrier(esk2_0)))
& ( interior(esk1_0,esk3_0) = esk3_0
| open_subset(esk4_0,esk2_0) )
& ( ~ open_subset(esk3_0,esk1_0)
| open_subset(esk4_0,esk2_0) )
& ( interior(esk1_0,esk3_0) = esk3_0
| interior(esk2_0,esk4_0) != esk4_0 )
& ( ~ open_subset(esk3_0,esk1_0)
| interior(esk2_0,esk4_0) != esk4_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
cnf(c_0_21,plain,
( interior(X1,X2) = X2
| ~ closed_subset(subset_complement(the_carrier(X1),X2),X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ top_str(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_11]),c_0_12]) ).
cnf(c_0_22,plain,
( closed_subset(subset_complement(the_carrier(X2),X1),X2)
| ~ open_subset(X1,X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ top_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( open_subset(interior(X1,X2),X1)
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( interior(esk1_0,esk3_0) = esk3_0
| open_subset(esk4_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
topological_space(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
element(esk3_0,powerset(the_carrier(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( open_subset(esk4_0,esk2_0)
| ~ open_subset(esk3_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,negated_conjecture,
( interior(esk1_0,esk3_0) = esk3_0
| interior(esk2_0,esk4_0) != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
( interior(X1,X2) = X2
| ~ open_subset(X2,X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ top_str(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_31,negated_conjecture,
open_subset(esk4_0,esk2_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_32,negated_conjecture,
element(esk4_0,powerset(the_carrier(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_33,negated_conjecture,
top_str(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_34,negated_conjecture,
( ~ open_subset(esk3_0,esk1_0)
| interior(esk2_0,esk4_0) != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_35,negated_conjecture,
interior(esk1_0,esk3_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_36,negated_conjecture,
~ open_subset(esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_30]),c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_37,negated_conjecture,
$false,
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_23,c_0_35]),c_0_25]),c_0_26]),c_0_27])]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.14 % Problem : SEU324+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.15 % Command : run_E %s %d THM
% 0.12/0.36 % Computer : n001.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8042.1875MB
% 0.12/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.36 % CPULimit : 2400
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Mon Oct 2 09:03:05 EDT 2023
% 0.12/0.36 % CPUTime :
% 0.19/0.50 Running first-order theorem proving
% 0.19/0.50 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.2vyhpBPLry/E---3.1_32505.p
% 408.24/300.22 # Version: 3.1pre001
% 408.24/300.22 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.24/300.22 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.24/300.22 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.24/300.22 # Starting new_bool_3 with 300s (1) cores
% 408.24/300.22 # Starting new_bool_1 with 300s (1) cores
% 408.24/300.22 # Starting sh5l with 300s (1) cores
% 408.24/300.22 # sh5l with pid 32587 completed with status 0
% 408.24/300.22 # Result found by sh5l
% 408.24/300.22 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.24/300.22 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.24/300.22 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.24/300.22 # Starting new_bool_3 with 300s (1) cores
% 408.24/300.22 # Starting new_bool_1 with 300s (1) cores
% 408.24/300.22 # Starting sh5l with 300s (1) cores
% 408.24/300.22 # SinE strategy is gf500_gu_R04_F100_L20000
% 408.24/300.22 # Search class: FGHSF-FFMM21-MFFFFFNN
% 408.24/300.22 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 408.24/300.22 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 408.24/300.22 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32594 completed with status 0
% 408.24/300.22 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 408.24/300.22 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.24/300.22 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.24/300.22 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.24/300.22 # Starting new_bool_3 with 300s (1) cores
% 408.24/300.22 # Starting new_bool_1 with 300s (1) cores
% 408.24/300.22 # Starting sh5l with 300s (1) cores
% 408.24/300.22 # SinE strategy is gf500_gu_R04_F100_L20000
% 408.24/300.22 # Search class: FGHSF-FFMM21-MFFFFFNN
% 408.24/300.22 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 408.24/300.22 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 408.24/300.22 # Preprocessing time : 0.001 s
% 408.24/300.22 # Presaturation interreduction done
% 408.24/300.22
% 408.24/300.22 # Proof found!
% 408.24/300.22 # SZS status Theorem
% 408.24/300.22 # SZS output start CNFRefutation
% See solution above
% 408.24/300.22 # Parsed axioms : 25
% 408.24/300.22 # Removed by relevancy pruning/SinE : 8
% 408.24/300.22 # Initial clauses : 31
% 408.24/300.22 # Removed in clause preprocessing : 0
% 408.24/300.22 # Initial clauses in saturation : 31
% 408.24/300.22 # Processed clauses : 89
% 408.24/300.22 # ...of these trivial : 0
% 408.24/300.22 # ...subsumed : 8
% 408.24/300.22 # ...remaining for further processing : 81
% 408.24/300.22 # Other redundant clauses eliminated : 0
% 408.24/300.22 # Clauses deleted for lack of memory : 0
% 408.24/300.22 # Backward-subsumed : 5
% 408.24/300.22 # Backward-rewritten : 2
% 408.24/300.22 # Generated clauses : 105
% 408.24/300.22 # ...of the previous two non-redundant : 84
% 408.24/300.22 # ...aggressively subsumed : 0
% 408.24/300.22 # Contextual simplify-reflections : 11
% 408.24/300.22 # Paramodulations : 105
% 408.24/300.22 # Factorizations : 0
% 408.24/300.22 # NegExts : 0
% 408.24/300.22 # Equation resolutions : 0
% 408.24/300.22 # Total rewrite steps : 20
% 408.24/300.22 # Propositional unsat checks : 0
% 408.24/300.22 # Propositional check models : 0
% 408.24/300.22 # Propositional check unsatisfiable : 0
% 408.24/300.22 # Propositional clauses : 0
% 408.24/300.22 # Propositional clauses after purity: 0
% 408.24/300.22 # Propositional unsat core size : 0
% 408.24/300.22 # Propositional preprocessing time : 0.000
% 408.24/300.22 # Propositional encoding time : 0.000
% 408.24/300.22 # Propositional solver time : 0.000
% 408.24/300.22 # Success case prop preproc time : 0.000
% 408.24/300.22 # Success case prop encoding time : 0.000
% 408.24/300.22 # Success case prop solver time : 0.000
% 408.24/300.22 # Current number of processed clauses : 44
% 408.24/300.22 # Positive orientable unit clauses : 9
% 408.24/300.22 # Positive unorientable unit clauses: 0
% 408.24/300.22 # Negative unit clauses : 1
% 408.24/300.22 # Non-unit-clauses : 34
% 408.24/300.22 # Current number of unprocessed clauses: 54
% 408.24/300.22 # ...number of literals in the above : 272
% 408.24/300.22 # Current number of archived formulas : 0
% 408.24/300.22 # Current number of archived clauses : 37
% 408.24/300.22 # Clause-clause subsumption calls (NU) : 437
% 408.24/300.22 # Rec. Clause-clause subsumption calls : 146
% 408.24/300.22 # Non-unit clause-clause subsumptions : 22
% 408.24/300.22 # Unit Clause-clause subsumption calls : 37
% 408.24/300.22 # Rewrite failures with RHS unbound : 0
% 408.24/300.22 # BW rewrite match attempts : 2
% 408.24/300.22 # BW rewrite match successes : 2
% 408.24/300.22 # Condensation attempts : 0
% 408.24/300.22 # Condensation successes : 0
% 408.24/300.22 # Termbank termtop insertions : 5237
% 408.24/300.22
% 408.24/300.22 # -------------------------------------------------
% 408.24/300.22 # User time : 0.005 s
% 408.24/300.22 # System time : 0.002 s
% 408.24/300.22 # Total time : 0.007 s
% 408.24/300.22 # Maximum resident set size: 1840 pages
% 408.24/300.22
% 408.24/300.22 # -------------------------------------------------
% 408.24/300.22 # User time : 0.007 s
% 408.24/300.22 # System time : 0.004 s
% 408.24/300.22 # Total time : 0.011 s
% 408.24/300.22 # Maximum resident set size: 1696 pages
% 408.24/300.22 % E---3.1 exiting
% 408.24/300.22 % E---3.1 exiting
%------------------------------------------------------------------------------