TSTP Solution File: TOP012-1 by iProver-SAT---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.8
% Problem : TOP012-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n008.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:50 EDT 2023
% Result : Satisfiable 3.42s 1.16s
% Output : Model 3.42s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of topological_space
fof(lit_def,axiom,
! [X0,X1] :
( topological_space(X0,X1)
<=> ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1 ) ) ).
%------ Positive definition of closed
fof(lit_def_001,axiom,
! [X0,X1,X2] :
( closed(X0,X1,X2)
<=> ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 != iProver_Domain_i_1 ) ) ).
%------ Negative definition of subset_sets
fof(lit_def_002,axiom,
! [X0,X1] :
( ~ subset_sets(X0,X1)
<=> ( ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1 )
| ( X1 = iProver_Domain_i_1
& X0 != iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of element_of_collection
fof(lit_def_003,axiom,
! [X0,X1] :
( element_of_collection(X0,X1)
<=> ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1 ) ) ).
%------ Negative definition of element_of_set
fof(lit_def_004,axiom,
! [X0,X1] :
( ~ element_of_set(X0,X1)
<=> ( ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1 )
| X1 = iProver_Domain_i_1 ) ) ).
%------ Negative definition of equal_sets
fof(lit_def_005,axiom,
! [X0,X1] :
( ~ equal_sets(X0,X1)
<=> ( X1 = iProver_Domain_i_1
& X0 != iProver_Domain_i_1 ) ) ).
%------ Positive definition of subset_collections
fof(lit_def_006,axiom,
! [X0,X1] :
( subset_collections(X0,X1)
<=> ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1 ) ) ).
%------ Positive definition of open
fof(lit_def_007,axiom,
! [X0,X1,X2] :
( open(X0,X1,X2)
<=> ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 != iProver_Domain_i_1 ) ) ).
%------ Negative definition of basis
fof(lit_def_008,axiom,
! [X0,X1] :
( ~ basis(X0,X1)
<=> $false ) ).
%------ Positive definition of neighborhood
fof(lit_def_009,axiom,
! [X0,X1,X2,X3] :
( neighborhood(X0,X1,X2,X3)
<=> $false ) ).
%------ Positive definition of limit_point
fof(lit_def_010,axiom,
! [X0,X1,X2,X3] :
( limit_point(X0,X1,X2,X3)
<=> $false ) ).
%------ Positive definition of eq_p
fof(lit_def_011,axiom,
! [X0,X1] :
( eq_p(X0,X1)
<=> $true ) ).
%------ Positive definition of hausdorff
fof(lit_def_012,axiom,
! [X0,X1] :
( hausdorff(X0,X1)
<=> ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1 ) ) ).
%------ Positive definition of disjoint_s
fof(lit_def_013,axiom,
! [X0,X1] :
( disjoint_s(X0,X1)
<=> $false ) ).
%------ Positive definition of separation
fof(lit_def_014,axiom,
! [X0,X1,X2,X3] :
( separation(X0,X1,X2,X3)
<=> $false ) ).
%------ Positive definition of open_covering
fof(lit_def_015,axiom,
! [X0,X1,X2] :
( open_covering(X0,X1,X2)
<=> ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 != iProver_Domain_i_1 ) ) ).
%------ Positive definition of compact_space
fof(lit_def_016,axiom,
! [X0,X1] :
( compact_space(X0,X1)
<=> $false ) ).
%------ Positive definition of finite
fof(lit_def_017,axiom,
! [X0] :
( finite(X0)
<=> $false ) ).
%------ Positive definition of sP0_iProver_split
fof(lit_def_018,axiom,
( sP0_iProver_split
<=> $true ) ).
%------ Positive definition of iProver_Flat_cx
fof(lit_def_019,axiom,
! [X0] :
( iProver_Flat_cx(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_ct
fof(lit_def_020,axiom,
! [X0] :
( iProver_Flat_ct(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_empty_set
fof(lit_def_021,axiom,
! [X0] :
( iProver_Flat_empty_set(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_cy1
fof(lit_def_022,axiom,
! [X0] :
( iProver_Flat_cy1(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_f
fof(lit_def_023,axiom,
! [X0] :
( iProver_Flat_f(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_union_of_members
fof(lit_def_024,axiom,
! [X0,X1] :
( iProver_Flat_union_of_members(X0,X1)
<=> ( ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_intersection_of_members
fof(lit_def_025,axiom,
! [X0,X1] :
( iProver_Flat_intersection_of_members(X0,X1)
<=> ( ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_cy2
fof(lit_def_026,axiom,
! [X0] :
( iProver_Flat_cy2(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Negative definition of iProver_Flat_union_of_sets
fof(lit_def_027,axiom,
! [X0,X1,X2] :
( ~ iProver_Flat_union_of_sets(X0,X1,X2)
<=> ( X0 = iProver_Domain_i_1
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_f1
fof(lit_def_028,axiom,
! [X0,X1,X2] :
( iProver_Flat_f1(X0,X1,X2)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_f2
fof(lit_def_029,axiom,
! [X0,X1,X2] :
( iProver_Flat_f2(X0,X1,X2)
<=> ( ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_intersection_of_sets
fof(lit_def_030,axiom,
! [X0,X1,X2] :
( iProver_Flat_intersection_of_sets(X0,X1,X2)
<=> ( ( X0 = iProver_Domain_i_1
& ( X1 != iProver_Domain_i_1
| X2 != iProver_Domain_i_1 )
& X2 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_f3
fof(lit_def_031,axiom,
! [X0,X1,X2] :
( iProver_Flat_f3(X0,X1,X2)
<=> ( ( X0 = iProver_Domain_i_1
& X2 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1 ) ) ) ).
%------ Negative definition of iProver_Flat_f5
fof(lit_def_032,axiom,
! [X0,X1,X2] :
( ~ iProver_Flat_f5(X0,X1,X2)
<=> X0 != iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_f4
fof(lit_def_033,axiom,
! [X0,X1,X2] :
( iProver_Flat_f4(X0,X1,X2)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_relative_complement_sets
fof(lit_def_034,axiom,
! [X0,X1,X2] :
( iProver_Flat_relative_complement_sets(X0,X1,X2)
<=> ( ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_2
& X1 != iProver_Domain_i_1
& ( X1 != iProver_Domain_i_1
| X2 != iProver_Domain_i_1 )
& X2 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_2
& X2 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_f6
fof(lit_def_035,axiom,
! [X0,X1,X2,X3,X4,X5] :
( iProver_Flat_f6(X0,X1,X2,X3,X4,X5)
<=> ( ( X0 = iProver_Domain_i_1
& X2 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1 ) ) ) ).
%------ Negative definition of iProver_Flat_f7
fof(lit_def_036,axiom,
! [X0,X1,X2] :
( ~ iProver_Flat_f7(X0,X1,X2)
<=> ( X2 = iProver_Domain_i_1
& X0 != iProver_Domain_i_1 ) ) ).
%------ Negative definition of iProver_Flat_f8
fof(lit_def_037,axiom,
! [X0,X1,X2] :
( ~ iProver_Flat_f8(X0,X1,X2)
<=> ( X2 = iProver_Domain_i_1
& X0 != iProver_Domain_i_1 ) ) ).
%------ Negative definition of iProver_Flat_f9
fof(lit_def_038,axiom,
! [X0,X1,X2] :
( ~ iProver_Flat_f9(X0,X1,X2)
<=> ( X2 = iProver_Domain_i_1
& X0 != iProver_Domain_i_1 ) ) ).
%------ Negative definition of iProver_Flat_top_of_basis
fof(lit_def_039,axiom,
! [X0,X1] :
( ~ iProver_Flat_top_of_basis(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_f10
fof(lit_def_040,axiom,
! [X0,X1,X2,X3] :
( iProver_Flat_f10(X0,X1,X2,X3)
<=> ( ( X0 = iProver_Domain_i_1
& ( X1 != iProver_Domain_i_1
| X2 != iProver_Domain_i_1 )
& X2 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_f11
fof(lit_def_041,axiom,
! [X0,X1,X2] :
( iProver_Flat_f11(X0,X1,X2)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_subspace_topology
fof(lit_def_042,axiom,
! [X0,X1,X2,X3] :
( iProver_Flat_subspace_topology(X0,X1,X2,X3)
<=> ( ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1
& X3 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X3 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X3 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X3 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_f12
fof(lit_def_043,axiom,
! [X0,X1,X2,X3,X4] :
( iProver_Flat_f12(X0,X1,X2,X3,X4)
<=> ( ( X0 = iProver_Domain_i_1
& X4 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X4 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_interior
fof(lit_def_044,axiom,
! [X0,X1,X2,X3] :
( iProver_Flat_interior(X0,X1,X2,X3)
<=> ( ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1
& X2 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& ( X2 != iProver_Domain_i_1
| X3 != iProver_Domain_i_1 ) )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1
& X3 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1
& X3 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1
& X3 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1 ) ) ) ).
%------ Negative definition of iProver_Flat_f13
fof(lit_def_045,axiom,
! [X0,X1,X2,X3,X4] :
( ~ iProver_Flat_f13(X0,X1,X2,X3,X4)
<=> ( ( X0 != iProver_Domain_i_1
& ( X0 != iProver_Domain_i_1
| X1 != iProver_Domain_i_1
| X2 != iProver_Domain_i_1
| X3 != iProver_Domain_i_1 )
& ( X0 != iProver_Domain_i_1
| X2 != iProver_Domain_i_1
| X3 != iProver_Domain_i_1 ) )
| ( X1 = iProver_Domain_i_1
& X0 != iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_closure
fof(lit_def_046,axiom,
! [X0,X1,X2,X3] :
( iProver_Flat_closure(X0,X1,X2,X3)
<=> ( ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1
& X2 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1
& X3 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1
& X3 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1
& X3 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_f14
fof(lit_def_047,axiom,
! [X0,X1,X2,X3,X4] :
( iProver_Flat_f14(X0,X1,X2,X3,X4)
<=> ( ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1
& ( X2 != iProver_Domain_i_1
| X3 != iProver_Domain_i_1 ) )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& ( X2 != iProver_Domain_i_1
| X3 != iProver_Domain_i_1 ) )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1
& X3 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1
& X3 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1 ) ) ) ).
%------ Negative definition of iProver_Flat_f15
fof(lit_def_048,axiom,
! [X0,X1,X2,X3,X4,X5] :
( ~ iProver_Flat_f15(X0,X1,X2,X3,X4,X5)
<=> ( X2 = iProver_Domain_i_1
& X3 = iProver_Domain_i_1
& X0 != iProver_Domain_i_1 ) ) ).
%------ Positive definition of iProver_Flat_f16
fof(lit_def_049,axiom,
! [X0,X1,X2,X3,X4] :
( iProver_Flat_f16(X0,X1,X2,X3,X4)
<=> ( ( X0 = iProver_Domain_i_1
& X3 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1
& X3 = iProver_Domain_i_1
& X4 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1
& X3 = iProver_Domain_i_1
& X4 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X3 = iProver_Domain_i_1
& X2 != iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_boundary
fof(lit_def_050,axiom,
! [X0,X1,X2,X3] :
( iProver_Flat_boundary(X0,X1,X2,X3)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Negative definition of iProver_Flat_f17
fof(lit_def_051,axiom,
! [X0,X1,X2,X3,X4] :
( ~ iProver_Flat_f17(X0,X1,X2,X3,X4)
<=> $false ) ).
%------ Negative definition of iProver_Flat_f18
fof(lit_def_052,axiom,
! [X0,X1,X2,X3,X4] :
( ~ iProver_Flat_f18(X0,X1,X2,X3,X4)
<=> $false ) ).
%------ Positive definition of iProver_Flat_f19
fof(lit_def_053,axiom,
! [X0,X1,X2] :
( iProver_Flat_f19(X0,X1,X2)
<=> ( ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_f20
fof(lit_def_054,axiom,
! [X0,X1,X2] :
( iProver_Flat_f20(X0,X1,X2)
<=> ( ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1 ) ) ) ).
%------ Negative definition of iProver_Flat_f21
fof(lit_def_055,axiom,
! [X0,X1,X2] :
( ~ iProver_Flat_f21(X0,X1,X2)
<=> $false ) ).
%------ Negative definition of iProver_Flat_f22
fof(lit_def_056,axiom,
! [X0,X1,X2] :
( ~ iProver_Flat_f22(X0,X1,X2)
<=> $false ) ).
%------ Negative definition of iProver_Flat_f23
fof(lit_def_057,axiom,
! [X0,X1,X2,X3] :
( ~ iProver_Flat_f23(X0,X1,X2,X3)
<=> $false ) ).
%------ Positive definition of iProver_Flat_f24
fof(lit_def_058,axiom,
! [X0,X1,X2] :
( iProver_Flat_f24(X0,X1,X2)
<=> ( ( X0 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1 ) ) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : TOP012-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : run_iprover %s %d SAT
% 0.13/0.34 % Computer : n008.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:39:03 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running model finding
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.42/1.16 % SZS status Started for theBenchmark.p
% 3.42/1.16 % SZS status Satisfiable for theBenchmark.p
% 3.42/1.16
% 3.42/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.42/1.16
% 3.42/1.16 ------ iProver source info
% 3.42/1.16
% 3.42/1.16 git: date: 2023-05-31 18:12:56 +0000
% 3.42/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.42/1.16 git: non_committed_changes: false
% 3.42/1.16 git: last_make_outside_of_git: false
% 3.42/1.16
% 3.42/1.16 ------ Parsing...successful
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16 ------ 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
% 3.42/1.16
% 3.42/1.16 ------ Preprocessing... gs_s sp: 3 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.42/1.16 ------ Proving...
% 3.42/1.16 ------ Problem Properties
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16 clauses 106
% 3.42/1.16 conjectures 11
% 3.42/1.16 EPR 26
% 3.42/1.16 Horn 80
% 3.42/1.16 unary 1
% 3.42/1.16 binary 46
% 3.42/1.16 lits 335
% 3.42/1.16 lits eq 0
% 3.42/1.16 fd_pure 0
% 3.42/1.16 fd_pseudo 0
% 3.42/1.16 fd_cond 0
% 3.42/1.16 fd_pseudo_cond 0
% 3.42/1.16 AC symbols 0
% 3.42/1.16
% 3.42/1.16 ------ Input Options Time Limit: Unbounded
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16 ------ Finite Models:
% 3.42/1.16
% 3.42/1.16 ------ lit_activity_flag true
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16 ------ Trying domains of size >= : 1
% 3.42/1.16
% 3.42/1.16 ------ Trying domains of size >= : 2
% 3.42/1.16 ------
% 3.42/1.16 Current options:
% 3.42/1.16 ------
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16 ------ Proving...
% 3.42/1.16
% 3.42/1.16 ------ Trying domains of size >= : 2
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16 ------ Proving...
% 3.42/1.16
% 3.42/1.16 ------ Trying domains of size >= : 2
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16 ------ Proving...
% 3.42/1.16
% 3.42/1.16 ------ Trying domains of size >= : 2
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16 ------ Proving...
% 3.42/1.16
% 3.42/1.16
% 3.42/1.16 % SZS status Satisfiable for theBenchmark.p
% 3.42/1.16
% 3.42/1.16 ------ Building Model...Done
% 3.42/1.16
% 3.42/1.16 %------ The model is defined over ground terms (initial term algebra).
% 3.42/1.16 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.42/1.16 %------ where \phi is a formula over the term algebra.
% 3.42/1.16 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.42/1.16 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.42/1.16 %------ See help for --sat_out_model for different model outputs.
% 3.42/1.16 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.42/1.16 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.42/1.16 % SZS output start Model for theBenchmark.p
% See solution above
% 3.42/1.17 ------ Statistics
% 3.42/1.17
% 3.42/1.17 ------ Problem properties
% 3.42/1.17
% 3.42/1.17 clauses: 106
% 3.42/1.17 conjectures: 11
% 3.42/1.17 epr: 26
% 3.42/1.17 horn: 80
% 3.42/1.17 ground: 10
% 3.42/1.17 unary: 1
% 3.42/1.17 binary: 46
% 3.42/1.17 lits: 335
% 3.42/1.17 lits_eq: 0
% 3.42/1.17 fd_pure: 0
% 3.42/1.17 fd_pseudo: 0
% 3.42/1.17 fd_cond: 0
% 3.42/1.17 fd_pseudo_cond: 0
% 3.42/1.17 ac_symbols: 0
% 3.42/1.17
% 3.42/1.17 ------ General
% 3.42/1.17
% 3.42/1.17 abstr_ref_over_cycles: 0
% 3.42/1.17 abstr_ref_under_cycles: 0
% 3.42/1.17 gc_basic_clause_elim: 0
% 3.42/1.17 num_of_symbols: 252
% 3.42/1.17 num_of_terms: 5303
% 3.42/1.17
% 3.42/1.17 parsing_time: 0.007
% 3.42/1.17 unif_index_cands_time: 0.006
% 3.42/1.17 unif_index_add_time: 0.005
% 3.42/1.17 orderings_time: 0.
% 3.42/1.17 out_proof_time: 0.
% 3.42/1.17 total_time: 0.409
% 3.42/1.17
% 3.42/1.17 ------ Preprocessing
% 3.42/1.17
% 3.42/1.17 num_of_splits: 3
% 3.42/1.17 num_of_split_atoms: 1
% 3.42/1.17 num_of_reused_defs: 2
% 3.42/1.17 num_eq_ax_congr_red: 0
% 3.42/1.17 num_of_sem_filtered_clauses: 0
% 3.42/1.17 num_of_subtypes: 0
% 3.42/1.17 monotx_restored_types: 0
% 3.42/1.17 sat_num_of_epr_types: 0
% 3.42/1.17 sat_num_of_non_cyclic_types: 0
% 3.42/1.17 sat_guarded_non_collapsed_types: 0
% 3.42/1.17 num_pure_diseq_elim: 0
% 3.42/1.17 simp_replaced_by: 0
% 3.42/1.17 res_preprocessed: 0
% 3.42/1.17 sup_preprocessed: 0
% 3.42/1.17 prep_upred: 0
% 3.42/1.17 prep_unflattend: 0
% 3.42/1.17 prep_well_definedness: 0
% 3.42/1.17 smt_new_axioms: 0
% 3.42/1.17 pred_elim_cands: 18
% 3.42/1.17 pred_elim: 4
% 3.42/1.17 pred_elim_cl: 14
% 3.42/1.17 pred_elim_cycles: 24
% 3.42/1.17 merged_defs: 2
% 3.42/1.17 merged_defs_ncl: 0
% 3.42/1.17 bin_hyper_res: 2
% 3.42/1.17 prep_cycles: 2
% 3.42/1.17
% 3.42/1.17 splitting_time: 0.
% 3.42/1.17 sem_filter_time: 0.007
% 3.42/1.17 monotx_time: 0.
% 3.42/1.17 subtype_inf_time: 0.
% 3.42/1.17 res_prep_time: 0.027
% 3.42/1.17 sup_prep_time: 0.
% 3.42/1.17 pred_elim_time: 0.056
% 3.42/1.17 bin_hyper_res_time: 0.001
% 3.42/1.17 prep_time_total: 0.102
% 3.42/1.17
% 3.42/1.17 ------ Propositional Solver
% 3.42/1.17
% 3.42/1.17 prop_solver_calls: 101
% 3.42/1.17 prop_fast_solver_calls: 3186
% 3.42/1.17 smt_solver_calls: 0
% 3.42/1.17 smt_fast_solver_calls: 0
% 3.42/1.17 prop_num_of_clauses: 2401
% 3.42/1.17 prop_preprocess_simplified: 10459
% 3.42/1.17 prop_fo_subsumed: 38
% 3.42/1.17
% 3.42/1.17 prop_solver_time: 0.018
% 3.42/1.17 prop_fast_solver_time: 0.003
% 3.42/1.17 prop_unsat_core_time: 0.001
% 3.42/1.17 smt_solver_time: 0.
% 3.42/1.17 smt_fast_solver_time: 0.
% 3.42/1.17
% 3.42/1.17 ------ QBF
% 3.42/1.17
% 3.42/1.17 qbf_q_res: 0
% 3.42/1.17 qbf_num_tautologies: 0
% 3.42/1.17 qbf_prep_cycles: 0
% 3.42/1.17
% 3.42/1.17 ------ BMC1
% 3.42/1.17
% 3.42/1.17 bmc1_current_bound: -1
% 3.42/1.17 bmc1_last_solved_bound: -1
% 3.42/1.17 bmc1_unsat_core_size: -1
% 3.42/1.17 bmc1_unsat_core_parents_size: -1
% 3.42/1.17 bmc1_merge_next_fun: 0
% 3.42/1.17
% 3.42/1.17 bmc1_unsat_core_clauses_time: 0.
% 3.42/1.17
% 3.42/1.17 ------ Instantiation
% 3.42/1.17
% 3.42/1.17 inst_num_of_clauses: 573
% 3.42/1.17 inst_num_in_passive: 0
% 3.42/1.17 inst_num_in_active: 1651
% 3.42/1.17 inst_num_of_loops: 2683
% 3.42/1.17 inst_num_in_unprocessed: 0
% 3.42/1.17 inst_num_of_learning_restarts: 0
% 3.42/1.17 inst_num_moves_active_passive: 918
% 3.42/1.17 inst_lit_activity: 0
% 3.42/1.17 inst_lit_activity_moves: 0
% 3.42/1.17 inst_num_tautologies: 0
% 3.42/1.17 inst_num_prop_implied: 0
% 3.42/1.17 inst_num_existing_simplified: 0
% 3.42/1.17 inst_num_eq_res_simplified: 0
% 3.42/1.17 inst_num_child_elim: 0
% 3.42/1.17 inst_num_of_dismatching_blockings: 369
% 3.42/1.17 inst_num_of_non_proper_insts: 1901
% 3.42/1.17 inst_num_of_duplicates: 0
% 3.42/1.17 inst_inst_num_from_inst_to_res: 0
% 3.42/1.17
% 3.42/1.17 inst_time_sim_new: 0.074
% 3.42/1.17 inst_time_sim_given: 0.
% 3.42/1.17 inst_time_dismatching_checking: 0.005
% 3.42/1.17 inst_time_total: 0.25
% 3.42/1.17
% 3.42/1.17 ------ Resolution
% 3.42/1.17
% 3.42/1.17 res_num_of_clauses: 105
% 3.42/1.17 res_num_in_passive: 0
% 3.42/1.17 res_num_in_active: 0
% 3.42/1.17 res_num_of_loops: 226
% 3.42/1.17 res_forward_subset_subsumed: 12
% 3.42/1.17 res_backward_subset_subsumed: 2
% 3.42/1.17 res_forward_subsumed: 6
% 3.42/1.17 res_backward_subsumed: 0
% 3.42/1.17 res_forward_subsumption_resolution: 9
% 3.42/1.17 res_backward_subsumption_resolution: 2
% 3.42/1.17 res_clause_to_clause_subsumption: 534
% 3.42/1.17 res_subs_bck_cnt: 3
% 3.42/1.17 res_orphan_elimination: 0
% 3.42/1.17 res_tautology_del: 406
% 3.42/1.17 res_num_eq_res_simplified: 0
% 3.42/1.17 res_num_sel_changes: 0
% 3.42/1.17 res_moves_from_active_to_pass: 0
% 3.42/1.17
% 3.42/1.17 res_time_sim_new: 0.004
% 3.42/1.17 res_time_sim_fw_given: 0.012
% 3.42/1.17 res_time_sim_bw_given: 0.007
% 3.42/1.17 res_time_total: 0.004
% 3.42/1.17
% 3.42/1.17 ------ Superposition
% 3.42/1.17
% 3.42/1.17 sup_num_of_clauses: undef
% 3.42/1.17 sup_num_in_active: undef
% 3.42/1.17 sup_num_in_passive: undef
% 3.42/1.17 sup_num_of_loops: 0
% 3.42/1.17 sup_fw_superposition: 0
% 3.42/1.17 sup_bw_superposition: 0
% 3.42/1.17 sup_eq_factoring: 0
% 3.42/1.17 sup_eq_resolution: 0
% 3.42/1.17 sup_immediate_simplified: 0
% 3.42/1.17 sup_given_eliminated: 0
% 3.42/1.17 comparisons_done: 0
% 3.42/1.17 comparisons_avoided: 0
% 3.42/1.17 comparisons_inc_criteria: 0
% 3.42/1.17 sup_deep_cl_discarded: 0
% 3.42/1.17 sup_num_of_deepenings: 0
% 3.42/1.17 sup_num_of_restarts: 0
% 3.42/1.17
% 3.42/1.17 sup_time_generating: 0.
% 3.42/1.17 sup_time_sim_fw_full: 0.
% 3.42/1.17 sup_time_sim_bw_full: 0.
% 3.42/1.17 sup_time_sim_fw_immed: 0.
% 3.42/1.17 sup_time_sim_bw_immed: 0.
% 3.42/1.17 sup_time_prep_sim_fw_input: 0.
% 3.42/1.17 sup_time_prep_sim_bw_input: 0.
% 3.42/1.17 sup_time_total: 0.
% 3.42/1.17
% 3.42/1.17 ------ Simplifications
% 3.42/1.17
% 3.42/1.17 sim_repeated: 0
% 3.42/1.17 sim_fw_subset_subsumed: 0
% 3.42/1.17 sim_bw_subset_subsumed: 0
% 3.42/1.17 sim_fw_subsumed: 0
% 3.42/1.17 sim_bw_subsumed: 0
% 3.42/1.17 sim_fw_subsumption_res: 0
% 3.42/1.17 sim_bw_subsumption_res: 0
% 3.42/1.17 sim_fw_unit_subs: 0
% 3.42/1.17 sim_bw_unit_subs: 0
% 3.42/1.17 sim_tautology_del: 0
% 3.42/1.17 sim_eq_tautology_del: 0
% 3.42/1.17 sim_eq_res_simp: 0
% 3.42/1.17 sim_fw_demodulated: 0
% 3.42/1.17 sim_bw_demodulated: 0
% 3.42/1.17 sim_encompassment_demod: 0
% 3.42/1.17 sim_light_normalised: 0
% 3.42/1.17 sim_ac_normalised: 0
% 3.42/1.17 sim_joinable_taut: 0
% 3.42/1.17 sim_joinable_simp: 0
% 3.42/1.17 sim_fw_ac_demod: 0
% 3.42/1.17 sim_bw_ac_demod: 0
% 3.42/1.17 sim_smt_subsumption: 0
% 3.42/1.17 sim_smt_simplified: 0
% 3.42/1.17 sim_ground_joinable: 0
% 3.42/1.17 sim_bw_ground_joinable: 0
% 3.42/1.17 sim_connectedness: 0
% 3.42/1.17
% 3.42/1.17 sim_time_fw_subset_subs: 0.
% 3.42/1.17 sim_time_bw_subset_subs: 0.
% 3.42/1.17 sim_time_fw_subs: 0.
% 3.42/1.17 sim_time_bw_subs: 0.
% 3.42/1.17 sim_time_fw_subs_res: 0.
% 3.42/1.17 sim_time_bw_subs_res: 0.
% 3.42/1.17 sim_time_fw_unit_subs: 0.
% 3.42/1.17 sim_time_bw_unit_subs: 0.
% 3.42/1.17 sim_time_tautology_del: 0.
% 3.42/1.17 sim_time_eq_tautology_del: 0.
% 3.42/1.17 sim_time_eq_res_simp: 0.
% 3.42/1.17 sim_time_fw_demod: 0.
% 3.42/1.17 sim_time_bw_demod: 0.
% 3.42/1.17 sim_time_light_norm: 0.
% 3.42/1.17 sim_time_joinable: 0.
% 3.42/1.17 sim_time_ac_norm: 0.
% 3.42/1.17 sim_time_fw_ac_demod: 0.
% 3.42/1.17 sim_time_bw_ac_demod: 0.
% 3.42/1.17 sim_time_smt_subs: 0.
% 3.42/1.17 sim_time_fw_gjoin: 0.
% 3.42/1.17 sim_time_fw_connected: 0.
% 3.42/1.17
% 3.42/1.17
%------------------------------------------------------------------------------