TSTP Solution File: SEU388+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU388+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:16 EDT 2023
% Result : Theorem 0.55s 0.63s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 8 unt; 0 def)
% Number of atoms : 120 ( 13 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 144 ( 53 ~; 54 |; 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 : 42 ( 0 sgn; 22 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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.OhP6pf0qZH/E---3.1_31521.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.OhP6pf0qZH/E---3.1_31521.p',t3_yellow19) ).
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.OhP6pf0qZH/E---3.1_31521.p',fraenkel_a_2_0_yellow19) ).
fof(c_0_3,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_4,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])]) ).
fof(c_0_5,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_6,plain,
! [X31,X32] :
( empty_carrier(X31)
| ~ topological_space(X31)
| ~ top_str(X31)
| ~ element(X32,the_carrier(X31))
| neighborhood_system(X31,X32) = a_2_0_yellow19(X31,X32) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_7,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_4])])]) ).
fof(c_0_8,plain,
! [X45,X46,X47,X49] :
( ( point_neighbourhood(esk10_3(X45,X46,X47),X46,X47)
| ~ in(X45,a_2_0_yellow19(X46,X47))
| empty_carrier(X46)
| ~ topological_space(X46)
| ~ top_str(X46)
| ~ element(X47,the_carrier(X46)) )
& ( X45 = esk10_3(X45,X46,X47)
| ~ in(X45,a_2_0_yellow19(X46,X47))
| empty_carrier(X46)
| ~ topological_space(X46)
| ~ top_str(X46)
| ~ element(X47,the_carrier(X46)) )
& ( ~ point_neighbourhood(X49,X46,X47)
| X45 != X49
| in(X45,a_2_0_yellow19(X46,X47))
| empty_carrier(X46)
| ~ topological_space(X46)
| ~ top_str(X46)
| ~ element(X47,the_carrier(X46)) ) ),
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_5])])])])]) ).
cnf(c_0_9,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_6]) ).
cnf(c_0_10,negated_conjecture,
element(esk2_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
topological_space(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( point_neighbourhood(esk10_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_8]) ).
cnf(c_0_15,negated_conjecture,
a_2_0_yellow19(esk1_0,esk2_0) = neighborhood_system(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]),c_0_13]) ).
cnf(c_0_16,plain,
( X1 = esk10_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_8]) ).
cnf(c_0_17,negated_conjecture,
( point_neighbourhood(esk10_3(X1,esk1_0,esk2_0),esk1_0,esk2_0)
| ~ in(X1,neighborhood_system(esk1_0,esk2_0)) ),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_10]),c_0_11]),c_0_12])]),c_0_13]),c_0_15]) ).
cnf(c_0_18,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_7]) ).
cnf(c_0_19,negated_conjecture,
( esk10_3(X1,esk1_0,esk2_0) = X1
| ~ in(X1,neighborhood_system(esk1_0,esk2_0)) ),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_10]),c_0_11]),c_0_12])]),c_0_13]),c_0_15]) ).
cnf(c_0_20,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_8]) ).
cnf(c_0_21,negated_conjecture,
( point_neighbourhood(esk10_3(esk3_0,esk1_0,esk2_0),esk1_0,esk2_0)
| point_neighbourhood(esk3_0,esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( esk10_3(esk3_0,esk1_0,esk2_0) = esk3_0
| point_neighbourhood(esk3_0,esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_23,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_20]) ).
cnf(c_0_24,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_7]) ).
cnf(c_0_25,negated_conjecture,
point_neighbourhood(esk3_0,esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( in(X1,neighborhood_system(esk1_0,esk2_0))
| ~ point_neighbourhood(X1,esk1_0,esk2_0) ),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_10]),c_0_11]),c_0_12])]),c_0_13]),c_0_15]) ).
cnf(c_0_27,negated_conjecture,
~ in(esk3_0,neighborhood_system(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_25]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.16 % Problem : SEU388+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.17 % Command : run_E %s %d THM
% 0.16/0.39 % Computer : n022.cluster.edu
% 0.16/0.39 % Model : x86_64 x86_64
% 0.16/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.39 % Memory : 8042.1875MB
% 0.16/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.39 % CPULimit : 2400
% 0.16/0.39 % WCLimit : 300
% 0.16/0.39 % DateTime : Mon Oct 2 09:22:39 EDT 2023
% 0.16/0.39 % CPUTime :
% 0.24/0.55 Running first-order theorem proving
% 0.24/0.55 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.OhP6pf0qZH/E---3.1_31521.p
% 0.55/0.63 # Version: 3.1pre001
% 0.55/0.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.55/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.55/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.55/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.55/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.55/0.63 # Starting sh5l with 300s (1) cores
% 0.55/0.63 # new_bool_3 with pid 31600 completed with status 0
% 0.55/0.63 # Result found by new_bool_3
% 0.55/0.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.55/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.55/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.55/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.55/0.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.55/0.63 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.55/0.63 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.55/0.63 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.55/0.63 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 31603 completed with status 0
% 0.55/0.63 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 0.55/0.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.55/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.55/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.55/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.55/0.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.55/0.63 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.55/0.63 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.55/0.63 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.55/0.63 # Preprocessing time : 0.004 s
% 0.55/0.63 # Presaturation interreduction done
% 0.55/0.63
% 0.55/0.63 # Proof found!
% 0.55/0.63 # SZS status Theorem
% 0.55/0.63 # SZS output start CNFRefutation
% See solution above
% 0.55/0.63 # Parsed axioms : 119
% 0.55/0.63 # Removed by relevancy pruning/SinE : 69
% 0.55/0.63 # Initial clauses : 119
% 0.55/0.63 # Removed in clause preprocessing : 4
% 0.55/0.63 # Initial clauses in saturation : 115
% 0.55/0.63 # Processed clauses : 352
% 0.55/0.63 # ...of these trivial : 5
% 0.55/0.63 # ...subsumed : 73
% 0.55/0.63 # ...remaining for further processing : 273
% 0.55/0.63 # Other redundant clauses eliminated : 1
% 0.55/0.63 # Clauses deleted for lack of memory : 0
% 0.55/0.63 # Backward-subsumed : 4
% 0.55/0.63 # Backward-rewritten : 8
% 0.55/0.63 # Generated clauses : 585
% 0.55/0.63 # ...of the previous two non-redundant : 552
% 0.55/0.63 # ...aggressively subsumed : 0
% 0.55/0.63 # Contextual simplify-reflections : 0
% 0.55/0.63 # Paramodulations : 582
% 0.55/0.63 # Factorizations : 2
% 0.55/0.63 # NegExts : 0
% 0.55/0.63 # Equation resolutions : 1
% 0.55/0.63 # Total rewrite steps : 127
% 0.55/0.63 # Propositional unsat checks : 0
% 0.55/0.63 # Propositional check models : 0
% 0.55/0.63 # Propositional check unsatisfiable : 0
% 0.55/0.63 # Propositional clauses : 0
% 0.55/0.63 # Propositional clauses after purity: 0
% 0.55/0.63 # Propositional unsat core size : 0
% 0.55/0.63 # Propositional preprocessing time : 0.000
% 0.55/0.63 # Propositional encoding time : 0.000
% 0.55/0.63 # Propositional solver time : 0.000
% 0.55/0.63 # Success case prop preproc time : 0.000
% 0.55/0.63 # Success case prop encoding time : 0.000
% 0.55/0.63 # Success case prop solver time : 0.000
% 0.55/0.63 # Current number of processed clauses : 152
% 0.55/0.63 # Positive orientable unit clauses : 54
% 0.55/0.63 # Positive unorientable unit clauses: 1
% 0.55/0.63 # Negative unit clauses : 12
% 0.55/0.63 # Non-unit-clauses : 85
% 0.55/0.63 # Current number of unprocessed clauses: 413
% 0.55/0.63 # ...number of literals in the above : 1654
% 0.55/0.63 # Current number of archived formulas : 0
% 0.55/0.63 # Current number of archived clauses : 120
% 0.55/0.63 # Clause-clause subsumption calls (NU) : 1087
% 0.55/0.63 # Rec. Clause-clause subsumption calls : 572
% 0.55/0.63 # Non-unit clause-clause subsumptions : 51
% 0.55/0.63 # Unit Clause-clause subsumption calls : 187
% 0.55/0.63 # Rewrite failures with RHS unbound : 22
% 0.55/0.63 # BW rewrite match attempts : 9
% 0.55/0.63 # BW rewrite match successes : 9
% 0.55/0.63 # Condensation attempts : 0
% 0.55/0.63 # Condensation successes : 0
% 0.55/0.63 # Termbank termtop insertions : 13628
% 0.55/0.63
% 0.55/0.63 # -------------------------------------------------
% 0.55/0.63 # User time : 0.016 s
% 0.55/0.63 # System time : 0.005 s
% 0.55/0.63 # Total time : 0.021 s
% 0.55/0.63 # Maximum resident set size: 2148 pages
% 0.55/0.63
% 0.55/0.63 # -------------------------------------------------
% 0.55/0.63 # User time : 0.018 s
% 0.55/0.63 # System time : 0.007 s
% 0.55/0.63 # Total time : 0.026 s
% 0.55/0.63 # Maximum resident set size: 1808 pages
% 0.55/0.63 % E---3.1 exiting
% 0.55/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------