TSTP Solution File: TOP007-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : TOP007-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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 : 300s
% DateTime : Fri Sep 1 05:57:13 EDT 2023
% Result : Satisfiable 12.23s 2.66s
% Output : Model 12.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : TOP007-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 23:18:17 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 12.23/2.66 % SZS status Started for theBenchmark.p
% 12.23/2.66 % SZS status Satisfiable for theBenchmark.p
% 12.23/2.66
% 12.23/2.66 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 12.23/2.66
% 12.23/2.66 ------ iProver source info
% 12.23/2.66
% 12.23/2.66 git: date: 2023-05-31 18:12:56 +0000
% 12.23/2.66 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 12.23/2.66 git: non_committed_changes: false
% 12.23/2.66 git: last_make_outside_of_git: false
% 12.23/2.66
% 12.23/2.66 ------ Parsing...successful
% 12.23/2.66
% 12.23/2.66
% 12.23/2.66
% 12.23/2.66 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 12.23/2.66
% 12.23/2.66 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 12.23/2.66 ------ Proving...
% 12.23/2.66 ------ Problem Properties
% 12.23/2.66
% 12.23/2.66
% 12.23/2.66 clauses 100
% 12.23/2.66 conjectures 5
% 12.23/2.66 EPR 25
% 12.23/2.66 Horn 78
% 12.23/2.66 unary 3
% 12.23/2.66 binary 48
% 12.23/2.66 lits 302
% 12.23/2.66 lits eq 0
% 12.23/2.66 fd_pure 0
% 12.23/2.66 fd_pseudo 0
% 12.23/2.66 fd_cond 0
% 12.23/2.66 fd_pseudo_cond 0
% 12.23/2.66 AC symbols 0
% 12.23/2.66
% 12.23/2.66 ------ Input Options Time Limit: Unbounded
% 12.23/2.66
% 12.23/2.66
% 12.23/2.66 ------
% 12.23/2.66 Current options:
% 12.23/2.66 ------
% 12.23/2.66
% 12.23/2.66
% 12.23/2.66
% 12.23/2.66
% 12.23/2.66 ------ Proving...
% 12.23/2.66
% 12.23/2.66
% 12.23/2.66 % SZS status Satisfiable for theBenchmark.p
% 12.23/2.66
% 12.23/2.66 ------ Building Model...Done
% 12.23/2.66
% 12.23/2.66 %------ The model is defined over ground terms (initial term algebra).
% 12.23/2.66 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 12.23/2.66 %------ where \phi is a formula over the term algebra.
% 12.23/2.66 %------ If we have equality in the problem then it is also defined as a predicate above,
% 12.23/2.66 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 12.23/2.66 %------ See help for --sat_out_model for different model outputs.
% 12.23/2.66 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 12.23/2.66 %------ where the first argument stands for the sort ($i in the unsorted case)
% 12.23/2.66 % SZS output start Model for theBenchmark.p
% 12.23/2.66
% 12.23/2.66 %------ Negative definition of topological_space
% 12.23/2.66 fof(lit_def,axiom,
% 12.23/2.66 (! [X0_13,X0_14] :
% 12.23/2.66 ( ~(topological_space(X0_13,X0_14)) <=>
% 12.23/2.66 $false
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 ).
% 12.23/2.66
% 12.23/2.66 %------ Positive definition of subset_sets
% 12.23/2.66 fof(lit_def,axiom,
% 12.23/2.66 (! [X0_13,X1_13] :
% 12.23/2.66 ( subset_sets(X0_13,X1_13) <=>
% 12.23/2.66 (
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=a & X1_13=cx )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 |
% 12.23/2.66 ? [X0_14] :
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=f30(f11(X0_14,a)) & X1_13=a )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 ).
% 12.23/2.66
% 12.23/2.66 %------ Positive definition of element_of_set
% 12.23/2.66 fof(lit_def,axiom,
% 12.23/2.66 (! [X0_15,X0_13] :
% 12.23/2.66 ( element_of_set(X0_15,X0_13) <=>
% 12.23/2.66 (
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=closure(a,cx,ct) )
% 12.23/2.66 &
% 12.23/2.66 ! [X0_14,X1_13] : ( X0_15!=f7(X1_13,X0_14) )
% 12.23/2.66 &
% 12.23/2.66 ( X0_15!=f11(X0_14,closure(a,cx,ct)) )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 |
% 12.23/2.66 ? [X1_13,X0_14,X2_13] :
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=intersection_of_members(subspace_topology(X1_13,X0_14,X2_13)) )
% 12.23/2.66 &
% 12.23/2.66 ! [X1_14] : ( X0_14!=X0_14 | X0_15!=f11(X1_14,intersection_of_members(subspace_topology(X1_13,X0_14,X2_13))) | X1_13!=X1_13 | X2_13!=X2_13 )
% 12.23/2.66 &
% 12.23/2.66 ! [X3_13] : ( X0_15!=f7(X3_13,X1_14) )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 |
% 12.23/2.66 ? [X1_13,X0_14] :
% 12.23/2.66 (
% 12.23/2.66 ( X0_15=f7(X1_13,X0_14) & X0_13=closure(a,cx,ct) )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 |
% 12.23/2.66 ? [X1_13,X0_14,X2_13,X1_14,X3_13] :
% 12.23/2.66 (
% 12.23/2.66 ( X0_15=f7(X1_13,X0_14) & X0_13=intersection_of_members(subspace_topology(X2_13,X1_14,X3_13)) )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 |
% 12.23/2.66 ? [X0_14] :
% 12.23/2.66 (
% 12.23/2.66 ( X0_15=f11(X0_14,closure(a,cx,ct)) & X0_13=closure(a,cx,ct) )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 |
% 12.23/2.66 ? [X0_14,X1_13,X1_14,X2_13] :
% 12.23/2.66 (
% 12.23/2.66 ( X0_15=f11(X0_14,intersection_of_members(subspace_topology(X1_13,X1_14,X2_13))) & X0_13=intersection_of_members(subspace_topology(X1_13,X1_14,X2_13)) )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 ).
% 12.23/2.66
% 12.23/2.66 %------ Positive definition of open
% 12.23/2.66 fof(lit_def,axiom,
% 12.23/2.66 (! [X0_13,X1_13,X0_14] :
% 12.23/2.66 ( open(X0_13,X1_13,X0_14) <=>
% 12.23/2.66 (
% 12.23/2.66 (
% 12.23/2.66 ( X1_13=cx & X0_14=ct )
% 12.23/2.66 &
% 12.23/2.66 ( X0_13!=a )
% 12.23/2.66 &
% 12.23/2.66 ! [X1_14] : ( X0_13!=intersection_of_members(X1_14) )
% 12.23/2.66 &
% 12.23/2.66 ( X0_13!=closure(a,cx,ct) )
% 12.23/2.66 &
% 12.23/2.66 ( X0_13!=f30(f11(X1_14,a)) )
% 12.23/2.66 &
% 12.23/2.66 ( X0_13!=relative_complement_sets(X0_13,cx) )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 ).
% 12.23/2.66
% 12.23/2.66 %------ Negative definition of element_of_collection
% 12.23/2.66 fof(lit_def,axiom,
% 12.23/2.66 (! [X0_13,X0_14] :
% 12.23/2.66 ( ~(element_of_collection(X0_13,X0_14)) <=>
% 12.23/2.66 (
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=a & X0_14=ct )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 |
% 12.23/2.66 ? [X1_14] :
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=intersection_of_members(X1_14) & X0_14=ct )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 |
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=closure(a,cx,ct) )
% 12.23/2.66 &
% 12.23/2.66 ( X0_14!=ct )
% 12.23/2.66 &
% 12.23/2.66 ( X0_14!=top_of_basis(X0_14) )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 |
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=closure(a,cx,ct) & X0_14=ct )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 |
% 12.23/2.66 ? [X1_14] :
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=closure(a,cx,ct) & X0_14=top_of_basis(X1_14) )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 |
% 12.23/2.66 ? [X1_14] :
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=f30(f11(X1_14,a)) & X0_14=ct )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 |
% 12.23/2.66 ? [X1_13,X1_14,X2_13] :
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=intersection_of_members(subspace_topology(X1_13,X1_14,X2_13)) )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 |
% 12.23/2.66 ? [X1_13,X1_14,X2_13,X2_14] :
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=intersection_of_members(subspace_topology(X1_13,X1_14,X2_13)) & X0_14=top_of_basis(X2_14) )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 |
% 12.23/2.66 ? [X1_13] :
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=relative_complement_sets(X1_13,cx) & X0_14=ct )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 |
% 12.23/2.66 ? [X1_13,X1_14,X2_13,X2_14] :
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=f2(subspace_topology(X1_13,X1_14,X2_13),f11(X2_14,intersection_of_members(subspace_topology(X1_13,X1_14,X2_13)))) & X0_14=subspace_topology(X1_13,X1_14,X2_13) )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 |
% 12.23/2.66 ? [X1_13,X1_14,X2_13,X0_15] :
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=f2(subspace_topology(X1_13,X1_14,X2_13),X0_15) & X0_14=subspace_topology(X1_13,X1_14,X2_13) )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 |
% 12.23/2.66 ? [X1_13,X1_14,X2_13,X3_13,X2_14] :
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=f2(subspace_topology(X1_13,X1_14,X2_13),f7(X3_13,X2_14)) & X0_14=subspace_topology(X1_13,X1_14,X2_13) )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 |
% 12.23/2.66 ? [X1_13,X1_14,X2_13] :
% 12.23/2.66 (
% 12.23/2.66 ( X0_14=subspace_topology(X1_13,X1_14,X2_13) )
% 12.23/2.66 &
% 12.23/2.66 ! [X0_15] : ( X0_13!=f2(subspace_topology(X1_13,X1_14,X2_13),X0_15) | X1_13!=X1_13 | X1_14!=X1_14 | X2_13!=X2_13 )
% 12.23/2.66 &
% 12.23/2.66 ! [X1_15] : ( X0_13!=f2(subspace_topology(X1_13,X1_14,X2_13),X1_15) | X1_13!=X1_13 | X1_14!=X1_14 | X2_13!=X2_13 )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 ).
% 12.23/2.66
% 12.23/2.66 %------ Positive definition of equal_sets
% 12.23/2.66 fof(lit_def,axiom,
% 12.23/2.66 (! [X0_13,X1_13] :
% 12.23/2.66 ( equal_sets(X0_13,X1_13) <=>
% 12.23/2.66 (
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=union_of_members(ct) & X1_13=cx )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 ).
% 12.23/2.66
% 12.23/2.66 %------ Positive definition of subset_collections
% 12.23/2.66 fof(lit_def,axiom,
% 12.23/2.66 (! [X0_14,X1_14] :
% 12.23/2.66 ( subset_collections(X0_14,X1_14) <=>
% 12.23/2.66 $false
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 ).
% 12.23/2.66
% 12.23/2.66 %------ Positive definition of closed
% 12.23/2.66 fof(lit_def,axiom,
% 12.23/2.66 (! [X0_13,X1_13,X0_14] :
% 12.23/2.66 ( closed(X0_13,X1_13,X0_14) <=>
% 12.23/2.66 $false
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 ).
% 12.23/2.66
% 12.23/2.66 %------ Positive definition of basis
% 12.23/2.66 fof(lit_def,axiom,
% 12.23/2.66 (! [X0_13,X0_14] :
% 12.23/2.66 ( basis(X0_13,X0_14) <=>
% 12.23/2.66 (
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=cx & X0_14=ct )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 ).
% 12.23/2.66
% 12.23/2.66 %------ Negative definition of limit_point
% 12.23/2.66 fof(lit_def,axiom,
% 12.23/2.66 (! [X0_15,X0_13,X1_13,X0_14] :
% 12.23/2.66 ( ~(limit_point(X0_15,X0_13,X1_13,X0_14)) <=>
% 12.23/2.66 $false
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 ).
% 12.23/2.66
% 12.23/2.66 %------ Positive definition of hausdorff
% 12.23/2.66 fof(lit_def,axiom,
% 12.23/2.66 (! [X0_13,X0_14] :
% 12.23/2.66 ( hausdorff(X0_13,X0_14) <=>
% 12.23/2.66 (
% 12.23/2.66 (
% 12.23/2.66 ( X0_13=cx & X0_14=ct )
% 12.23/2.66 )
% 12.23/2.66
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 ).
% 12.23/2.66
% 12.23/2.66 %------ Negative definition of compact_space
% 12.23/2.66 fof(lit_def,axiom,
% 12.23/2.66 (! [X0_13,X0_14] :
% 12.23/2.66 ( ~(compact_space(X0_13,X0_14)) <=>
% 12.23/2.66 $false
% 12.23/2.66 )
% 12.23/2.66 )
% 12.23/2.66 ).
% 12.23/2.66 % SZS output end Model for theBenchmark.p
% 12.23/2.67
%------------------------------------------------------------------------------