TSTP Solution File: SEU341+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU341+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:26:04 EDT 2023
% Result : Theorem 0.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 106 ( 7 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 131 ( 47 ~; 41 |; 21 &)
% ( 2 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 1 sgn; 23 !; 0 ?)
% 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/tmp/tmp.GpjDiuAOOl/E---3.1_6688.p',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/tmp/tmp.GpjDiuAOOl/E---3.1_6688.p',t55_tops_1) ).
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/tmp/tmp.GpjDiuAOOl/E---3.1_6688.p',d1_connsp_2) ).
fof(c_0_3,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(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t5_connsp_2])]) ).
fof(c_0_4,plain,
! [X64,X65,X66,X67] :
( ( ~ open_subset(X67,X65)
| interior(X65,X67) = X67
| ~ element(X67,powerset(the_carrier(X65)))
| ~ element(X66,powerset(the_carrier(X64)))
| ~ top_str(X65)
| ~ topological_space(X64)
| ~ top_str(X64) )
& ( interior(X64,X66) != X66
| open_subset(X66,X64)
| ~ element(X67,powerset(the_carrier(X65)))
| ~ element(X66,powerset(the_carrier(X64)))
| ~ top_str(X65)
| ~ topological_space(X64)
| ~ top_str(X64) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t55_tops_1])])])]) ).
fof(c_0_5,negated_conjecture,
( ~ empty_carrier(esk8_0)
& topological_space(esk8_0)
& top_str(esk8_0)
& element(esk9_0,powerset(the_carrier(esk8_0)))
& element(esk10_0,the_carrier(esk8_0))
& open_subset(esk9_0,esk8_0)
& in(esk10_0,esk9_0)
& ~ point_neighbourhood(esk9_0,esk8_0,esk10_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_6,plain,
! [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)) ) ) ) ),
inference(fof_simplification,[status(thm)],[d1_connsp_2]) ).
cnf(c_0_7,plain,
( interior(X2,X1) = X1
| ~ open_subset(X1,X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ element(X3,powerset(the_carrier(X4)))
| ~ top_str(X2)
| ~ topological_space(X4)
| ~ top_str(X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
element(esk9_0,powerset(the_carrier(esk8_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
top_str(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
topological_space(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_11,plain,
! [X32,X33,X34] :
( ( ~ point_neighbourhood(X34,X32,X33)
| in(X33,interior(X32,X34))
| ~ element(X34,powerset(the_carrier(X32)))
| ~ element(X33,the_carrier(X32))
| empty_carrier(X32)
| ~ topological_space(X32)
| ~ top_str(X32) )
& ( ~ in(X33,interior(X32,X34))
| point_neighbourhood(X34,X32,X33)
| ~ element(X34,powerset(the_carrier(X32)))
| ~ element(X33,the_carrier(X32))
| empty_carrier(X32)
| ~ topological_space(X32)
| ~ top_str(X32) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_12,negated_conjecture,
( interior(X1,X2) = X2
| ~ open_subset(X2,X1)
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10])]) ).
cnf(c_0_13,negated_conjecture,
open_subset(esk9_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( point_neighbourhood(X3,X2,X1)
| empty_carrier(X2)
| ~ in(X1,interior(X2,X3))
| ~ element(X3,powerset(the_carrier(X2)))
| ~ element(X1,the_carrier(X2))
| ~ topological_space(X2)
| ~ top_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
interior(esk8_0,esk9_0) = esk9_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_9]),c_0_8])]) ).
cnf(c_0_16,negated_conjecture,
~ empty_carrier(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
~ point_neighbourhood(esk9_0,esk8_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
( point_neighbourhood(esk9_0,esk8_0,X1)
| ~ element(X1,the_carrier(esk8_0))
| ~ in(X1,esk9_0) ),
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_14,c_0_15]),c_0_9]),c_0_10]),c_0_8])]),c_0_16]) ).
cnf(c_0_19,negated_conjecture,
element(esk10_0,the_carrier(esk8_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
in(esk10_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU341+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n020.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 : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 08:34:01 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.GpjDiuAOOl/E---3.1_6688.p
% 0.18/0.47 # Version: 3.1pre001
% 0.18/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # Starting sh5l with 300s (1) cores
% 0.18/0.47 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 6773 completed with status 0
% 0.18/0.47 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.18/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.47 # No SInE strategy applied
% 0.18/0.47 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.18/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.47 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.47 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.18/0.47 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.18/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.18/0.47 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 6786 completed with status 0
% 0.18/0.47 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.18/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.47 # No SInE strategy applied
% 0.18/0.47 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.18/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.47 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.47 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.18/0.47 # Preprocessing time : 0.002 s
% 0.18/0.47
% 0.18/0.47 # Proof found!
% 0.18/0.47 # SZS status Theorem
% 0.18/0.47 # SZS output start CNFRefutation
% See solution above
% 0.18/0.47 # Parsed axioms : 45
% 0.18/0.47 # Removed by relevancy pruning/SinE : 0
% 0.18/0.47 # Initial clauses : 91
% 0.18/0.47 # Removed in clause preprocessing : 5
% 0.18/0.47 # Initial clauses in saturation : 86
% 0.18/0.47 # Processed clauses : 177
% 0.18/0.47 # ...of these trivial : 0
% 0.18/0.47 # ...subsumed : 11
% 0.18/0.47 # ...remaining for further processing : 166
% 0.18/0.47 # Other redundant clauses eliminated : 0
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 5
% 0.18/0.47 # Backward-rewritten : 2
% 0.18/0.47 # Generated clauses : 344
% 0.18/0.47 # ...of the previous two non-redundant : 313
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 3
% 0.18/0.47 # Paramodulations : 344
% 0.18/0.47 # Factorizations : 0
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 0
% 0.18/0.47 # Total rewrite steps : 52
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 159
% 0.18/0.47 # Positive orientable unit clauses : 26
% 0.18/0.47 # Positive unorientable unit clauses: 0
% 0.18/0.48 # Negative unit clauses : 8
% 0.18/0.48 # Non-unit-clauses : 125
% 0.18/0.48 # Current number of unprocessed clauses: 215
% 0.18/0.48 # ...number of literals in the above : 616
% 0.18/0.48 # Current number of archived formulas : 0
% 0.18/0.48 # Current number of archived clauses : 7
% 0.18/0.48 # Clause-clause subsumption calls (NU) : 3715
% 0.18/0.48 # Rec. Clause-clause subsumption calls : 2096
% 0.18/0.48 # Non-unit clause-clause subsumptions : 15
% 0.18/0.48 # Unit Clause-clause subsumption calls : 61
% 0.18/0.48 # Rewrite failures with RHS unbound : 0
% 0.18/0.48 # BW rewrite match attempts : 10
% 0.18/0.48 # BW rewrite match successes : 1
% 0.18/0.48 # Condensation attempts : 0
% 0.18/0.48 # Condensation successes : 0
% 0.18/0.48 # Termbank termtop insertions : 8046
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.016 s
% 0.18/0.48 # System time : 0.002 s
% 0.18/0.48 # Total time : 0.018 s
% 0.18/0.48 # Maximum resident set size: 1924 pages
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.068 s
% 0.18/0.48 # System time : 0.008 s
% 0.18/0.48 # Total time : 0.076 s
% 0.18/0.48 # Maximum resident set size: 1720 pages
% 0.18/0.48 % E---3.1 exiting
% 0.18/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------