%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN720-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 03:41:28 PM UTC 2026
% Result : Satisfiable 2.41s 1.24s
% Output : Model 2.41s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of s0
fof(lit_def,axiom,
! [X0] :
( s0(X0)
<=> ( X0 = b
| X0 = d ) ) ).
%------ Positive definition of q0
fof(lit_def_001,axiom,
! [X0,X1] :
( q0(X0,X1)
<=> ( ( X0 != c
& X1 = d )
| ( X1 = d
& X0 = c )
| ( X1 = b
& X0 = b )
| ( X1 = e
& X0 = b )
| ( X1 = b
& X0 = a )
| ( X1 = d
& X0 = e )
| ( X1 = c
& X0 = d )
| ( X1 = b
& X0 = d )
| ( X1 = d
& X0 = d ) ) ) ).
%------ Positive definition of n0
fof(lit_def_002,axiom,
! [X0,X1] :
( n0(X0,X1)
<=> ( ( X1 = d
& X0 = c )
| ( X1 = a
& X0 = b )
| ( X1 = b
& X0 = a )
| ( X1 = b
& X0 = e )
| ( X1 = e
& X0 = e )
| ( X1 = c
& X0 = d )
| ( X1 = b
& X0 = d )
| ( X1 = e
& X0 = d ) ) ) ).
%------ Positive definition of m0
fof(lit_def_003,axiom,
! [X0,X1,X2] :
( m0(X0,X1,X2)
<=> ( ( X0 != d
& X2 = d
& X1 = d )
| ( X2 != d
& X0 != d
& X1 = d )
| ( X2 = a
& X1 = b
& X0 = c )
| ( X2 = e
& X1 = b
& X0 = b )
| ( X2 = a
& X1 = a
& X0 = b )
| ( X2 = a
& X0 = a )
| ( X2 = e
& X1 = e
& X0 = a )
| ( X2 = c
& X1 = b
& X0 = e )
| ( X2 = a
& X1 = d
& X0 = e )
| ( X2 = e
& X1 = d
& X0 = e )
| ( X2 = c
& X1 = e
& X0 = d )
| ( X2 = d
& X1 = d
& X0 = d )
| ( X2 != d
& X1 = d
& X0 = d ) ) ) ).
%------ Positive definition of r0
fof(lit_def_004,axiom,
! [X0] :
( r0(X0)
<=> ( X0 = b
| X0 = e ) ) ).
%------ Positive definition of p0
fof(lit_def_005,axiom,
! [X0,X1] :
( p0(X0,X1)
<=> ( ( X1 = b
& X0 = c )
| ( X1 = c
& X0 = b )
| ( X1 = e
& X0 = b )
| ( X1 = d
& X0 = b )
| ( X1 != e
& X0 = b ) ) ) ).
%------ Positive definition of l0
fof(lit_def_006,axiom,
! [X0] :
( l0(X0)
<=> ( X0 = c
| X0 = a ) ) ).
%------ Positive definition of k0
fof(lit_def_007,axiom,
! [X0] :
( k0(X0)
<=> ( X0 = b
| X0 = e ) ) ).
%------ Positive definition of k1
fof(lit_def_008,axiom,
! [X0] :
( k1(X0)
<=> $true ) ).
%------ Positive definition of l1
fof(lit_def_009,axiom,
! [X0,X1] :
( l1(X0,X1)
<=> ( ( X0 != d
& X1 = X0 )
| ( X1 = c
& X0 = c )
| ( X1 = b
& X0 = b )
| ( X1 = a
& X0 = a )
| ( X1 = e
& X0 = e )
| ( X1 = d
& X0 = e )
| ( X1 = d
& X0 = d )
| ( X1 != d
& ( X1 != c
| X0 != e ) ) ) ) ).
%------ Positive definition of m1
fof(lit_def_010,axiom,
! [X0,X1,X2] :
( m1(X0,X1,X2)
<=> ( ( ( X1 != e
| X0 != e )
& X2 = X1 )
| ( X1 != e
& X2 = X0 )
| ( X2 = X0
& X1 = c )
| ( X0 != e
& X2 = X0
& X1 = X0 )
| ( ( X2 != e
| X0 != e )
& X1 = X0 )
| ( X2 = X0
& X1 = a )
| X1 = a
| ( X2 = X0
& X1 = e )
| ( X2 = d
& X1 = d )
| ( X1 != b
& X1 != e
& X2 = c
& X0 = c )
| ( X2 = c
& X1 = c
& X0 = c )
| ( X2 = c
& X1 = b
& X0 = c )
| ( X2 = c
& X1 = e
& X0 = c )
| ( X2 = b
& X1 = b
& X0 = b )
| ( X2 = b
& X1 = e
& X0 = b )
| ( X1 != e
& X2 = a
& X0 = a )
| ( X2 = a
& X1 = a
& X0 = a )
| ( X2 = a
& X1 = e
& X0 = a )
| ( X2 = b
& X1 = b
& X0 = e )
| ( X2 = e
& X1 = e
& X0 = e ) ) ) ).
%------ Positive definition of n1
fof(lit_def_011,axiom,
! [X0,X1,X2] :
( n1(X0,X1,X2)
<=> ( X2 = X1
| X2 = X0
| ( X2 = X0
& X1 = c )
| ( X2 = X0
& X1 = X0 )
| X1 = X0
| ( X2 = e
& X1 = e )
| ( X2 = c
& X1 = c
& X0 = c )
| ( X2 = b
& X0 = a )
| ( X1 = e
& X0 = e )
| ( X2 = e
& X1 = e
& X0 = d )
| ( X2 = b
& X1 = d
& X0 = d )
| ( X2 = d
& X1 = d
& X0 = d ) ) ) ).
%------ Positive definition of p1
fof(lit_def_012,axiom,
! [X0,X1,X2] :
( p1(X0,X1,X2)
<=> $true ) ).
%------ Positive definition of q1
fof(lit_def_013,axiom,
! [X0,X1,X2] :
( q1(X0,X1,X2)
<=> ( X2 = X1
| X2 = X0
| ( X2 = X0
& X1 = X0 )
| X1 = X0
| ( X2 = b
& X1 = b )
| ( X2 = b
& X1 = b
& X0 = b )
| ( X2 = X1
& X0 = e )
| ( X2 = c
& X1 = d
& X0 = d )
| ( X2 = d
& X1 = d
& X0 = d ) ) ) ).
%------ Positive definition of r1
fof(lit_def_014,axiom,
! [X0] :
( r1(X0)
<=> $true ) ).
%------ Positive definition of s1
fof(lit_def_015,axiom,
! [X0] :
( s1(X0)
<=> ( X0 = c
| X0 != c ) ) ).
%------ Positive definition of k2
fof(lit_def_016,axiom,
! [X0,X1] :
( k2(X0,X1)
<=> ( X1 = c
| X1 = X0
| X1 = a
| ( X1 = b
& X0 = c )
| ( X1 = e
& X0 = e )
| ( X1 != c
& X1 != a
& ( X1 != b
| X0 != c ) ) ) ) ).
%------ Positive definition of l2
fof(lit_def_017,axiom,
! [X0,X1] :
( l2(X0,X1)
<=> ( X1 = X0
| X1 != a
| X0 != c ) ) ).
%------ Positive definition of m2
fof(lit_def_018,axiom,
! [X0] :
( m2(X0)
<=> $true ) ).
%------ Positive definition of n2
fof(lit_def_019,axiom,
! [X0] :
( n2(X0)
<=> $true ) ).
%------ Positive definition of p2
fof(lit_def_020,axiom,
! [X0,X1,X2] :
( p2(X0,X1,X2)
<=> ( ( ( X1 != a
| X0 != c )
& X2 = X1 )
| X2 = X0
| ( X2 = X0
& X1 = X0 )
| ( X2 = X0
& X1 = a )
| ( X2 = X0
& X1 = e )
| X1 = e
| ( X2 = a
& X1 = a
& X0 = c )
| ( X2 = e
& X1 = e
& X0 = c )
| ( X2 = c
& X1 = c
& X0 = b )
| ( X2 = a
& X1 = c
& X0 = b )
| ( X2 = a
& X1 = a
& X0 = a )
| ( X2 = c
& X1 = c
& X0 = e )
| ( X2 = e
& X1 = e
& X0 = e )
| X0 = e
| ( X2 = b
& X1 = b
& X0 = d )
| ( X2 = d
& X1 = d
& X0 = d ) ) ) ).
%------ Positive definition of q2
fof(lit_def_021,axiom,
! [X0,X1,X2] :
( q2(X0,X1,X2)
<=> ( X2 = X1
| ( ( X1 != a
| X0 != b )
& X2 = X0 )
| X1 = c
| ( X2 = X0
& X1 = X0 )
| X1 = X0
| ( X2 = b
& X1 = a
& X0 = b ) ) ) ).
%------ Positive definition of r2
fof(lit_def_022,axiom,
! [X0] :
( r2(X0)
<=> ( X0 = c
| X0 = a ) ) ).
%------ Positive definition of s2
fof(lit_def_023,axiom,
! [X0] :
( s2(X0)
<=> ( X0 = a
| X0 = d
| X0 != a ) ) ).
%------ Positive definition of k3
fof(lit_def_024,axiom,
! [X0,X1,X2] :
( k3(X0,X1,X2)
<=> ( ( X1 != a
& ( X1 != c
| X0 != a )
& X2 = X0 )
| ( X2 = X0
& X1 = X0 )
| X1 = X0
| ( X0 != a
& X2 = X0
& X1 = a )
| ( X2 = c
& X1 = c
& X0 = c )
| ( X2 = a
& X1 = c
& X0 = a )
| ( X2 = a
& X1 = a
& X0 = a )
| ( X2 = d
& X1 = d
& X0 = d ) ) ) ).
%------ Positive definition of l3
fof(lit_def_025,axiom,
! [X0,X1] :
( l3(X0,X1)
<=> $true ) ).
%------ Positive definition of m3
fof(lit_def_026,axiom,
! [X0,X1,X2] :
( m3(X0,X1,X2)
<=> ( X2 = X1
| X2 = X0
| ( X2 = X0
& X1 = c )
| ( X2 = c
& X1 = X0 )
| ( X2 = X0
& X1 = X0 )
| ( X0 != c
& X0 != a
& X2 = a
& X1 = X0 )
| ( X2 = e
& X1 = e )
| ( X2 = c
& X0 = c )
| ( X2 = c
& X1 = c
& X0 = c )
| ( X2 = a
& X1 = c
& X0 = c )
| ( X2 = d
& X1 = b
& X0 = c )
| ( X2 = b
& X1 = b
& X0 = b )
| ( X1 != c
& X2 = a
& X0 = a )
| ( X2 = a
& X1 = c
& X0 = a )
| ( X2 = a
& X1 = a
& X0 = a ) ) ) ).
%------ Positive definition of n3
fof(lit_def_027,axiom,
! [X0] :
( n3(X0)
<=> $true ) ).
%------ Positive definition of p3
fof(lit_def_028,axiom,
! [X0,X1,X2] :
( p3(X0,X1,X2)
<=> $true ) ).
%------ Positive definition of q3
fof(lit_def_029,axiom,
! [X0,X1] :
( q3(X0,X1)
<=> $true ) ).
%------ Positive definition of r3
fof(lit_def_030,axiom,
! [X0,X1,X2] :
( r3(X0,X1,X2)
<=> ( ( X0 != a
& X2 = X1 )
| ( ( X1 != c
| X0 != a )
& ( X1 != b
| X0 != d )
& X2 = c )
| X2 = X0
| ( X2 = X0
& X1 = X0 )
| X1 = X0
| ( X2 = X0
& X1 = b )
| ( X2 = a
& X0 = c )
| ( X2 = c
& X1 = c
& X0 = c )
| ( X1 != a
& X2 = a
& X0 = a )
| ( X2 = c
& X1 = c
& X0 = a )
| ( X2 = a
& X1 = a
& X0 = a )
| ( X2 = e
& X1 = a
& X0 = a )
| ( X2 = c
& X1 = b
& X0 = d ) ) ) ).
%------ Positive definition of s3
fof(lit_def_031,axiom,
! [X0,X1] :
( s3(X0,X1)
<=> ( ( X0 != a
& X1 = c )
| ( X0 != a
& X1 = a )
| ( X0 != a
& X1 = e )
| ( X1 = c
& X0 = a )
| ( X1 = a
& X0 = a )
| ( X1 = e
& X0 = a )
| X0 = a
| X0 != a ) ) ).
%------ Positive definition of k4
fof(lit_def_032,axiom,
! [X0] :
( k4(X0)
<=> ( X0 = c
| X0 = e ) ) ).
%------ Positive definition of l4
fof(lit_def_033,axiom,
! [X0] :
( l4(X0)
<=> $true ) ).
%------ Positive definition of m4
fof(lit_def_034,axiom,
! [X0,X1] :
( m4(X0,X1)
<=> ( X0 = c
| X0 = a
| X0 = e
| ( X0 != c
& X0 != a
& X0 != e ) ) ) ).
%------ Positive definition of n4
fof(lit_def_035,axiom,
! [X0,X1] :
( n4(X0,X1)
<=> $true ) ).
%------ Positive definition of p4
fof(lit_def_036,axiom,
! [X0,X1,X2] :
( p4(X0,X1,X2)
<=> ( X2 = X1
| X2 = X0
| ( X2 = X0
& X1 = X0 )
| X1 = X0
| ( X2 = c
& X1 = c
& X0 = c )
| ( X2 = a
& X1 = c
& X0 = c ) ) ) ).
%------ Positive definition of q4
fof(lit_def_037,axiom,
! [X0,X1] :
( q4(X0,X1)
<=> $true ) ).
%------ Positive definition of r4
fof(lit_def_038,axiom,
! [X0] :
( r4(X0)
<=> $true ) ).
%------ Positive definition of s4
fof(lit_def_039,axiom,
! [X0] :
( s4(X0)
<=> $true ) ).
%------ Positive definition of k5
fof(lit_def_040,axiom,
! [X0] :
( k5(X0)
<=> $true ) ).
%------ Positive definition of l5
fof(lit_def_041,axiom,
! [X0] :
( l5(X0)
<=> $true ) ).
%------ Positive definition of m5
fof(lit_def_042,axiom,
! [X0,X1] :
( m5(X0,X1)
<=> $true ) ).
%------ Positive definition of n5
fof(lit_def_043,axiom,
! [X0,X1] :
( n5(X0,X1)
<=> $true ) ).
%------ Positive definition of p5
fof(lit_def_044,axiom,
! [X0,X1,X2] :
( p5(X0,X1,X2)
<=> ( X2 = X1
| X2 = X0
| X1 = X0
| ( X2 = b
& X1 = b
& X0 = b ) ) ) ).
%------ Positive definition of q5
fof(lit_def_045,axiom,
! [X0,X1] :
( q5(X0,X1)
<=> $true ) ).
%------ Positive definition of r5
fof(lit_def_046,axiom,
! [X0,X1] :
( r5(X0,X1)
<=> $true ) ).
%------ Positive definition of s5
fof(lit_def_047,axiom,
! [X0] :
( s5(X0)
<=> $true ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN720-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.38 % Computer : n015.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Fri Sep 25 02:13:43 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.42 Running EPR theorem proving
% 0.13/0.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s epr_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.43
% 0.13/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.43
% 0.13/0.43 % Detected problem language: tptp
% 0.13/0.44 % Proving...
% 2.41/1.24 WARNING - Could not infer the problem pformat. Setting FOF as default
% 2.41/1.24 % SZS status Started for theBenchmark.p
% 2.41/1.24 % SZS status Satisfiable for theBenchmark.p
% 2.41/1.24
% 2.41/1.24 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.41/1.24
% 2.41/1.24 ------ iProver source info
% 2.41/1.24
% 2.41/1.24 git: date: 2026-07-19 20:42:38 +0200
% 2.41/1.24 git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.41/1.24 git: non_committed_changes: false
% 2.41/1.24
% 2.41/1.24 ------ Parsing...successful
% 2.41/1.24
% 2.41/1.24
% 2.41/1.24 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 2.41/1.24
% 2.41/1.24 ------ Proving...
% 2.41/1.24 ------ Problem Properties
% 2.41/1.24
% 2.41/1.24
% 2.41/1.24 clauses 361
% 2.41/1.24 conjectures 0
% 2.41/1.24 EPR 361
% 2.41/1.24 Horn 361
% 2.41/1.24 unary 38
% 2.41/1.24 binary 93
% 2.41/1.24 lits 1034
% 2.41/1.24 lits eq 0
% 2.41/1.24 fd_pure 0
% 2.41/1.24 fd_pseudo 0
% 2.41/1.24 fd_cond 0
% 2.41/1.24 fd_pseudo_cond 0
% 2.41/1.24 AC symbols 0
% 2.41/1.24
% 2.41/1.24 ------ Schedule EPR Horn non eq is on
% 2.41/1.24
% 2.41/1.24 ------ no conjectures: strip conj schedule
% 2.41/1.24
% 2.41/1.24 ------ no equalities: superposition off
% 2.41/1.24
% 2.41/1.24 ------ Option_epr_horn stripped conjectures Time Limit: Unbounded
% 2.41/1.24
% 2.41/1.24
% 2.41/1.24 ------
% 2.41/1.24 Current options:
% 2.41/1.24 ------
% 2.41/1.24
% 2.41/1.24 ------ Input Options
% 2.41/1.24
% 2.41/1.24 --out_options all
% 2.41/1.24 --tptp_safe_out true
% 2.41/1.24 --problem_path ""
% 2.41/1.24 --include_path ""
% 2.41/1.24 --clausifier res/vclausify_rel
% 2.41/1.24 --clausifier_options --mode clausify -t 101.67 -updr off
% 2.41/1.24 --stdin false
% 2.41/1.24 --proof_out true
% 2.41/1.24 --proof_dot_file ""
% 2.41/1.24 --proof_reduce_dot []
% 2.41/1.24 --suppress_sat_res false
% 2.41/1.24 --suppress_unsat_res true
% 2.41/1.24 --stats_out none
% 2.41/1.24 --stats_mem false
% 2.41/1.24 --theory_stats_out false
% 2.41/1.24
% 2.41/1.24 ------ General Options
% 2.41/1.24
% 2.41/1.24 --fof false
% 2.41/1.24 --time_out_real 305.
% 2.41/1.24 --time_out_virtual -1.
% 2.41/1.24 --rnd_seed 13
% 2.41/1.24 --symbol_type_check false
% 2.41/1.24 --clausify_out false
% 2.41/1.24 --sig_cnt_out false
% 2.41/1.24 --trig_cnt_out false
% 2.41/1.24 --trig_cnt_out_tolerance 1.
% 2.41/1.24 --trig_cnt_out_sk_spl false
% 2.41/1.24 --abstr_cl_out false
% 2.41/1.24
% 2.41/1.24 ------ Interactive Mode
% 2.41/1.24
% 2.41/1.24 --interactive_mode false
% 2.41/1.24 --external_ip_address ""
% 2.41/1.24 --external_port 0
% 2.41/1.24
% 2.41/1.24 ------ Global Options
% 2.41/1.24
% 2.41/1.24 --schedule sat
% 2.41/1.24 --add_important_lit false
% 2.41/1.24 --prop_solver_per_cl 500
% 2.41/1.24 --subs_bck_mult 8
% 2.41/1.24 --min_unsat_core false
% 2.41/1.24 --soft_assumptions false
% 2.41/1.24 --soft_lemma_size 3
% 2.41/1.24 --prop_impl_unit_size 0
% 2.41/1.24 --prop_impl_unit []
% 2.41/1.24 --share_sel_clauses true
% 2.41/1.24 --reset_solvers false
% 2.41/1.24 --bc_imp_inh []
% 2.41/1.24 --conj_cone_tolerance 1.5
% 2.41/1.24 --extra_neg_conj none
% 2.41/1.24 --large_theory_mode true
% 2.41/1.24 --prolific_symb_bound 500
% 2.41/1.24 --lt_threshold 2000
% 2.41/1.24 --clause_weak_htbl true
% 2.41/1.24 --gc_record_bc_elim false
% 2.41/1.24
% 2.41/1.24 ------ Preprocessing Options
% 2.41/1.24
% 2.41/1.24 --preprocessing_flag false
% 2.41/1.24 --time_out_prep_mult 0.8
% 2.41/1.24 --splitting_mode none
% 2.41/1.24 --splitting_grd false
% 2.41/1.24 --splitting_cvd false
% 2.41/1.24 --splitting_cvd_svl false
% 2.41/1.24 --splitting_nvd 128
% 2.41/1.24 --sub_typing true
% 2.41/1.24 --prep_eq_flat_conj false
% 2.41/1.24 --prep_ineq_split false
% 2.41/1.24 --prep_eq_flat_all_gr false
% 2.41/1.24 --prep_gs_sim true
% 2.41/1.24 --prep_unflatten true
% 2.41/1.24 --prep_res_sim false
% 2.41/1.24 --prep_sup_sim_all true
% 2.41/1.24 --prep_sup_sim_sup false
% 2.41/1.24 --prep_upred true
% 2.41/1.24 --prep_well_definedness true
% 2.41/1.24 --prep_sem_filter exhaustive
% 2.41/1.24 --prep_sem_filter_out false
% 2.41/1.24 --pred_elim false
% 2.41/1.24 --res_sim_input false
% 2.41/1.24 --eq_ax_congr_red true
% 2.41/1.24 --pure_diseq_elim true
% 2.41/1.24 --brand_transform false
% 2.41/1.24 --non_eq_to_eq false
% 2.41/1.24 --prep_eq_proxy false
% 2.41/1.24 --prep_def_merge true
% 2.41/1.24 --prep_def_merge_prop_impl false
% 2.41/1.24 --prep_def_merge_mbd true
% 2.41/1.24 --prep_def_merge_tr_red false
% 2.41/1.24 --prep_def_merge_tr_cl false
% 2.41/1.24 --smt_preprocessing false
% 2.41/1.24 --smt_ac_axioms fast
% 2.41/1.24 --preprocessed_out false
% 2.41/1.24 --preprocessed_stats false
% 2.41/1.24
% 2.41/1.24 ------ Abstraction refinement Options
% 2.41/1.24
% 2.41/1.24 --abstr_ref []
% 2.41/1.24 --abstr_ref_prep false
% 2.41/1.24 --abstr_ref_until_sat false
% 2.41/1.24 --abstr_ref_sig_restrict funpre
% 2.41/1.24 --abstr_ref_af_restrict_to_split_sk false
% 2.41/1.24 --abstr_ref_under []
% 2.41/1.24
% 2.41/1.24 ------ SAT Options
% 2.41/1.24
% 2.41/1.24 --sat_mode false
% 2.41/1.24 --sat_fm_restart_options ""
% 2.41/1.24 --sat_gr_def false
% 2.41/1.24 --sat_epr_types true
% 2.41/1.24 --sat_non_cyclic_types false
% 2.41/1.24 --sat_finite_models false
% 2.41/1.24 --sat_fm_lemmas false
% 2.41/1.24 --sat_fm_prep false
% 2.41/1.24 --sat_fm_uc_incr true
% 2.41/1.24 --sat_out_model pos
% 2.41/1.24 --sat_out_clauses false
% 2.41/1.24
% 2.41/1.24 ------ QBF Options
% 2.41/1.24
% 2.41/1.24 --qbf_mode false
% 2.41/1.24 --qbf_elim_univ false
% 2.41/1.24 --qbf_dom_inst none
% 2.41/1.24 --qbf_dom_pre_inst false
% 2.41/1.24 --qbf_sk_in false
% 2.41/1.24 --qbf_pred_elim true
% 2.41/1.24 --qbf_split 512
% 2.41/1.24
% 2.41/1.24 ------ BMC1 Options
% 2.41/1.24
% 2.41/1.24 --bmc1_incremental false
% 2.41/1.24 --bmc1_axioms reachable_all
% 2.41/1.24 --bmc1_min_bound 0
% 2.41/1.24 --bmc1_max_bound -1
% 2.41/1.24 --bmc1_max_bound_default -1
% 2.41/1.24 --bmc1_symbol_reachability true
% 2.41/1.24 --bmc1_property_lemmas false
% 2.41/1.24 --bmc1_k_induction false
% 2.41/1.24 --bmc1_non_equiv_states false
% 2.41/1.24 --bmc1_deadlock false
% 2.41/1.24 --bmc1_ucm false
% 2.41/1.24 --bmc1_add_unsat_core none
% 2.41/1.24 --bmc1_unsat_core_children false
% 2.41/1.24 --bmc1_unsat_core_extrapolate_axioms false
% 2.41/1.24 --bmc1_out_stat full
% 2.41/1.24 --bmc1_ground_init false
% 2.41/1.24 --bmc1_pre_inst_next_state false
% 2.41/1.24 --bmc1_pre_inst_state false
% 2.41/1.24 --bmc1_pre_inst_reach_state false
% 2.41/1.24 --bmc1_out_unsat_core false
% 2.41/1.24 --bmc1_aig_witness_out false
% 2.41/1.24 --bmc1_verbose false
% 2.41/1.24 --bmc1_dump_clauses_tptp false
% 2.41/1.24 --bmc1_dump_unsat_core_tptp false
% 2.41/1.24 --bmc1_dump_file -
% 2.41/1.24 --bmc1_ucm_expand_uc_limit 128
% 2.41/1.24 --bmc1_ucm_n_expand_iterations 6
% 2.41/1.24 --bmc1_ucm_extend_mode 1
% 2.41/1.24 --bmc1_ucm_init_mode 2
% 2.41/1.24 --bmc1_ucm_cone_mode none
% 2.41/1.24 --bmc1_ucm_reduced_relation_type 0
% 2.41/1.24 --bmc1_ucm_relax_model 4
% 2.41/1.24 --bmc1_ucm_full_tr_after_sat true
% 2.41/1.24 --bmc1_ucm_expand_neg_assumptions false
% 2.41/1.24 --bmc1_ucm_layered_model none
% 2.41/1.24 --bmc1_ucm_max_lemma_size 10
% 2.41/1.24
% 2.41/1.24 ------ AIG Options
% 2.41/1.24
% 2.41/1.24 --aig_mode false
% 2.41/1.24
% 2.41/1.24 ------ Instantiation Options
% 2.41/1.24
% 2.41/1.24 --instantiation_flag true
% 2.41/1.24 --inst_sos_flag false
% 2.41/1.24 --inst_sos_phase true
% 2.41/1.24 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 2.41/1.24 --inst_lit_sel [+prop;-num_symb]
% 2.41/1.24 --inst_lit_sel_side num_symb
% 2.41/1.24 --inst_solver_per_active 100
% 2.41/1.24 --inst_solver_calls_frac 1.
% 2.41/1.24 --inst_to_smt_solver true
% 2.41/1.24 --inst_passive_queue_type priority_queues
% 2.41/1.24 --inst_passive_queues [[+ground;+num_symb;+min_def_symb];[-num_lits;+age;+conj_non_prolific_symb]]
% 2.41/1.24 --inst_passive_queues_freq [1000;5]
% 2.41/1.24 --inst_dismatching false
% 2.41/1.24 --inst_eager_unprocessed_to_passive false
% 2.41/1.24 --inst_unprocessed_bound 1000
% 2.41/1.24 --inst_prop_sim_given false
% 2.41/1.24 --inst_prop_sim_new true
% 2.41/1.24 --inst_subs_new false
% 2.41/1.24 --inst_eq_res_simp false
% 2.41/1.24 --inst_subs_given false
% 2.41/1.24 --inst_orphan_elimination false
% 2.41/1.24 --inst_learning_loop_flag true
% 2.41/1.24 --inst_learning_start 3000
% 2.41/1.24 --inst_learning_factor 4
% 2.41/1.24 --inst_start_prop_sim_after_learn 0
% 2.41/1.24 --inst_sel_renew solver
% 2.41/1.24 --inst_lit_activity_flag true
% 2.41/1.24 --inst_restr_to_given true
% 2.41/1.24 --inst_activity_threshold 10000
% 2.41/1.24
% 2.41/1.24 ------ Resolution Options
% 2.41/1.24
% 2.41/1.24 --resolution_flag true
% 2.41/1.24 --res_lit_sel neg_min
% 2.41/1.24 --res_lit_sel_side none
% 2.41/1.24 --res_ordering kbo
% 2.41/1.24 --res_to_prop_solver active
% 2.41/1.24 --res_prop_simpl_new false
% 2.41/1.24 --res_prop_simpl_given true
% 2.41/1.24 --res_to_smt_solver true
% 2.41/1.24 --res_passive_queue_type priority_queues
% 2.41/1.24 --res_passive_queues [[+conj_non_prolific_symb;-num_symb;-num_symb];[+age;-num_symb]]
% 2.41/1.24 --res_passive_queues_freq [10;5]
% 2.41/1.24 --res_forward_subs subset_subsumption
% 2.41/1.24 --res_backward_subs subset_subsumption
% 2.41/1.24 --res_forward_subs_resolution false
% 2.41/1.24 --res_backward_subs_resolution false
% 2.41/1.24 --res_orphan_elimination true
% 2.41/1.24 --res_time_limit 300.
% 2.41/1.24
% 2.41/1.24 ------ Superposition Options
% 2.41/1.24
% 2.41/1.24 --superposition_flag false
% 2.41/1.24 --sup_passive_queue_type priority_queues
% 2.41/1.24 --sup_passive_queues [[-conj_dist;-num_symb];[+score;+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb];[+score;-num_symb]]
% 2.41/1.24 --sup_passive_queues_freq [8;1;4;4]
% 2.41/1.24 --twee_lhs_weight 4
% 2.41/1.24 --sup_set_join false
% 2.41/1.24 --sup_set_join_goals true
% 2.41/1.24 --sup_set_join_limit 1000
% 2.41/1.24 --demod_completeness_check fast
% 2.41/1.24 --demod_use_ground true
% 2.41/1.24 --sup_unprocessed_bound 0
% 2.41/1.24 --sup_to_prop_solver passive
% 2.41/1.24 --sup_prop_simpl_new true
% 2.41/1.24 --sup_prop_simpl_given true
% 2.41/1.24 --sup_fun_splitting false
% 2.41/1.24 --sup_iter_deepening 2
% 2.41/1.24 --sup_restarts_mult 12
% 2.41/1.24 --sup_score sim_d_gen
% 2.41/1.24 --sup_share_score_frac 0.2
% 2.41/1.24 --sup_share_max_num_cl 500
% 2.41/1.24 --sup_ordering kbo
% 2.41/1.24 --sup_symb_ordering invfreq
% 2.41/1.24 --sup_term_weight default
% 2.41/1.24
% 2.41/1.24 ------ Superposition Simplification Setup
% 2.41/1.24
% 2.41/1.24 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 2.41/1.24 --sup_full_triv [SMTSimplify;PropSubs]
% 2.41/1.24 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 2.41/1.24 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.41/1.24 --sup_immed_triv []
% 2.41/1.24 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 2.41/1.24 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 2.41/1.24 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 2.41/1.24 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.41/1.24 --sup_input_triv [Unflattening;SMTSimplify]
% 2.41/1.24 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 2.41/1.24 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.41/1.24 --sup_full_fixpoint true
% 2.41/1.24 --sup_main_fixpoint true
% 2.41/1.24 --sup_immed_fixpoint false
% 2.41/1.24 --sup_input_fixpoint true
% 2.41/1.24 --sup_cache_sim none
% 2.41/1.24 --sup_smt_interval 500
% 2.41/1.24 --sup_bw_gjoin_interval 0
% 2.41/1.24
% 2.41/1.24 ------ Combination Options
% 2.41/1.24
% 2.41/1.24 --comb_mode clause_based
% 2.41/1.24 --comb_inst_mult 3
% 2.41/1.24 --comb_res_mult 10
% 2.41/1.24 --comb_sup_mult 1
% 2.41/1.24 --comb_sup_deep_mult 1
% 2.41/1.24
% 2.41/1.24 ------ Debug Options
% 2.41/1.24
% 2.41/1.24 --dbg_backtrace false
% 2.41/1.24 --dbg_dump_prop_clauses false
% 2.41/1.24 --dbg_dump_prop_clauses_file -
% 2.41/1.24 --dbg_out_stat false
% 2.41/1.24 --dbg_just_parse false
% 2.41/1.24
% 2.41/1.24
% 2.41/1.24
% 2.41/1.24
% 2.41/1.24 ------ Proving...
% 2.41/1.24
% 2.41/1.24
% 2.41/1.24 % SZS status Satisfiable for theBenchmark.p
% 2.41/1.24
% 2.41/1.24 ------ Building Model...Done
% 2.41/1.24
% 2.41/1.24 %------ The model is defined over ground terms (initial term algebra).
% 2.41/1.24 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.41/1.24 %------ where \phi is a formula over the term algebra.
% 2.41/1.24 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.41/1.24 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.41/1.24 %------ See help for --sat_out_model for different model outputs.
% 2.41/1.24 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.41/1.24 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.41/1.24 % SZS output start Model for theBenchmark.p
% See solution above
% 2.41/1.25
%------------------------------------------------------------------------------