TSTP Solution File: SWB025-10 by iProver-SAT---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.8
% Problem : SWB025-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n014.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 : Thu Aug 31 20:10:08 EDT 2023
% Result : Satisfiable 3.37s 1.13s
% Output : Model 3.37s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Negative definition of equality_sorted
fof(lit_def,axiom,
! [X0_12,X0,X1] :
( ~ equality_sorted(X0_12,X0,X1)
<=> ( ( X0_12 = $i
& X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_2 )
| ( X0_12 = $i
& X0 = iProver_Domain_i_2
& X1 = iProver_Domain_i_1 ) ) ) ).
%------ Negative definition of iProver_Flat_ifeq
fof(lit_def_001,axiom,
! [X0,X1,X2,X3,X4] :
( ~ iProver_Flat_ifeq(X0,X1,X2,X3,X4)
<=> ( ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1
& X3 = iProver_Domain_i_2
& X4 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X2 = X1
& X3 = iProver_Domain_i_2
& ( X1 != iProver_Domain_i_1
| X4 != iProver_Domain_i_1 ) )
| ( X0 = iProver_Domain_i_2
& X2 = X1
& X3 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_2
& X2 = iProver_Domain_i_1
& X3 = iProver_Domain_i_1
& X4 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_2
& X2 = iProver_Domain_i_1
& X4 = iProver_Domain_i_1
& ( X1 != iProver_Domain_i_1
| X3 != iProver_Domain_i_2 ) )
| ( X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1
& X3 = iProver_Domain_i_1
& X4 = iProver_Domain_i_1
& X0 != iProver_Domain_i_1 )
| ( X1 = iProver_Domain_i_2
& X2 = iProver_Domain_i_1
& X3 = iProver_Domain_i_1
& X4 = iProver_Domain_i_1
& X0 != iProver_Domain_i_1 )
| ( X1 = iProver_Domain_i_2
& X2 = iProver_Domain_i_1
& X4 = iProver_Domain_i_1
& X0 != iProver_Domain_i_1
& ( X0 != iProver_Domain_i_1
| X3 != iProver_Domain_i_1 )
& ( X0 != iProver_Domain_i_1
| X3 != iProver_Domain_i_2 ) )
| ( X2 = iProver_Domain_i_1
& X3 = iProver_Domain_i_1
& X4 = iProver_Domain_i_1
& X0 != iProver_Domain_i_1
& ( X0 != iProver_Domain_i_1
| X1 != iProver_Domain_i_1 )
& X0 != iProver_Domain_i_2 )
| ( X2 = iProver_Domain_i_1
& X3 = iProver_Domain_i_2
& X4 = iProver_Domain_i_1
& X0 != iProver_Domain_i_1
& ( X0 != iProver_Domain_i_2
| X1 != iProver_Domain_i_1 ) )
| ( X2 = iProver_Domain_i_1
& X4 = iProver_Domain_i_1
& X0 != 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 )
& X0 != iProver_Domain_i_2
& ( X0 != iProver_Domain_i_2
| X1 != iProver_Domain_i_1
| X3 != iProver_Domain_i_2 ) ) ) ) ).
%------ Positive definition of iProver_Flat_iext
fof(lit_def_002,axiom,
! [X0,X1,X2,X3] :
( iProver_Flat_iext(X0,X1,X2,X3)
<=> ( ( X0 = iProver_Domain_i_1
& ( X1 != X1
| X2 != X1
| X3 != iProver_Domain_i_1 )
& X1 != iProver_Domain_i_1
& ( X1 != iProver_Domain_i_1
| X2 != iProver_Domain_i_1 )
& ( X1 != iProver_Domain_i_1
| X2 != iProver_Domain_i_1
| X3 != iProver_Domain_i_1 )
& ( X1 != iProver_Domain_i_1
| X3 != iProver_Domain_i_1 )
& X2 != iProver_Domain_i_1
& ( X2 != iProver_Domain_i_1
| X3 != iProver_Domain_i_1 )
& X3 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1
& X2 != iProver_Domain_i_1
& ( X2 != iProver_Domain_i_1
| X3 != 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
& X1 = iProver_Domain_i_1
& X3 = iProver_Domain_i_1
& X2 != iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X2 = X1
& X3 = iProver_Domain_i_1
& X1 != 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
& X3 = iProver_Domain_i_1
& 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
& ( X1 != iProver_Domain_i_1
| X3 != iProver_Domain_i_1 )
& X3 != iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of iProver_Flat_true
fof(lit_def_003,axiom,
! [X0] :
( iProver_Flat_true(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_ip
fof(lit_def_004,axiom,
! [X0,X1] :
( iProver_Flat_ip(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_ir
fof(lit_def_005,axiom,
! [X0,X1] :
( iProver_Flat_ir(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_lv
fof(lit_def_006,axiom,
! [X0,X1] :
( iProver_Flat_lv(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdf_type
fof(lit_def_007,axiom,
! [X0] :
( iProver_Flat_uri_rdf_type(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdf_first
fof(lit_def_008,axiom,
! [X0] :
( iProver_Flat_uri_rdf_first(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdf_Property
fof(lit_def_009,axiom,
! [X0] :
( iProver_Flat_uri_rdf_Property(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdf_nil
fof(lit_def_010,axiom,
! [X0] :
( iProver_Flat_uri_rdf_nil(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdf_List
fof(lit_def_011,axiom,
! [X0] :
( iProver_Flat_uri_rdf_List(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdf_rest
fof(lit_def_012,axiom,
! [X0] :
( iProver_Flat_uri_rdf_rest(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdf__1
fof(lit_def_013,axiom,
! [X0] :
( iProver_Flat_uri_rdf__1(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdf__2
fof(lit_def_014,axiom,
! [X0] :
( iProver_Flat_uri_rdf__2(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdf__3
fof(lit_def_015,axiom,
! [X0] :
( iProver_Flat_uri_rdf__3(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdf_object
fof(lit_def_016,axiom,
! [X0] :
( iProver_Flat_uri_rdf_object(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdf_value
fof(lit_def_017,axiom,
! [X0] :
( iProver_Flat_uri_rdf_value(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdf_subject
fof(lit_def_018,axiom,
! [X0] :
( iProver_Flat_uri_rdf_subject(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdfs_domain
fof(lit_def_019,axiom,
! [X0] :
( iProver_Flat_uri_rdfs_domain(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdfs_comment
fof(lit_def_020,axiom,
! [X0] :
( iProver_Flat_uri_rdfs_comment(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdfs_Resource
fof(lit_def_021,axiom,
! [X0] :
( iProver_Flat_uri_rdfs_Resource(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdfs_range
fof(lit_def_022,axiom,
! [X0] :
( iProver_Flat_uri_rdfs_range(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdfs_Literal
fof(lit_def_023,axiom,
! [X0] :
( iProver_Flat_uri_rdfs_Literal(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdfs_isDefinedBy
fof(lit_def_024,axiom,
! [X0] :
( iProver_Flat_uri_rdfs_isDefinedBy(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdfs_subPropertyOf
fof(lit_def_025,axiom,
! [X0] :
( iProver_Flat_uri_rdfs_subPropertyOf(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_uri_rdfs_seeAlso
fof(lit_def_026,axiom,
! [X0] :
( iProver_Flat_uri_rdfs_seeAlso(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdfs_label
fof(lit_def_027,axiom,
! [X0] :
( iProver_Flat_uri_rdfs_label(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_icext
fof(lit_def_028,axiom,
! [X0,X1,X2] :
( iProver_Flat_icext(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_ic
fof(lit_def_029,axiom,
! [X0,X1] :
( iProver_Flat_ic(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdfs_subClassOf
fof(lit_def_030,axiom,
! [X0] :
( iProver_Flat_uri_rdfs_subClassOf(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdf_Alt
fof(lit_def_031,axiom,
! [X0] :
( iProver_Flat_uri_rdf_Alt(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdfs_Container
fof(lit_def_032,axiom,
! [X0] :
( iProver_Flat_uri_rdfs_Container(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdf_Bag
fof(lit_def_033,axiom,
! [X0] :
( iProver_Flat_uri_rdf_Bag(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdfs_ContainerMembershipProperty
fof(lit_def_034,axiom,
! [X0] :
( iProver_Flat_uri_rdfs_ContainerMembershipProperty(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdfs_member
fof(lit_def_035,axiom,
! [X0] :
( iProver_Flat_uri_rdfs_member(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdfs_Seq
fof(lit_def_036,axiom,
! [X0] :
( iProver_Flat_uri_rdfs_Seq(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdf_XMLLiteral
fof(lit_def_037,axiom,
! [X0] :
( iProver_Flat_uri_rdf_XMLLiteral(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdfs_Datatype
fof(lit_def_038,axiom,
! [X0] :
( iProver_Flat_uri_rdfs_Datatype(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdfs_Class
fof(lit_def_039,axiom,
! [X0] :
( iProver_Flat_uri_rdfs_Class(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdfs_Statement
fof(lit_def_040,axiom,
! [X0] :
( iProver_Flat_uri_rdfs_Statement(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_rdf_predicate
fof(lit_def_041,axiom,
! [X0] :
( iProver_Flat_uri_rdf_predicate(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_owl_inverseOf
fof(lit_def_042,axiom,
! [X0] :
( iProver_Flat_uri_owl_inverseOf(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK1_testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties_BNODE_l3
fof(lit_def_043,axiom,
! [X0] :
( iProver_Flat_sK1_testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties_BNODE_l3(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_ex_hasFather
fof(lit_def_044,axiom,
! [X0] :
( iProver_Flat_uri_ex_hasFather(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_ex_bob
fof(lit_def_045,axiom,
! [X0] :
( iProver_Flat_uri_ex_bob(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_ex_charly
fof(lit_def_046,axiom,
! [X0] :
( iProver_Flat_uri_ex_charly(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_ex_alice
fof(lit_def_047,axiom,
! [X0] :
( iProver_Flat_uri_ex_alice(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_uri_ex_dave
fof(lit_def_048,axiom,
! [X0] :
( iProver_Flat_uri_ex_dave(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_owl_propertyChainAxiom
fof(lit_def_049,axiom,
! [X0] :
( iProver_Flat_uri_owl_propertyChainAxiom(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_ex_hasUncle
fof(lit_def_050,axiom,
! [X0] :
( iProver_Flat_uri_ex_hasUncle(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK4_testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties_BNODE_l11
fof(lit_def_051,axiom,
! [X0] :
( iProver_Flat_sK4_testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties_BNODE_l11(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_uri_ex_hasCousin
fof(lit_def_052,axiom,
! [X0] :
( iProver_Flat_uri_ex_hasCousin(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK2_testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties_BNODE_l21
fof(lit_def_053,axiom,
! [X0] :
( iProver_Flat_sK2_testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties_BNODE_l21(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK3_testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties_BNODE_l22
fof(lit_def_054,axiom,
! [X0] :
( iProver_Flat_sK3_testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties_BNODE_l22(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK5_testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties_BNODE_l12
fof(lit_def_055,axiom,
! [X0] :
( iProver_Flat_sK5_testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties_BNODE_l12(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Negative definition of iProver_Flat_tuple
fof(lit_def_056,axiom,
! [X0,X1,X2] :
( ~ iProver_Flat_tuple(X0,X1,X2)
<=> ( ( X0 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1
& X1 != iProver_Domain_i_1 )
| ( X1 = iProver_Domain_i_1
& X2 = iProver_Domain_i_1
& X0 != iProver_Domain_i_1 ) ) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWB025-10 : TPTP v8.1.2. Released v7.5.0.
% 0.00/0.13 % Command : run_iprover %s %d SAT
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun Aug 27 07:01:16 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.45 Running model finding
% 0.19/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.37/1.13 % SZS status Started for theBenchmark.p
% 3.37/1.13 % SZS status Satisfiable for theBenchmark.p
% 3.37/1.13
% 3.37/1.13 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.37/1.13
% 3.37/1.13 ------ iProver source info
% 3.37/1.13
% 3.37/1.13 git: date: 2023-05-31 18:12:56 +0000
% 3.37/1.13 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.37/1.13 git: non_committed_changes: false
% 3.37/1.13 git: last_make_outside_of_git: false
% 3.37/1.13
% 3.37/1.13 ------ Parsing...successful
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13 ------ Preprocessing... sup_sim: 3 sf_s rm: 0 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.37/1.13
% 3.37/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.37/1.13
% 3.37/1.13 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.37/1.13 ------ Proving...
% 3.37/1.13 ------ Problem Properties
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13 clauses 103
% 3.37/1.13 conjectures 1
% 3.37/1.13 EPR 0
% 3.37/1.13 Horn 103
% 3.37/1.13 unary 103
% 3.37/1.13 binary 0
% 3.37/1.13 lits 103
% 3.37/1.13 lits eq 103
% 3.37/1.13 fd_pure 0
% 3.37/1.13 fd_pseudo 0
% 3.37/1.13 fd_cond 0
% 3.37/1.13 fd_pseudo_cond 0
% 3.37/1.13 AC symbols 0
% 3.37/1.13
% 3.37/1.13 ------ Input Options Time Limit: Unbounded
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13 ------ Finite Models:
% 3.37/1.13
% 3.37/1.13 ------ lit_activity_flag true
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13 ------ Trying domains of size >= : 1
% 3.37/1.13
% 3.37/1.13 ------ Trying domains of size >= : 2
% 3.37/1.13 ------
% 3.37/1.13 Current options:
% 3.37/1.13 ------
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13 ------ Proving...
% 3.37/1.13
% 3.37/1.13 ------ Trying domains of size >= : 2
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13 ------ Proving...
% 3.37/1.13
% 3.37/1.13 ------ Trying domains of size >= : 2
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13 ------ Proving...
% 3.37/1.13
% 3.37/1.13 ------ Trying domains of size >= : 2
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13 ------ Proving...
% 3.37/1.13
% 3.37/1.13 ------ Trying domains of size >= : 2
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13 ------ Proving...
% 3.37/1.13
% 3.37/1.13
% 3.37/1.13 % SZS status Satisfiable for theBenchmark.p
% 3.37/1.13
% 3.37/1.13 ------ Building Model...Done
% 3.37/1.13
% 3.37/1.13 %------ The model is defined over ground terms (initial term algebra).
% 3.37/1.13 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.37/1.13 %------ where \phi is a formula over the term algebra.
% 3.37/1.13 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.37/1.13 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.37/1.13 %------ See help for --sat_out_model for different model outputs.
% 3.37/1.13 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.37/1.13 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.37/1.13 % SZS output start Model for theBenchmark.p
% See solution above
% 3.37/1.13 ------ Statistics
% 3.37/1.13
% 3.37/1.13 ------ Problem properties
% 3.37/1.13
% 3.37/1.13 clauses: 103
% 3.37/1.13 conjectures: 1
% 3.37/1.13 epr: 0
% 3.37/1.13 horn: 103
% 3.37/1.13 ground: 75
% 3.37/1.13 unary: 103
% 3.37/1.13 binary: 0
% 3.37/1.13 lits: 103
% 3.37/1.13 lits_eq: 103
% 3.37/1.13 fd_pure: 0
% 3.37/1.13 fd_pseudo: 0
% 3.37/1.13 fd_cond: 0
% 3.37/1.13 fd_pseudo_cond: 0
% 3.37/1.13 ac_symbols: 0
% 3.37/1.13
% 3.37/1.13 ------ General
% 3.37/1.13
% 3.37/1.13 abstr_ref_over_cycles: 0
% 3.37/1.13 abstr_ref_under_cycles: 0
% 3.37/1.13 gc_basic_clause_elim: 0
% 3.37/1.13 num_of_symbols: 280
% 3.37/1.13 num_of_terms: 3365
% 3.37/1.13
% 3.37/1.13 parsing_time: 0.003
% 3.37/1.13 unif_index_cands_time: 0.007
% 3.37/1.13 unif_index_add_time: 0.003
% 3.37/1.13 orderings_time: 0.
% 3.37/1.13 out_proof_time: 0.
% 3.37/1.13 total_time: 0.393
% 3.37/1.13
% 3.37/1.13 ------ Preprocessing
% 3.37/1.13
% 3.37/1.13 num_of_splits: 0
% 3.37/1.13 num_of_split_atoms: 0
% 3.37/1.13 num_of_reused_defs: 0
% 3.37/1.13 num_eq_ax_congr_red: 15
% 3.37/1.13 num_of_sem_filtered_clauses: 0
% 3.37/1.13 num_of_subtypes: 0
% 3.37/1.13 monotx_restored_types: 0
% 3.37/1.13 sat_num_of_epr_types: 0
% 3.37/1.13 sat_num_of_non_cyclic_types: 0
% 3.37/1.13 sat_guarded_non_collapsed_types: 0
% 3.37/1.13 num_pure_diseq_elim: 0
% 3.37/1.13 simp_replaced_by: 0
% 3.37/1.13 res_preprocessed: 0
% 3.37/1.13 sup_preprocessed: 3
% 3.37/1.13 prep_upred: 0
% 3.37/1.13 prep_unflattend: 0
% 3.37/1.13 prep_well_definedness: 0
% 3.37/1.13 smt_new_axioms: 0
% 3.37/1.13 pred_elim_cands: 0
% 3.37/1.13 pred_elim: 0
% 3.37/1.13 pred_elim_cl: 0
% 3.37/1.13 pred_elim_cycles: 0
% 3.37/1.13 merged_defs: 0
% 3.37/1.13 merged_defs_ncl: 0
% 3.37/1.13 bin_hyper_res: 0
% 3.37/1.13 prep_cycles: 3
% 3.37/1.13
% 3.37/1.13 splitting_time: 0.
% 3.37/1.13 sem_filter_time: 0.008
% 3.37/1.13 monotx_time: 0.
% 3.37/1.13 subtype_inf_time: 0.
% 3.37/1.13 res_prep_time: 0.021
% 3.37/1.13 sup_prep_time: 0.008
% 3.37/1.13 pred_elim_time: 0.002
% 3.37/1.13 bin_hyper_res_time: 0.
% 3.37/1.13 prep_time_total: 0.046
% 3.37/1.13
% 3.37/1.13 ------ Propositional Solver
% 3.37/1.13
% 3.37/1.13 prop_solver_calls: 86
% 3.37/1.13 prop_fast_solver_calls: 986
% 3.37/1.13 smt_solver_calls: 0
% 3.37/1.13 smt_fast_solver_calls: 0
% 3.37/1.13 prop_num_of_clauses: 2257
% 3.37/1.13 prop_preprocess_simplified: 16557
% 3.37/1.13 prop_fo_subsumed: 0
% 3.37/1.13
% 3.37/1.13 prop_solver_time: 0.005
% 3.37/1.13 prop_fast_solver_time: 0.
% 3.37/1.13 prop_unsat_core_time: 0.001
% 3.37/1.13 smt_solver_time: 0.
% 3.37/1.13 smt_fast_solver_time: 0.
% 3.37/1.13
% 3.37/1.13 ------ QBF
% 3.37/1.13
% 3.37/1.13 qbf_q_res: 0
% 3.37/1.13 qbf_num_tautologies: 0
% 3.37/1.13 qbf_prep_cycles: 0
% 3.37/1.13
% 3.37/1.13 ------ BMC1
% 3.37/1.13
% 3.37/1.13 bmc1_current_bound: -1
% 3.37/1.13 bmc1_last_solved_bound: -1
% 3.37/1.13 bmc1_unsat_core_size: -1
% 3.37/1.13 bmc1_unsat_core_parents_size: -1
% 3.37/1.13 bmc1_merge_next_fun: 0
% 3.37/1.13
% 3.37/1.13 bmc1_unsat_core_clauses_time: 0.
% 3.37/1.13
% 3.37/1.13 ------ Instantiation
% 3.37/1.13
% 3.37/1.13 inst_num_of_clauses: 832
% 3.37/1.13 inst_num_in_passive: 0
% 3.37/1.13 inst_num_in_active: 3443
% 3.37/1.13 inst_num_of_loops: 4019
% 3.37/1.13 inst_num_in_unprocessed: 0
% 3.37/1.13 inst_num_of_learning_restarts: 0
% 3.37/1.13 inst_num_moves_active_passive: 423
% 3.37/1.13 inst_lit_activity: 0
% 3.37/1.13 inst_lit_activity_moves: 0
% 3.37/1.13 inst_num_tautologies: 0
% 3.37/1.13 inst_num_prop_implied: 0
% 3.37/1.13 inst_num_existing_simplified: 0
% 3.37/1.13 inst_num_eq_res_simplified: 0
% 3.37/1.13 inst_num_child_elim: 0
% 3.37/1.13 inst_num_of_dismatching_blockings: 603
% 3.37/1.13 inst_num_of_non_proper_insts: 2611
% 3.37/1.13 inst_num_of_duplicates: 0
% 3.37/1.13 inst_inst_num_from_inst_to_res: 0
% 3.37/1.13
% 3.37/1.13 inst_time_sim_new: 0.081
% 3.37/1.13 inst_time_sim_given: 0.
% 3.37/1.13 inst_time_dismatching_checking: 0.004
% 3.37/1.13 inst_time_total: 0.292
% 3.37/1.13
% 3.37/1.13 ------ Resolution
% 3.37/1.13
% 3.37/1.13 res_num_of_clauses: 109
% 3.37/1.13 res_num_in_passive: 0
% 3.37/1.13 res_num_in_active: 0
% 3.37/1.13 res_num_of_loops: 319
% 3.37/1.13 res_forward_subset_subsumed: 0
% 3.37/1.13 res_backward_subset_subsumed: 0
% 3.37/1.13 res_forward_subsumed: 0
% 3.37/1.13 res_backward_subsumed: 0
% 3.37/1.13 res_forward_subsumption_resolution: 0
% 3.37/1.13 res_backward_subsumption_resolution: 0
% 3.37/1.13 res_clause_to_clause_subsumption: 586
% 3.37/1.13 res_subs_bck_cnt: 4
% 3.37/1.13 res_orphan_elimination: 0
% 3.37/1.13 res_tautology_del: 0
% 3.37/1.13 res_num_eq_res_simplified: 0
% 3.37/1.13 res_num_sel_changes: 0
% 3.37/1.13 res_moves_from_active_to_pass: 0
% 3.37/1.13
% 3.37/1.13 res_time_sim_new: 0.005
% 3.37/1.13 res_time_sim_fw_given: 0.006
% 3.37/1.13 res_time_sim_bw_given: 0.004
% 3.37/1.13 res_time_total: 0.007
% 3.37/1.13
% 3.37/1.13 ------ Superposition
% 3.37/1.13
% 3.37/1.13 sup_num_of_clauses: undef
% 3.37/1.13 sup_num_in_active: undef
% 3.37/1.13 sup_num_in_passive: undef
% 3.37/1.13 sup_num_of_loops: 0
% 3.37/1.13 sup_fw_superposition: 0
% 3.37/1.13 sup_bw_superposition: 0
% 3.37/1.13 sup_eq_factoring: 0
% 3.37/1.13 sup_eq_resolution: 0
% 3.37/1.13 sup_immediate_simplified: 0
% 3.37/1.13 sup_given_eliminated: 0
% 3.37/1.13 comparisons_done: 262
% 3.37/1.13 comparisons_avoided: 0
% 3.37/1.13 comparisons_inc_criteria: 0
% 3.37/1.13 sup_deep_cl_discarded: 0
% 3.37/1.13 sup_num_of_deepenings: 0
% 3.37/1.13 sup_num_of_restarts: 0
% 3.37/1.13
% 3.37/1.13 sup_time_generating: 0.
% 3.37/1.13 sup_time_sim_fw_full: 0.
% 3.37/1.13 sup_time_sim_bw_full: 0.
% 3.37/1.13 sup_time_sim_fw_immed: 0.
% 3.37/1.13 sup_time_sim_bw_immed: 0.
% 3.37/1.13 sup_time_prep_sim_fw_input: 0.002
% 3.37/1.13 sup_time_prep_sim_bw_input: 0.005
% 3.37/1.13 sup_time_total: 0.
% 3.37/1.13
% 3.37/1.13 ------ Simplifications
% 3.37/1.13
% 3.37/1.13 sim_repeated: 0
% 3.37/1.13 sim_fw_subset_subsumed: 0
% 3.37/1.13 sim_bw_subset_subsumed: 0
% 3.37/1.13 sim_fw_subsumed: 0
% 3.37/1.13 sim_bw_subsumed: 0
% 3.37/1.13 sim_fw_subsumption_res: 0
% 3.37/1.13 sim_bw_subsumption_res: 0
% 3.37/1.13 sim_fw_unit_subs: 0
% 3.37/1.13 sim_bw_unit_subs: 0
% 3.37/1.13 sim_tautology_del: 0
% 3.37/1.13 sim_eq_tautology_del: 0
% 3.37/1.13 sim_eq_res_simp: 0
% 3.37/1.13 sim_fw_demodulated: 1
% 3.37/1.13 sim_bw_demodulated: 0
% 3.37/1.13 sim_encompassment_demod: 0
% 3.37/1.13 sim_light_normalised: 3
% 3.37/1.13 sim_ac_normalised: 0
% 3.37/1.13 sim_joinable_taut: 0
% 3.37/1.13 sim_joinable_simp: 0
% 3.37/1.13 sim_fw_ac_demod: 0
% 3.37/1.13 sim_bw_ac_demod: 0
% 3.37/1.13 sim_smt_subsumption: 0
% 3.37/1.13 sim_smt_simplified: 0
% 3.37/1.13 sim_ground_joinable: 0
% 3.37/1.13 sim_bw_ground_joinable: 0
% 3.37/1.13 sim_connectedness: 0
% 3.37/1.13
% 3.37/1.13 sim_time_fw_subset_subs: 0.
% 3.37/1.13 sim_time_bw_subset_subs: 0.
% 3.37/1.13 sim_time_fw_subs: 0.
% 3.37/1.13 sim_time_bw_subs: 0.
% 3.37/1.13 sim_time_fw_subs_res: 0.
% 3.37/1.13 sim_time_bw_subs_res: 0.
% 3.37/1.13 sim_time_fw_unit_subs: 0.
% 3.37/1.13 sim_time_bw_unit_subs: 0.
% 3.37/1.13 sim_time_tautology_del: 0.
% 3.37/1.13 sim_time_eq_tautology_del: 0.
% 3.37/1.13 sim_time_eq_res_simp: 0.
% 3.37/1.13 sim_time_fw_demod: 0.
% 3.37/1.13 sim_time_bw_demod: 0.
% 3.37/1.13 sim_time_light_norm: 0.
% 3.37/1.13 sim_time_joinable: 0.
% 3.37/1.13 sim_time_ac_norm: 0.
% 3.37/1.13 sim_time_fw_ac_demod: 0.
% 3.37/1.13 sim_time_bw_ac_demod: 0.
% 3.37/1.13 sim_time_smt_subs: 0.
% 3.37/1.13 sim_time_fw_gjoin: 0.
% 3.37/1.13 sim_time_fw_connected: 0.
% 3.37/1.13
% 3.37/1.13
%------------------------------------------------------------------------------