TSTP Solution File: GRA017+1 by iProver-SAT---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.8
% Problem : GRA017+1 : TPTP v8.1.2. Released v3.2.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 : Thu Aug 31 00:03:34 EDT 2023
% Result : CounterSatisfiable 3.16s 1.14s
% Output : Model 3.16s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of less_than
fof(lit_def,axiom,
! [X0,X1] :
( less_than(X0,X1)
<=> ( ( X0 = n12
& X1 = n13 )
| ( X0 = n11
& X1 = n12 )
| ( X0 = n11
& X1 = n13 )
| ( X0 = n10
& X1 = n12 )
| ( X0 = n10
& X1 = n13 )
| ( X0 = n10
& X1 = n11 )
| ( X0 = n9
& X1 = n12 )
| ( X0 = n9
& X1 = n13 )
| ( X0 = n9
& X1 = n11 )
| ( X0 = n9
& X1 = n10 )
| ( X0 = n8
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n8
& X1 = n9 )
| ( X0 = n7
& X1 != n13
& X1 != n11
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n7
& X1 = n13 )
| ( X0 = n7
& X1 = n11 )
| ( X0 = n7
& X1 = n8 )
| ( X0 = n6
& X1 != n13
& X1 != n11
& X1 != n9
& X1 != n8
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n6
& X1 = n13 )
| ( X0 = n6
& X1 = n11 )
| ( X0 = n6
& X1 = n9 )
| ( X0 = n6
& X1 = n8 )
| ( X0 = n6
& X1 = n7 )
| ( X0 = n5
& X1 != n13
& X1 != n11
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n5
& X1 = n13 )
| ( X0 = n5
& X1 = n11 )
| ( X0 = n5
& X1 = n9 )
| ( X0 = n5
& X1 = n8 )
| ( X0 = n5
& X1 = n7 )
| ( X0 = n5
& X1 = n6 )
| ( X0 = n4
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n4
& X1 = n8 )
| ( X0 = n4
& X1 = n7 )
| ( X0 = n4
& X1 = n6 )
| ( X0 = n4
& X1 = n5 )
| ( X0 = n3
& X1 != n12
& X1 != n13
& X1 != n11
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n3
& X1 = n12 )
| ( X0 = n3
& X1 = n13 )
| ( X0 = n3
& X1 = n11 )
| ( X0 = n3
& X1 = n9 )
| ( X0 = n3
& X1 = n8 )
| ( X0 = n3
& X1 = n7 )
| ( X0 = n3
& X1 = n6 )
| ( X0 = n3
& X1 = n5 )
| ( X0 = n3
& X1 = n4 )
| ( X0 = n2
& X1 != n12
& X1 != n13
& X1 != n11
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n2
& X1 != n1 )
| ( X0 = n2
& X1 = n12 )
| ( X0 = n2
& X1 = n13 )
| ( X0 = n2
& X1 = n11 )
| ( X0 = n2
& X1 = n9 )
| ( X0 = n2
& X1 = n8 )
| ( X0 = n2
& X1 = n7 )
| ( X0 = n2
& X1 = n6 )
| ( X0 = n2
& X1 = n5 )
| ( X0 = n2
& X1 = n4 )
| ( X0 = n2
& X1 = n3 )
| ( X0 = n1
& X1 != n12
& X1 != n13
& X1 != n11
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n1 )
| ( X0 = n1
& X1 = n12 )
| ( X0 = n1
& X1 = n13 )
| ( X0 = n1
& X1 = n11 )
| ( X0 = n1
& X1 = n9 )
| ( X0 = n1
& X1 = n8 )
| ( X0 = n1
& X1 = n7 )
| ( X0 = n1
& X1 = n6 )
| ( X0 = n1
& X1 = n5 )
| ( X0 = n1
& X1 = n4 )
| ( X0 = n1
& X1 = n3 )
| ( X0 = n1
& X1 = n2 ) ) ) ).
%------ Positive definition of goal
fof(lit_def_001,axiom,
( goal
<=> $false ) ).
%------ Positive definition of red
fof(lit_def_002,axiom,
! [X0,X1] :
( red(X0,X1)
<=> ( ( X0 = n10
& X1 = n11 )
| ( X0 = n9
& X1 = n13 )
| ( X0 = n8
& X1 != n12
& X1 != n13
& X1 != n11
& X1 != n10
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n8
& X1 = n12 )
| ( X0 = n8
& X1 = n13 )
| ( X0 = n8
& X1 = n11 )
| ( X0 = n8
& X1 = n10 )
| ( X0 = n7
& X1 != n12
& X1 != n13
& X1 != n11
& X1 != n10
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n7
& X1 = n12 )
| ( X0 = n7
& X1 = n11 )
| ( X0 = n7
& X1 = n10 )
| ( X0 = n7
& X1 = n9 )
| ( X0 = n6
& X1 != n12
& X1 != n13
& X1 != n11
& X1 != n10
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n6
& X1 = n12 )
| ( X0 = n6
& X1 = n10 )
| ( X0 = n5
& X1 = n12 )
| ( X0 = n5
& X1 = n13 )
| ( X0 = n5
& X1 = n11 )
| ( X0 = n5
& X1 = n9 )
| ( X0 = n5
& X1 = n8 )
| ( X0 = n5
& X1 = n7 )
| ( X0 = n4
& X1 = n12 )
| ( X0 = n4
& X1 = n13 )
| ( X0 = n4
& X1 = n11 )
| ( X0 = n4
& X1 = n9 )
| ( X0 = n4
& X1 = n8 )
| ( X0 = n4
& X1 = n7 )
| ( X0 = n4
& X1 = n6 )
| ( X0 = n3
& X1 != n12
& X1 != n13
& X1 != n11
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n3
& X1 = n12 )
| ( X0 = n3
& X1 = n13 )
| ( X0 = n3
& X1 = n9 )
| ( X0 = n3
& X1 = n8 )
| ( X0 = n2
& X1 != n12
& X1 != n13
& X1 != n11
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n2
& X1 = n11 )
| ( X0 = n2
& X1 = n9 )
| ( X0 = n2
& X1 = n6 )
| ( X0 = n2
& X1 = n5 )
| ( X0 = n2
& X1 = n4 )
| ( X0 = n2
& X1 = n3 )
| ( X0 = n1
& X1 = n12 )
| ( X0 = n1
& X1 = n6 )
| ( X0 = n1
& X1 = n5 )
| ( X0 = n1
& X1 = n3 )
| ( X0 = n1
& X1 = n2 ) ) ) ).
%------ Positive definition of green
fof(lit_def_003,axiom,
! [X0,X1] :
( green(X0,X1)
<=> ( ( X0 = n12
& X1 = n13 )
| ( X0 = n11
& X1 = n12 )
| ( X0 = n11
& X1 = n13 )
| ( X0 = n10
& X1 = n12 )
| ( X0 = n10
& X1 = n13 )
| ( X0 = n9
& X1 = n12 )
| ( X0 = n9
& X1 = n11 )
| ( X0 = n9
& X1 = n10 )
| ( X0 = n8
& X1 = n9 )
| ( X0 = n7
& X1 = n13 )
| ( X0 = n7
& X1 = n8 )
| ( X0 = n6
& X1 = n13 )
| ( X0 = n6
& X1 = n11 )
| ( X0 = n6
& X1 = n9 )
| ( X0 = n6
& X1 = n8 )
| ( X0 = n6
& X1 = n7 )
| ( X0 = n5
& X1 != n12
& X1 != n13
& X1 != n11
& X1 != n10
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n5
& X1 = n10 )
| ( X0 = n5
& X1 = n6 )
| ( X0 = n4
& X1 != n12
& X1 != n13
& X1 != n11
& X1 != n10
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n4
& X1 = n10 )
| ( X0 = n4
& X1 = n5 )
| ( X0 = n3
& X1 = n11 )
| ( X0 = n3
& X1 = n7 )
| ( X0 = n3
& X1 = n6 )
| ( X0 = n3
& X1 = n5 )
| ( X0 = n3
& X1 = n4 )
| ( X0 = n2
& X1 = n12 )
| ( X0 = n2
& X1 = n13 )
| ( X0 = n2
& X1 = n8 )
| ( X0 = n2
& X1 = n7 )
| ( X0 = n1
& X1 != n12
& X1 != n13
& X1 != n11
& X1 != n10
& X1 != n9
& X1 != n8
& X1 != n7
& X1 != n6
& X1 != n5
& X1 != n4
& X1 != n3
& X1 != n2
& X1 != n1 )
| ( X0 = n1
& X1 = n13 )
| ( X0 = n1
& X1 = n11 )
| ( X0 = n1
& X1 = n10 )
| ( X0 = n1
& X1 = n9 )
| ( X0 = n1
& X1 = n8 )
| ( X0 = n1
& X1 = n7 )
| ( X0 = n1
& X1 = n4 ) ) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRA017+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d SAT
% 0.15/0.34 % Computer : n008.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Sun Aug 27 03:17:03 EDT 2023
% 0.15/0.34 % CPUTime :
% 0.19/0.46 Running model finding
% 0.19/0.46 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.16/1.14 % SZS status Started for theBenchmark.p
% 3.16/1.14 % SZS status CounterSatisfiable for theBenchmark.p
% 3.16/1.14
% 3.16/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.16/1.14
% 3.16/1.14 ------ iProver source info
% 3.16/1.14
% 3.16/1.14 git: date: 2023-05-31 18:12:56 +0000
% 3.16/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.16/1.14 git: non_committed_changes: false
% 3.16/1.14 git: last_make_outside_of_git: false
% 3.16/1.14
% 3.16/1.14 ------ Parsing...
% 3.16/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 3.16/1.14
% 3.16/1.14
% 3.16/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 3.16/1.14
% 3.16/1.14 ------ Preprocessing...------ preprocesses with Option_epr_non_horn_non_eq
% 3.16/1.14 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.16/1.14 ------ Proving...
% 3.16/1.14 ------ Problem Properties
% 3.16/1.14
% 3.16/1.14
% 3.16/1.14 clauses 17
% 3.16/1.14 conjectures 0
% 3.16/1.14 EPR 17
% 3.16/1.14 Horn 16
% 3.16/1.14 unary 12
% 3.16/1.14 binary 1
% 3.16/1.14 lits 32
% 3.16/1.14 lits eq 0
% 3.16/1.14 fd_pure 0
% 3.16/1.14 fd_pseudo 0
% 3.16/1.14 fd_cond 0
% 3.16/1.14 fd_pseudo_cond 0
% 3.16/1.14 AC symbols 0
% 3.16/1.14
% 3.16/1.14 ------ Schedule EPR non Horn non eq is on
% 3.16/1.14
% 3.16/1.14 ------ no conjectures: strip conj schedule
% 3.16/1.14
% 3.16/1.14 ------ no equalities: superposition off
% 3.16/1.14
% 3.16/1.14 ------ Input Options "--resolution_flag false" stripped conjectures Time Limit: 70.
% 3.16/1.14
% 3.16/1.14
% 3.16/1.14 ------
% 3.16/1.14 Current options:
% 3.16/1.14 ------
% 3.16/1.14
% 3.16/1.14
% 3.16/1.14
% 3.16/1.14
% 3.16/1.14 ------ Proving...
% 3.16/1.14
% 3.16/1.14
% 3.16/1.14 % SZS status CounterSatisfiable for theBenchmark.p
% 3.16/1.14
% 3.16/1.14 ------ Building Model...Done
% 3.16/1.14
% 3.16/1.14 %------ The model is defined over ground terms (initial term algebra).
% 3.16/1.14 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.16/1.14 %------ where \phi is a formula over the term algebra.
% 3.16/1.14 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.16/1.14 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.16/1.14 %------ See help for --sat_out_model for different model outputs.
% 3.16/1.14 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.16/1.14 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.16/1.14 % SZS output start Model for theBenchmark.p
% See solution above
% 3.16/1.15 ------ Statistics
% 3.16/1.15
% 3.16/1.15 ------ Problem properties
% 3.16/1.15
% 3.16/1.15 clauses: 17
% 3.16/1.15 conjectures: 0
% 3.16/1.15 epr: 17
% 3.16/1.15 horn: 16
% 3.16/1.15 ground: 12
% 3.16/1.15 unary: 12
% 3.16/1.15 binary: 1
% 3.16/1.15 lits: 32
% 3.16/1.15 lits_eq: 0
% 3.16/1.15 fd_pure: 0
% 3.16/1.15 fd_pseudo: 0
% 3.16/1.15 fd_cond: 0
% 3.16/1.15 fd_pseudo_cond: 0
% 3.16/1.15 ac_symbols: 0
% 3.16/1.15
% 3.16/1.15 ------ General
% 3.16/1.15
% 3.16/1.15 abstr_ref_over_cycles: 0
% 3.16/1.15 abstr_ref_under_cycles: 0
% 3.16/1.15 gc_basic_clause_elim: 0
% 3.16/1.15 num_of_symbols: 113
% 3.16/1.15 num_of_terms: 1576
% 3.16/1.15
% 3.16/1.15 parsing_time: 0.009
% 3.16/1.15 unif_index_cands_time: 0.008
% 3.16/1.15 unif_index_add_time: 0.004
% 3.16/1.15 orderings_time: 0.
% 3.16/1.15 out_proof_time: 0.
% 3.16/1.15 total_time: 0.367
% 3.16/1.15
% 3.16/1.15 ------ Preprocessing
% 3.16/1.15
% 3.16/1.15 num_of_splits: 0
% 3.16/1.15 num_of_split_atoms: 0
% 3.16/1.15 num_of_reused_defs: 0
% 3.16/1.15 num_eq_ax_congr_red: 0
% 3.16/1.15 num_of_sem_filtered_clauses: 1
% 3.16/1.15 num_of_subtypes: 0
% 3.16/1.15 monotx_restored_types: 0
% 3.16/1.15 sat_num_of_epr_types: 0
% 3.16/1.15 sat_num_of_non_cyclic_types: 0
% 3.16/1.15 sat_guarded_non_collapsed_types: 0
% 3.16/1.15 num_pure_diseq_elim: 0
% 3.16/1.15 simp_replaced_by: 0
% 3.16/1.15 res_preprocessed: 0
% 3.16/1.15 sup_preprocessed: 0
% 3.16/1.15 prep_upred: 0
% 3.16/1.15 prep_unflattend: 0
% 3.16/1.15 prep_well_definedness: 0
% 3.16/1.15 smt_new_axioms: 0
% 3.16/1.15 pred_elim_cands: 3
% 3.16/1.15 pred_elim: 0
% 3.16/1.15 pred_elim_cl: 0
% 3.16/1.15 pred_elim_cycles: 2
% 3.16/1.15 merged_defs: 0
% 3.16/1.15 merged_defs_ncl: 0
% 3.16/1.15 bin_hyper_res: 0
% 3.16/1.15 prep_cycles: 2
% 3.16/1.15
% 3.16/1.15 splitting_time: 0.
% 3.16/1.15 sem_filter_time: 0.
% 3.16/1.15 monotx_time: 0.
% 3.16/1.15 subtype_inf_time: 0.
% 3.16/1.15 res_prep_time: 0.006
% 3.16/1.15 sup_prep_time: 0.
% 3.16/1.15 pred_elim_time: 0.
% 3.16/1.15 bin_hyper_res_time: 0.
% 3.16/1.15 prep_time_total: 0.008
% 3.16/1.15
% 3.16/1.15 ------ Propositional Solver
% 3.16/1.15
% 3.16/1.15 prop_solver_calls: 23
% 3.16/1.15 prop_fast_solver_calls: 1201
% 3.16/1.15 smt_solver_calls: 0
% 3.16/1.15 smt_fast_solver_calls: 0
% 3.16/1.15 prop_num_of_clauses: 3376
% 3.16/1.15 prop_preprocess_simplified: 6040
% 3.16/1.15 prop_fo_subsumed: 6
% 3.16/1.15
% 3.16/1.15 prop_solver_time: 0.001
% 3.16/1.15 prop_fast_solver_time: 0.001
% 3.16/1.15 prop_unsat_core_time: 0.
% 3.16/1.15 smt_solver_time: 0.
% 3.16/1.15 smt_fast_solver_time: 0.
% 3.16/1.15
% 3.16/1.15 ------ QBF
% 3.16/1.15
% 3.16/1.15 qbf_q_res: 0
% 3.16/1.15 qbf_num_tautologies: 0
% 3.16/1.15 qbf_prep_cycles: 0
% 3.16/1.15
% 3.16/1.15 ------ BMC1
% 3.16/1.15
% 3.16/1.15 bmc1_current_bound: -1
% 3.16/1.15 bmc1_last_solved_bound: -1
% 3.16/1.15 bmc1_unsat_core_size: -1
% 3.16/1.15 bmc1_unsat_core_parents_size: -1
% 3.16/1.15 bmc1_merge_next_fun: 0
% 3.16/1.15
% 3.16/1.15 bmc1_unsat_core_clauses_time: 0.
% 3.16/1.15
% 3.16/1.15 ------ Instantiation
% 3.16/1.15
% 3.16/1.15 inst_num_of_clauses: 2345
% 3.16/1.15 inst_num_in_passive: 0
% 3.16/1.15 inst_num_in_active: 2345
% 3.16/1.15 inst_num_of_loops: 2846
% 3.16/1.15 inst_num_in_unprocessed: 0
% 3.16/1.15 inst_num_of_learning_restarts: 0
% 3.16/1.15 inst_num_moves_active_passive: 487
% 3.16/1.15 inst_lit_activity: 0
% 3.16/1.15 inst_lit_activity_moves: 0
% 3.16/1.15 inst_num_tautologies: 0
% 3.16/1.15 inst_num_prop_implied: 0
% 3.16/1.15 inst_num_existing_simplified: 0
% 3.16/1.15 inst_num_eq_res_simplified: 0
% 3.16/1.15 inst_num_child_elim: 0
% 3.16/1.15 inst_num_of_dismatching_blockings: 2379
% 3.16/1.15 inst_num_of_non_proper_insts: 3581
% 3.16/1.15 inst_num_of_duplicates: 0
% 3.16/1.15 inst_inst_num_from_inst_to_res: 0
% 3.16/1.15
% 3.16/1.15 inst_time_sim_new: 0.065
% 3.16/1.15 inst_time_sim_given: 0.
% 3.16/1.15 inst_time_dismatching_checking: 0.014
% 3.16/1.15 inst_time_total: 0.181
% 3.16/1.15
% 3.16/1.15 ------ Resolution
% 3.16/1.15
% 3.16/1.15 res_num_of_clauses: 17
% 3.16/1.15 res_num_in_passive: 0
% 3.16/1.15 res_num_in_active: 0
% 3.16/1.15 res_num_of_loops: 37
% 3.16/1.15 res_forward_subset_subsumed: 2
% 3.16/1.15 res_backward_subset_subsumed: 0
% 3.16/1.15 res_forward_subsumed: 0
% 3.16/1.15 res_backward_subsumed: 0
% 3.16/1.15 res_forward_subsumption_resolution: 0
% 3.16/1.15 res_backward_subsumption_resolution: 0
% 3.16/1.15 res_clause_to_clause_subsumption: 1065
% 3.16/1.15 res_subs_bck_cnt: 12
% 3.16/1.15 res_orphan_elimination: 0
% 3.16/1.15 res_tautology_del: 128
% 3.16/1.15 res_num_eq_res_simplified: 0
% 3.16/1.15 res_num_sel_changes: 0
% 3.16/1.15 res_moves_from_active_to_pass: 0
% 3.16/1.15
% 3.16/1.15 res_time_sim_new: 0.
% 3.16/1.15 res_time_sim_fw_given: 0.
% 3.16/1.15 res_time_sim_bw_given: 0.
% 3.16/1.15 res_time_total: 0.005
% 3.16/1.15
% 3.16/1.15 ------ Superposition
% 3.16/1.15
% 3.16/1.15 sup_num_of_clauses: 430
% 3.16/1.15 sup_num_in_active: 272
% 3.16/1.15 sup_num_in_passive: 158
% 3.16/1.15 sup_num_of_loops: 523
% 3.16/1.15 sup_fw_superposition: 578
% 3.16/1.15 sup_bw_superposition: 437
% 3.16/1.15 sup_eq_factoring: 0
% 3.16/1.15 sup_eq_resolution: 0
% 3.16/1.15 sup_immediate_simplified: 0
% 3.16/1.15 sup_given_eliminated: 0
% 3.16/1.15 comparisons_done: 244
% 3.16/1.15 comparisons_avoided: 0
% 3.16/1.15 comparisons_inc_criteria: 0
% 3.16/1.15 sup_deep_cl_discarded: 0
% 3.16/1.15 sup_num_of_deepenings: 0
% 3.16/1.15 sup_num_of_restarts: 1
% 3.16/1.15
% 3.16/1.15 sup_time_generating: 0.007
% 3.16/1.15 sup_time_sim_fw_full: 0.01
% 3.16/1.15 sup_time_sim_bw_full: 0.058
% 3.16/1.15 sup_time_sim_fw_immed: 0.002
% 3.16/1.15 sup_time_sim_bw_immed: 0.015
% 3.16/1.15 sup_time_prep_sim_fw_input: 0.
% 3.16/1.15 sup_time_prep_sim_bw_input: 0.
% 3.16/1.15 sup_time_total: 0.127
% 3.16/1.15
% 3.16/1.15 ------ Simplifications
% 3.16/1.15
% 3.16/1.15 sim_repeated: 349
% 3.16/1.15 sim_fw_subset_subsumed: 0
% 3.16/1.15 sim_bw_subset_subsumed: 0
% 3.16/1.15 sim_fw_subsumed: 0
% 3.16/1.15 sim_bw_subsumed: 0
% 3.16/1.15 sim_fw_subsumption_res: 0
% 3.16/1.15 sim_bw_subsumption_res: 0
% 3.16/1.15 sim_fw_unit_subs: 0
% 3.16/1.15 sim_bw_unit_subs: 0
% 3.16/1.15 sim_tautology_del: 1
% 3.16/1.15 sim_eq_tautology_del: 0
% 3.16/1.15 sim_eq_res_simp: 0
% 3.16/1.15 sim_fw_demodulated: 0
% 3.16/1.15 sim_bw_demodulated: 0
% 3.16/1.15 sim_encompassment_demod: 0
% 3.16/1.15 sim_light_normalised: 0
% 3.16/1.15 sim_ac_normalised: 0
% 3.16/1.15 sim_joinable_taut: 0
% 3.16/1.15 sim_joinable_simp: 0
% 3.16/1.15 sim_fw_ac_demod: 0
% 3.16/1.15 sim_bw_ac_demod: 0
% 3.16/1.15 sim_smt_subsumption: 0
% 3.16/1.15 sim_smt_simplified: 0
% 3.16/1.15 sim_ground_joinable: 0
% 3.16/1.15 sim_bw_ground_joinable: 0
% 3.16/1.15 sim_connectedness: 0
% 3.16/1.15
% 3.16/1.15 sim_time_fw_subset_subs: 0.
% 3.16/1.15 sim_time_bw_subset_subs: 0.
% 3.16/1.15 sim_time_fw_subs: 0.001
% 3.16/1.15 sim_time_bw_subs: 0.005
% 3.16/1.15 sim_time_fw_subs_res: 0.007
% 3.16/1.15 sim_time_bw_subs_res: 0.
% 3.16/1.15 sim_time_fw_unit_subs: 0.001
% 3.16/1.15 sim_time_bw_unit_subs: 0.
% 3.16/1.15 sim_time_tautology_del: 0.
% 3.16/1.15 sim_time_eq_tautology_del: 0.
% 3.16/1.15 sim_time_eq_res_simp: 0.
% 3.16/1.15 sim_time_fw_demod: 0.
% 3.16/1.15 sim_time_bw_demod: 0.
% 3.16/1.15 sim_time_light_norm: 0.
% 3.16/1.15 sim_time_joinable: 0.
% 3.16/1.15 sim_time_ac_norm: 0.
% 3.16/1.15 sim_time_fw_ac_demod: 0.
% 3.16/1.15 sim_time_bw_ac_demod: 0.
% 3.16/1.15 sim_time_smt_subs: 0.
% 3.16/1.15 sim_time_fw_gjoin: 0.
% 3.16/1.15 sim_time_fw_connected: 0.
% 3.16/1.15
% 3.16/1.15
%------------------------------------------------------------------------------