TSTP Solution File: SEU388+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU388+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n003.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:36 EDT 2022
% Result : Theorem 0.44s 25.62s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 8 unt; 0 def)
% Number of atoms : 110 ( 8 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 141 ( 55 ~; 59 |; 17 &)
% ( 3 <=>; 7 =>; 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 : 39 ( 0 sgn 17 !; 1 ?)
% 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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_yellow19) ).
fof(c_0_3,plain,
! [X5,X6,X7,X9] :
( ( point_neighbourhood(esk23_3(X5,X6,X7),X6,X7)
| ~ in(X5,a_2_0_yellow19(X6,X7))
| empty_carrier(X6)
| ~ topological_space(X6)
| ~ top_str(X6)
| ~ element(X7,the_carrier(X6)) )
& ( X5 = esk23_3(X5,X6,X7)
| ~ in(X5,a_2_0_yellow19(X6,X7))
| empty_carrier(X6)
| ~ topological_space(X6)
| ~ top_str(X6)
| ~ element(X7,the_carrier(X6)) )
& ( ~ point_neighbourhood(X9,X6,X7)
| X5 != X9
| in(X5,a_2_0_yellow19(X6,X7))
| empty_carrier(X6)
| ~ topological_space(X6)
| ~ top_str(X6)
| ~ element(X7,the_carrier(X6)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[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)],[fraenkel_a_2_0_yellow19])])])])])])])]) ).
cnf(c_0_4,plain,
( empty_carrier(X2)
| point_neighbourhood(esk23_3(X3,X2,X1),X2,X1)
| ~ element(X1,the_carrier(X2))
| ~ top_str(X2)
| ~ topological_space(X2)
| ~ in(X3,a_2_0_yellow19(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,plain,
( empty_carrier(X2)
| X3 = esk23_3(X3,X2,X1)
| ~ element(X1,the_carrier(X2))
| ~ top_str(X2)
| ~ topological_space(X2)
| ~ in(X3,a_2_0_yellow19(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
! [X3,X4] :
( empty_carrier(X3)
| ~ topological_space(X3)
| ~ top_str(X3)
| ~ element(X4,the_carrier(X3))
| neighborhood_system(X3,X4) = a_2_0_yellow19(X3,X4) ),
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_yellow19])])])])])]) ).
fof(c_0_7,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(assume_negation,[status(cth)],[t3_yellow19]) ).
cnf(c_0_8,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_4,c_0_5]) ).
cnf(c_0_9,plain,
( neighborhood_system(X1,X2) = a_2_0_yellow19(X1,X2)
| empty_carrier(X1)
| ~ element(X2,the_carrier(X1))
| ~ top_str(X1)
| ~ topological_space(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,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(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_7])])])])])]) ).
cnf(c_0_11,plain,
( empty_carrier(X2)
| in(X3,a_2_0_yellow19(X2,X1))
| ~ element(X1,the_carrier(X2))
| ~ top_str(X2)
| ~ topological_space(X2)
| X3 != X4
| ~ point_neighbourhood(X4,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,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_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( point_neighbourhood(esk3_0,esk1_0,esk2_0)
| in(esk3_0,neighborhood_system(esk1_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
topological_space(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
element(esk2_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,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_11]) ).
cnf(c_0_19,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_12,c_0_13]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
in(esk3_0,a_2_0_yellow19(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_18,c_0_19]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( ~ point_neighbourhood(esk3_0,esk1_0,esk2_0)
| ~ in(esk3_0,neighborhood_system(esk1_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
in(esk3_0,neighborhood_system(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_20,c_0_9]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_19])]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU388+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n003.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 21:36:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/23.48 eprover: CPU time limit exceeded, terminating
% 0.43/23.48 eprover: CPU time limit exceeded, terminating
% 0.43/23.49 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.43/23.49
% 0.44/25.62 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.44/25.62
% 0.44/25.62 # Failure: Resource limit exceeded (time)
% 0.44/25.62 # OLD status Res
% 0.44/25.62 # Preprocessing time : 0.176 s
% 0.44/25.62 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.44/25.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.44/25.62 # Preprocessing time : 0.079 s
% 0.44/25.62
% 0.44/25.62 # Proof found!
% 0.44/25.62 # SZS status Theorem
% 0.44/25.62 # SZS output start CNFRefutation
% See solution above
% 0.44/25.62 # Proof object total steps : 24
% 0.44/25.62 # Proof object clause steps : 17
% 0.44/25.62 # Proof object formula steps : 7
% 0.44/25.62 # Proof object conjectures : 13
% 0.44/25.62 # Proof object clause conjectures : 10
% 0.44/25.62 # Proof object formula conjectures : 3
% 0.44/25.62 # Proof object initial clauses used : 10
% 0.44/25.62 # Proof object initial formulas used : 3
% 0.44/25.62 # Proof object generating inferences : 5
% 0.44/25.62 # Proof object simplifying inferences : 20
% 0.44/25.62 # Training examples: 0 positive, 0 negative
% 0.44/25.62 # Parsed axioms : 885
% 0.44/25.62 # Removed by relevancy pruning/SinE : 784
% 0.44/25.62 # Initial clauses : 420
% 0.44/25.62 # Removed in clause preprocessing : 1
% 0.44/25.62 # Initial clauses in saturation : 419
% 0.44/25.62 # Processed clauses : 4400
% 0.44/25.62 # ...of these trivial : 25
% 0.44/25.62 # ...subsumed : 2056
% 0.44/25.62 # ...remaining for further processing : 2318
% 0.44/25.62 # Other redundant clauses eliminated : 57
% 0.44/25.62 # Clauses deleted for lack of memory : 0
% 0.44/25.62 # Backward-subsumed : 151
% 0.44/25.62 # Backward-rewritten : 718
% 0.44/25.62 # Generated clauses : 25992
% 0.44/25.62 # ...of the previous two non-trivial : 25434
% 0.44/25.62 # Contextual simplify-reflections : 2860
% 0.44/25.62 # Paramodulations : 25676
% 0.44/25.62 # Factorizations : 2
% 0.44/25.62 # Equation resolutions : 124
% 0.44/25.62 # Current number of processed clauses : 1390
% 0.44/25.62 # Positive orientable unit clauses : 101
% 0.44/25.62 # Positive unorientable unit clauses: 0
% 0.44/25.62 # Negative unit clauses : 60
% 0.44/25.62 # Non-unit-clauses : 1229
% 0.44/25.62 # Current number of unprocessed clauses: 14311
% 0.44/25.62 # ...number of literals in the above : 99619
% 0.44/25.62 # Current number of archived formulas : 0
% 0.44/25.62 # Current number of archived clauses : 873
% 0.44/25.62 # Clause-clause subsumption calls (NU) : 1351505
% 0.44/25.62 # Rec. Clause-clause subsumption calls : 147534
% 0.44/25.62 # Non-unit clause-clause subsumptions : 4729
% 0.44/25.62 # Unit Clause-clause subsumption calls : 45998
% 0.44/25.62 # Rewrite failures with RHS unbound : 0
% 0.44/25.62 # BW rewrite match attempts : 126
% 0.44/25.62 # BW rewrite match successes : 60
% 0.44/25.62 # Condensation attempts : 0
% 0.44/25.62 # Condensation successes : 0
% 0.44/25.62 # Termbank termtop insertions : 750164
% 0.44/25.62
% 0.44/25.62 # -------------------------------------------------
% 0.44/25.62 # User time : 1.566 s
% 0.44/25.62 # System time : 0.015 s
% 0.44/25.62 # Total time : 1.582 s
% 0.44/25.62 # Maximum resident set size: 28224 pages
%------------------------------------------------------------------------------