TSTP Solution File: SEU388+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU388+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:31:55 EDT 2023
% Result : Theorem 12.62s 2.19s
% Output : CNFRefutation 12.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 127 ( 10 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 163 ( 62 ~; 64 |; 23 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 48 ( 0 sgn; 22 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fraenkel_a_2_0_yellow19,axiom,
! [X1,X2,X3] :
( ( ~ empty_carrier(X2)
& topological_space(X2)
& top_str(X2)
& element(X3,the_carrier(X2)) )
=> ( in(X1,a_2_0_yellow19(X2,X3))
<=> ? [X4] :
( point_neighbourhood(X4,X2,X3)
& X1 = X4 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.oEtSHeJ3yj/E---3.1_17103.p',fraenkel_a_2_0_yellow19) ).
fof(d1_yellow19,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> neighborhood_system(X1,X2) = a_2_0_yellow19(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.oEtSHeJ3yj/E---3.1_17103.p',d1_yellow19) ).
fof(t3_yellow19,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( in(X3,neighborhood_system(X1,X2))
<=> point_neighbourhood(X3,X1,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.oEtSHeJ3yj/E---3.1_17103.p',t3_yellow19) ).
fof(c_0_3,plain,
! [X1,X2,X3] :
( ( ~ empty_carrier(X2)
& topological_space(X2)
& top_str(X2)
& element(X3,the_carrier(X2)) )
=> ( in(X1,a_2_0_yellow19(X2,X3))
<=> ? [X4] :
( point_neighbourhood(X4,X2,X3)
& X1 = X4 ) ) ),
inference(fof_simplification,[status(thm)],[fraenkel_a_2_0_yellow19]) ).
fof(c_0_4,plain,
! [X165,X166,X167,X169] :
( ( point_neighbourhood(esk23_3(X165,X166,X167),X166,X167)
| ~ in(X165,a_2_0_yellow19(X166,X167))
| empty_carrier(X166)
| ~ topological_space(X166)
| ~ top_str(X166)
| ~ element(X167,the_carrier(X166)) )
& ( X165 = esk23_3(X165,X166,X167)
| ~ in(X165,a_2_0_yellow19(X166,X167))
| empty_carrier(X166)
| ~ topological_space(X166)
| ~ top_str(X166)
| ~ element(X167,the_carrier(X166)) )
& ( ~ point_neighbourhood(X169,X166,X167)
| X165 != X169
| in(X165,a_2_0_yellow19(X166,X167))
| empty_carrier(X166)
| ~ topological_space(X166)
| ~ top_str(X166)
| ~ element(X167,the_carrier(X166)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
fof(c_0_5,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> neighborhood_system(X1,X2) = a_2_0_yellow19(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[d1_yellow19]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( in(X3,neighborhood_system(X1,X2))
<=> point_neighbourhood(X3,X1,X2) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t3_yellow19])]) ).
cnf(c_0_7,plain,
( in(X4,a_2_0_yellow19(X2,X3))
| empty_carrier(X2)
| ~ point_neighbourhood(X1,X2,X3)
| X4 != X1
| ~ topological_space(X2)
| ~ top_str(X2)
| ~ element(X3,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,plain,
! [X64,X65] :
( empty_carrier(X64)
| ~ topological_space(X64)
| ~ top_str(X64)
| ~ element(X65,the_carrier(X64))
| neighborhood_system(X64,X65) = a_2_0_yellow19(X64,X65) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,negated_conjecture,
( ~ empty_carrier(esk1_0)
& topological_space(esk1_0)
& top_str(esk1_0)
& element(esk2_0,the_carrier(esk1_0))
& ( ~ in(esk3_0,neighborhood_system(esk1_0,esk2_0))
| ~ point_neighbourhood(esk3_0,esk1_0,esk2_0) )
& ( in(esk3_0,neighborhood_system(esk1_0,esk2_0))
| point_neighbourhood(esk3_0,esk1_0,esk2_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_10,plain,
( empty_carrier(X1)
| in(X2,a_2_0_yellow19(X1,X3))
| ~ point_neighbourhood(X2,X1,X3)
| ~ top_str(X1)
| ~ topological_space(X1)
| ~ element(X3,the_carrier(X1)) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( empty_carrier(X1)
| neighborhood_system(X1,X2) = a_2_0_yellow19(X1,X2)
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ element(X2,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( point_neighbourhood(esk23_3(X1,X2,X3),X2,X3)
| empty_carrier(X2)
| ~ in(X1,a_2_0_yellow19(X2,X3))
| ~ topological_space(X2)
| ~ top_str(X2)
| ~ element(X3,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,plain,
( X1 = esk23_3(X1,X2,X3)
| empty_carrier(X2)
| ~ in(X1,a_2_0_yellow19(X2,X3))
| ~ topological_space(X2)
| ~ top_str(X2)
| ~ element(X3,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
( ~ in(esk3_0,neighborhood_system(esk1_0,esk2_0))
| ~ point_neighbourhood(esk3_0,esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( empty_carrier(X1)
| in(X2,neighborhood_system(X1,X3))
| ~ point_neighbourhood(X2,X1,X3)
| ~ top_str(X1)
| ~ topological_space(X1)
| ~ element(X3,the_carrier(X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
topological_space(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
element(esk2_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
( point_neighbourhood(X1,X2,X3)
| empty_carrier(X2)
| ~ top_str(X2)
| ~ topological_space(X2)
| ~ element(X3,the_carrier(X2))
| ~ in(X1,a_2_0_yellow19(X2,X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( in(esk3_0,neighborhood_system(esk1_0,esk2_0))
| point_neighbourhood(esk3_0,esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
~ point_neighbourhood(esk3_0,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(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]),c_0_18])]),c_0_19]) ).
cnf(c_0_23,plain,
( point_neighbourhood(X1,X2,X3)
| empty_carrier(X2)
| ~ top_str(X2)
| ~ topological_space(X2)
| ~ element(X3,the_carrier(X2))
| ~ in(X1,neighborhood_system(X2,X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_11]) ).
cnf(c_0_24,negated_conjecture,
in(esk3_0,neighborhood_system(esk1_0,esk2_0)),
inference(sr,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
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(spm,[status(thm)],[c_0_23,c_0_24]),c_0_16]),c_0_17]),c_0_18])]),c_0_22]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SEU388+2 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n005.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 08:58:01 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.49 Running first-order model finding
% 0.15/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.oEtSHeJ3yj/E---3.1_17103.p
% 12.62/2.19 # Version: 3.1pre001
% 12.62/2.19 # Preprocessing class: FSLMSMSSSSSNFFN.
% 12.62/2.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.62/2.19 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 12.62/2.19 # Starting new_bool_3 with 600s (2) cores
% 12.62/2.19 # Starting new_bool_1 with 600s (2) cores
% 12.62/2.19 # Starting sh5l with 300s (1) cores
% 12.62/2.19 # new_bool_3 with pid 17183 completed with status 0
% 12.62/2.19 # Result found by new_bool_3
% 12.62/2.19 # Preprocessing class: FSLMSMSSSSSNFFN.
% 12.62/2.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.62/2.19 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 12.62/2.19 # Starting new_bool_3 with 600s (2) cores
% 12.62/2.19 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 12.62/2.19 # Search class: FGHSM-FSLM32-MFFFFFNN
% 12.62/2.19 # Scheduled 12 strats onto 2 cores with 600 seconds (600 total)
% 12.62/2.19 # Starting G-E--_303_C18_F1_URBAN_S0Y with 50s (1) cores
% 12.62/2.19 # Starting new_bool_3 with 61s (1) cores
% 12.62/2.19 # G-E--_303_C18_F1_URBAN_S0Y with pid 17188 completed with status 0
% 12.62/2.19 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 12.62/2.19 # Preprocessing class: FSLMSMSSSSSNFFN.
% 12.62/2.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.62/2.19 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 12.62/2.19 # Starting new_bool_3 with 600s (2) cores
% 12.62/2.19 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 12.62/2.19 # Search class: FGHSM-FSLM32-MFFFFFNN
% 12.62/2.19 # Scheduled 12 strats onto 2 cores with 600 seconds (600 total)
% 12.62/2.19 # Starting G-E--_303_C18_F1_URBAN_S0Y with 50s (1) cores
% 12.62/2.19 # Preprocessing time : 0.016 s
% 12.62/2.19
% 12.62/2.19 # Proof found!
% 12.62/2.19 # SZS status Theorem
% 12.62/2.19 # SZS output start CNFRefutation
% See solution above
% 12.62/2.19 # Parsed axioms : 885
% 12.62/2.19 # Removed by relevancy pruning/SinE : 690
% 12.62/2.19 # Initial clauses : 861
% 12.62/2.19 # Removed in clause preprocessing : 29
% 12.62/2.19 # Initial clauses in saturation : 832
% 12.62/2.19 # Processed clauses : 4221
% 12.62/2.19 # ...of these trivial : 58
% 12.62/2.19 # ...subsumed : 1895
% 12.62/2.19 # ...remaining for further processing : 2268
% 12.62/2.19 # Other redundant clauses eliminated : 198
% 12.62/2.19 # Clauses deleted for lack of memory : 0
% 12.62/2.19 # Backward-subsumed : 153
% 12.62/2.19 # Backward-rewritten : 20
% 12.62/2.19 # Generated clauses : 40369
% 12.62/2.19 # ...of the previous two non-redundant : 39120
% 12.62/2.19 # ...aggressively subsumed : 0
% 12.62/2.19 # Contextual simplify-reflections : 51
% 12.62/2.19 # Paramodulations : 40004
% 12.62/2.19 # Factorizations : 11
% 12.62/2.19 # NegExts : 0
% 12.62/2.19 # Equation resolutions : 361
% 12.62/2.19 # Total rewrite steps : 2099
% 12.62/2.19 # Propositional unsat checks : 0
% 12.62/2.19 # Propositional check models : 0
% 12.62/2.19 # Propositional check unsatisfiable : 0
% 12.62/2.19 # Propositional clauses : 0
% 12.62/2.19 # Propositional clauses after purity: 0
% 12.62/2.19 # Propositional unsat core size : 0
% 12.62/2.19 # Propositional preprocessing time : 0.000
% 12.62/2.19 # Propositional encoding time : 0.000
% 12.62/2.19 # Propositional solver time : 0.000
% 12.62/2.19 # Success case prop preproc time : 0.000
% 12.62/2.19 # Success case prop encoding time : 0.000
% 12.62/2.19 # Success case prop solver time : 0.000
% 12.62/2.19 # Current number of processed clauses : 2012
% 12.62/2.19 # Positive orientable unit clauses : 156
% 12.62/2.19 # Positive unorientable unit clauses: 1
% 12.62/2.19 # Negative unit clauses : 172
% 12.62/2.19 # Non-unit-clauses : 1683
% 12.62/2.19 # Current number of unprocessed clauses: 35329
% 12.62/2.19 # ...number of literals in the above : 176072
% 12.62/2.19 # Current number of archived formulas : 0
% 12.62/2.19 # Current number of archived clauses : 177
% 12.62/2.19 # Clause-clause subsumption calls (NU) : 782989
% 12.62/2.19 # Rec. Clause-clause subsumption calls : 175520
% 12.62/2.19 # Non-unit clause-clause subsumptions : 1535
% 12.62/2.19 # Unit Clause-clause subsumption calls : 44066
% 12.62/2.19 # Rewrite failures with RHS unbound : 0
% 12.62/2.19 # BW rewrite match attempts : 141
% 12.62/2.19 # BW rewrite match successes : 19
% 12.62/2.19 # Condensation attempts : 0
% 12.62/2.19 # Condensation successes : 0
% 12.62/2.19 # Termbank termtop insertions : 793636
% 12.62/2.19
% 12.62/2.19 # -------------------------------------------------
% 12.62/2.19 # User time : 1.616 s
% 12.62/2.19 # System time : 0.043 s
% 12.62/2.19 # Total time : 1.660 s
% 12.62/2.19 # Maximum resident set size: 4928 pages
% 12.62/2.19
% 12.62/2.19 # -------------------------------------------------
% 12.62/2.19 # User time : 3.269 s
% 12.62/2.19 # System time : 0.048 s
% 12.62/2.19 # Total time : 3.317 s
% 12.62/2.19 # Maximum resident set size: 2944 pages
% 12.62/2.19 % E---3.1 exiting
%------------------------------------------------------------------------------