TSTP Solution File: LCL655+1.005 by iProver-SAT---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.9
% Problem : LCL655+1.005 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n032.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 May 3 02:41:47 EDT 2024
% Result : CounterSatisfiable 2.82s 1.00s
% Output : Model 2.82s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of r1
fof(lit_def,axiom,
! [X0,X1] :
( r1(X0,X1)
<=> ( X1 != iProver_Domain_i_1
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_1 )
| ( X0 = iProver_Domain_i_1
& X1 = iProver_Domain_i_2 )
| ( X1 = X0
& X0 != iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of p1
fof(lit_def_001,axiom,
! [X0] :
( p1(X0)
<=> X0 != iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK6
fof(lit_def_002,axiom,
! [X0] :
( iProver_Flat_sK6(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK5
fof(lit_def_003,axiom,
! [X0] :
( iProver_Flat_sK5(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK7
fof(lit_def_004,axiom,
! [X0] :
( iProver_Flat_sK7(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK4
fof(lit_def_005,axiom,
! [X0] :
( iProver_Flat_sK4(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK3
fof(lit_def_006,axiom,
! [X0] :
( iProver_Flat_sK3(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK2
fof(lit_def_007,axiom,
! [X0] :
( iProver_Flat_sK2(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK1
fof(lit_def_008,axiom,
! [X0] :
( iProver_Flat_sK1(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK0
fof(lit_def_009,axiom,
! [X0] :
( iProver_Flat_sK0(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK8
fof(lit_def_010,axiom,
! [X0,X1] :
( iProver_Flat_sK8(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK9
fof(lit_def_011,axiom,
! [X0,X1] :
( iProver_Flat_sK9(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK10
fof(lit_def_012,axiom,
! [X0,X1] :
( iProver_Flat_sK10(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK11
fof(lit_def_013,axiom,
! [X0,X1] :
( iProver_Flat_sK11(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK13
fof(lit_def_014,axiom,
! [X0,X1] :
( iProver_Flat_sK13(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_sK12
fof(lit_def_015,axiom,
! [X0,X1] :
( iProver_Flat_sK12(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK14
fof(lit_def_016,axiom,
! [X0,X1] :
( iProver_Flat_sK14(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK15
fof(lit_def_017,axiom,
! [X0,X1] :
( iProver_Flat_sK15(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK21
fof(lit_def_018,axiom,
! [X0] :
( iProver_Flat_sK21(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK20
fof(lit_def_019,axiom,
! [X0] :
( iProver_Flat_sK20(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK22
fof(lit_def_020,axiom,
! [X0] :
( iProver_Flat_sK22(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK19
fof(lit_def_021,axiom,
! [X0] :
( iProver_Flat_sK19(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK18
fof(lit_def_022,axiom,
! [X0] :
( iProver_Flat_sK18(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK17
fof(lit_def_023,axiom,
! [X0] :
( iProver_Flat_sK17(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK16
fof(lit_def_024,axiom,
! [X0] :
( iProver_Flat_sK16(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK23
fof(lit_def_025,axiom,
! [X0,X1] :
( iProver_Flat_sK23(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK24
fof(lit_def_026,axiom,
! [X0,X1] :
( iProver_Flat_sK24(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK25
fof(lit_def_027,axiom,
! [X0,X1] :
( iProver_Flat_sK25(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK26
fof(lit_def_028,axiom,
! [X0,X1] :
( iProver_Flat_sK26(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK28
fof(lit_def_029,axiom,
! [X0,X1] :
( iProver_Flat_sK28(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_sK27
fof(lit_def_030,axiom,
! [X0,X1] :
( iProver_Flat_sK27(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK29
fof(lit_def_031,axiom,
! [X0,X1] :
( iProver_Flat_sK29(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK30
fof(lit_def_032,axiom,
! [X0,X1] :
( iProver_Flat_sK30(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK36
fof(lit_def_033,axiom,
! [X0] :
( iProver_Flat_sK36(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK35
fof(lit_def_034,axiom,
! [X0] :
( iProver_Flat_sK35(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK37
fof(lit_def_035,axiom,
! [X0] :
( iProver_Flat_sK37(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK34
fof(lit_def_036,axiom,
! [X0] :
( iProver_Flat_sK34(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK33
fof(lit_def_037,axiom,
! [X0] :
( iProver_Flat_sK33(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK32
fof(lit_def_038,axiom,
! [X0] :
( iProver_Flat_sK32(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK31
fof(lit_def_039,axiom,
! [X0] :
( iProver_Flat_sK31(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK38
fof(lit_def_040,axiom,
! [X0,X1] :
( iProver_Flat_sK38(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK39
fof(lit_def_041,axiom,
! [X0,X1] :
( iProver_Flat_sK39(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK40
fof(lit_def_042,axiom,
! [X0,X1] :
( iProver_Flat_sK40(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK41
fof(lit_def_043,axiom,
! [X0,X1] :
( iProver_Flat_sK41(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK43
fof(lit_def_044,axiom,
! [X0,X1] :
( iProver_Flat_sK43(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_sK42
fof(lit_def_045,axiom,
! [X0,X1] :
( iProver_Flat_sK42(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK44
fof(lit_def_046,axiom,
! [X0,X1] :
( iProver_Flat_sK44(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK45
fof(lit_def_047,axiom,
! [X0,X1] :
( iProver_Flat_sK45(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK51
fof(lit_def_048,axiom,
! [X0] :
( iProver_Flat_sK51(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK50
fof(lit_def_049,axiom,
! [X0] :
( iProver_Flat_sK50(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK52
fof(lit_def_050,axiom,
! [X0] :
( iProver_Flat_sK52(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK49
fof(lit_def_051,axiom,
! [X0] :
( iProver_Flat_sK49(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK48
fof(lit_def_052,axiom,
! [X0] :
( iProver_Flat_sK48(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK47
fof(lit_def_053,axiom,
! [X0] :
( iProver_Flat_sK47(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK46
fof(lit_def_054,axiom,
! [X0] :
( iProver_Flat_sK46(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK53
fof(lit_def_055,axiom,
! [X0,X1] :
( iProver_Flat_sK53(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK54
fof(lit_def_056,axiom,
! [X0,X1] :
( iProver_Flat_sK54(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK55
fof(lit_def_057,axiom,
! [X0,X1] :
( iProver_Flat_sK55(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK56
fof(lit_def_058,axiom,
! [X0,X1] :
( iProver_Flat_sK56(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK58
fof(lit_def_059,axiom,
! [X0,X1] :
( iProver_Flat_sK58(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_sK57
fof(lit_def_060,axiom,
! [X0,X1] :
( iProver_Flat_sK57(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK59
fof(lit_def_061,axiom,
! [X0,X1] :
( iProver_Flat_sK59(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK60
fof(lit_def_062,axiom,
! [X0,X1] :
( iProver_Flat_sK60(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK66
fof(lit_def_063,axiom,
! [X0] :
( iProver_Flat_sK66(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK65
fof(lit_def_064,axiom,
! [X0] :
( iProver_Flat_sK65(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK67
fof(lit_def_065,axiom,
! [X0] :
( iProver_Flat_sK67(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK64
fof(lit_def_066,axiom,
! [X0] :
( iProver_Flat_sK64(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK63
fof(lit_def_067,axiom,
! [X0] :
( iProver_Flat_sK63(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK62
fof(lit_def_068,axiom,
! [X0] :
( iProver_Flat_sK62(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK61
fof(lit_def_069,axiom,
! [X0] :
( iProver_Flat_sK61(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK68
fof(lit_def_070,axiom,
! [X0,X1] :
( iProver_Flat_sK68(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK69
fof(lit_def_071,axiom,
! [X0,X1] :
( iProver_Flat_sK69(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK70
fof(lit_def_072,axiom,
! [X0,X1] :
( iProver_Flat_sK70(X0,X1)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_sK71
fof(lit_def_073,axiom,
! [X0,X1] :
( iProver_Flat_sK71(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK73
fof(lit_def_074,axiom,
! [X0,X1] :
( iProver_Flat_sK73(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_sK72
fof(lit_def_075,axiom,
! [X0,X1] :
( iProver_Flat_sK72(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK74
fof(lit_def_076,axiom,
! [X0,X1] :
( iProver_Flat_sK74(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_sK75
fof(lit_def_077,axiom,
! [X0,X1] :
( iProver_Flat_sK75(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.08 % Problem : LCL655+1.005 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.09 % Command : run_iprover %s %d SAT
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Thu May 2 19:20:53 EDT 2024
% 0.08/0.28 % CPUTime :
% 0.13/0.37 Running model finding
% 0.13/0.37 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.82/1.00 % SZS status Started for theBenchmark.p
% 2.82/1.00 % SZS status CounterSatisfiable for theBenchmark.p
% 2.82/1.00
% 2.82/1.00 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.82/1.00
% 2.82/1.00 ------ iProver source info
% 2.82/1.00
% 2.82/1.00 git: date: 2024-05-02 19:28:25 +0000
% 2.82/1.00 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.82/1.00 git: non_committed_changes: false
% 2.82/1.00
% 2.82/1.00 ------ Parsing...
% 2.82/1.00 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.82/1.00 ------ Proving...
% 2.82/1.00 ------ Problem Properties
% 2.82/1.00
% 2.82/1.00
% 2.82/1.00 clauses 136
% 2.82/1.00 conjectures 135
% 2.82/1.00 EPR 46
% 2.82/1.00 Horn 76
% 2.82/1.00 unary 41
% 2.82/1.00 binary 5
% 2.82/1.00 lits 751
% 2.82/1.00 lits eq 0
% 2.82/1.00 fd_pure 0
% 2.82/1.00 fd_pseudo 0
% 2.82/1.00 fd_cond 0
% 2.82/1.00 fd_pseudo_cond 0
% 2.82/1.00 AC symbols 0
% 2.82/1.00
% 2.82/1.00 ------ Input Options Time Limit: Unbounded
% 2.82/1.00
% 2.82/1.00
% 2.82/1.00 ------ Finite Models:
% 2.82/1.00
% 2.82/1.00 ------ lit_activity_flag true
% 2.82/1.00
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 1
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00 ------
% 2.82/1.00 Current options:
% 2.82/1.00 ------
% 2.82/1.00
% 2.82/1.00 ------ Input Options
% 2.82/1.00
% 2.82/1.00 --out_options all
% 2.82/1.00 --tptp_safe_out true
% 2.82/1.00 --problem_path ""
% 2.82/1.00 --include_path ""
% 2.82/1.00 --clausifier res/vclausify_rel
% 2.82/1.00 --clausifier_options --mode clausify -t 300.00 -updr off
% 2.82/1.00 --stdin false
% 2.82/1.00 --proof_out true
% 2.82/1.00 --proof_dot_file ""
% 2.82/1.00 --proof_reduce_dot []
% 2.82/1.00 --suppress_sat_res false
% 2.82/1.00 --suppress_unsat_res true
% 2.82/1.00 --stats_out none
% 2.82/1.00 --stats_mem false
% 2.82/1.00 --theory_stats_out false
% 2.82/1.00
% 2.82/1.00 ------ General Options
% 2.82/1.00
% 2.82/1.00 --fof false
% 2.82/1.00 --time_out_real 300.
% 2.82/1.00 --time_out_virtual -1.
% 2.82/1.00 --rnd_seed 13
% 2.82/1.00 --symbol_type_check false
% 2.82/1.00 --clausify_out false
% 2.82/1.00 --sig_cnt_out false
% 2.82/1.00 --trig_cnt_out false
% 2.82/1.00 --trig_cnt_out_tolerance 1.
% 2.82/1.00 --trig_cnt_out_sk_spl false
% 2.82/1.00 --abstr_cl_out false
% 2.82/1.00
% 2.82/1.00 ------ Interactive Mode
% 2.82/1.00
% 2.82/1.00 --interactive_mode false
% 2.82/1.00 --external_ip_address ""
% 2.82/1.00 --external_port 0
% 2.82/1.00
% 2.82/1.00 ------ Global Options
% 2.82/1.00
% 2.82/1.00 --schedule none
% 2.82/1.00 --add_important_lit false
% 2.82/1.00 --prop_solver_per_cl 500
% 2.82/1.00 --subs_bck_mult 8
% 2.82/1.00 --min_unsat_core false
% 2.82/1.00 --soft_assumptions false
% 2.82/1.00 --soft_lemma_size 3
% 2.82/1.00 --prop_impl_unit_size 0
% 2.82/1.00 --prop_impl_unit []
% 2.82/1.00 --share_sel_clauses true
% 2.82/1.00 --reset_solvers false
% 2.82/1.00 --bc_imp_inh []
% 2.82/1.00 --conj_cone_tolerance 3.
% 2.82/1.00 --extra_neg_conj none
% 2.82/1.00 --large_theory_mode true
% 2.82/1.00 --prolific_symb_bound 200
% 2.82/1.00 --lt_threshold 2000
% 2.82/1.00 --clause_weak_htbl true
% 2.82/1.00 --gc_record_bc_elim false
% 2.82/1.00
% 2.82/1.00 ------ Preprocessing Options
% 2.82/1.00
% 2.82/1.00 --preprocessing_flag false
% 2.82/1.00 --time_out_prep_mult 0.1
% 2.82/1.00 --splitting_mode input
% 2.82/1.00 --splitting_grd true
% 2.82/1.00 --splitting_cvd false
% 2.82/1.00 --splitting_cvd_svl false
% 2.82/1.00 --splitting_nvd 32
% 2.82/1.00 --sub_typing false
% 2.82/1.00 --prep_eq_flat_conj false
% 2.82/1.00 --prep_eq_flat_all_gr false
% 2.82/1.00 --prep_gs_sim true
% 2.82/1.00 --prep_unflatten true
% 2.82/1.00 --prep_res_sim true
% 2.82/1.00 --prep_sup_sim_all true
% 2.82/1.00 --prep_sup_sim_sup false
% 2.82/1.00 --prep_upred true
% 2.82/1.00 --prep_well_definedness true
% 2.82/1.00 --prep_sem_filter exhaustive
% 2.82/1.00 --prep_sem_filter_out false
% 2.82/1.00 --pred_elim true
% 2.82/1.00 --res_sim_input true
% 2.82/1.00 --eq_ax_congr_red true
% 2.82/1.00 --pure_diseq_elim true
% 2.82/1.00 --brand_transform false
% 2.82/1.00 --non_eq_to_eq false
% 2.82/1.00 --prep_def_merge true
% 2.82/1.00 --prep_def_merge_prop_impl false
% 2.82/1.00 --prep_def_merge_mbd true
% 2.82/1.00 --prep_def_merge_tr_red false
% 2.82/1.00 --prep_def_merge_tr_cl false
% 2.82/1.00 --smt_preprocessing false
% 2.82/1.00 --smt_ac_axioms fast
% 2.82/1.00 --preprocessed_out false
% 2.82/1.00 --preprocessed_stats false
% 2.82/1.00
% 2.82/1.00 ------ Abstraction refinement Options
% 2.82/1.00
% 2.82/1.00 --abstr_ref []
% 2.82/1.00 --abstr_ref_prep false
% 2.82/1.00 --abstr_ref_until_sat false
% 2.82/1.00 --abstr_ref_sig_restrict funpre
% 2.82/1.00 --abstr_ref_af_restrict_to_split_sk false
% 2.82/1.00 --abstr_ref_under []
% 2.82/1.00
% 2.82/1.00 ------ SAT Options
% 2.82/1.00
% 2.82/1.00 --sat_mode true
% 2.82/1.00 --sat_fm_restart_options ""
% 2.82/1.00 --sat_gr_def false
% 2.82/1.00 --sat_epr_types true
% 2.82/1.00 --sat_non_cyclic_types false
% 2.82/1.00 --sat_finite_models true
% 2.82/1.00 --sat_fm_lemmas false
% 2.82/1.00 --sat_fm_prep false
% 2.82/1.00 --sat_fm_uc_incr true
% 2.82/1.00 --sat_out_model pos
% 2.82/1.00 --sat_out_clauses false
% 2.82/1.00
% 2.82/1.00 ------ QBF Options
% 2.82/1.00
% 2.82/1.00 --qbf_mode false
% 2.82/1.00 --qbf_elim_univ false
% 2.82/1.00 --qbf_dom_inst none
% 2.82/1.00 --qbf_dom_pre_inst false
% 2.82/1.00 --qbf_sk_in false
% 2.82/1.00 --qbf_pred_elim true
% 2.82/1.00 --qbf_split 512
% 2.82/1.00
% 2.82/1.00 ------ BMC1 Options
% 2.82/1.00
% 2.82/1.00 --bmc1_incremental false
% 2.82/1.00 --bmc1_axioms reachable_all
% 2.82/1.00 --bmc1_min_bound 0
% 2.82/1.00 --bmc1_max_bound -1
% 2.82/1.00 --bmc1_max_bound_default -1
% 2.82/1.00 --bmc1_symbol_reachability true
% 2.82/1.00 --bmc1_property_lemmas false
% 2.82/1.00 --bmc1_k_induction false
% 2.82/1.00 --bmc1_non_equiv_states false
% 2.82/1.00 --bmc1_deadlock false
% 2.82/1.00 --bmc1_ucm false
% 2.82/1.00 --bmc1_add_unsat_core none
% 2.82/1.00 --bmc1_unsat_core_children false
% 2.82/1.00 --bmc1_unsat_core_extrapolate_axioms false
% 2.82/1.00 --bmc1_out_stat full
% 2.82/1.00 --bmc1_ground_init false
% 2.82/1.00 --bmc1_pre_inst_next_state false
% 2.82/1.00 --bmc1_pre_inst_state false
% 2.82/1.00 --bmc1_pre_inst_reach_state false
% 2.82/1.00 --bmc1_out_unsat_core false
% 2.82/1.00 --bmc1_aig_witness_out false
% 2.82/1.00 --bmc1_verbose false
% 2.82/1.00 --bmc1_dump_clauses_tptp false
% 2.82/1.00 --bmc1_dump_unsat_core_tptp false
% 2.82/1.00 --bmc1_dump_file -
% 2.82/1.00 --bmc1_ucm_expand_uc_limit 128
% 2.82/1.00 --bmc1_ucm_n_expand_iterations 6
% 2.82/1.00 --bmc1_ucm_extend_mode 1
% 2.82/1.00 --bmc1_ucm_init_mode 2
% 2.82/1.00 --bmc1_ucm_cone_mode none
% 2.82/1.00 --bmc1_ucm_reduced_relation_type 0
% 2.82/1.00 --bmc1_ucm_relax_model 4
% 2.82/1.00 --bmc1_ucm_full_tr_after_sat true
% 2.82/1.00 --bmc1_ucm_expand_neg_assumptions false
% 2.82/1.00 --bmc1_ucm_layered_model none
% 2.82/1.00 --bmc1_ucm_max_lemma_size 10
% 2.82/1.00
% 2.82/1.00 ------ AIG Options
% 2.82/1.00
% 2.82/1.00 --aig_mode false
% 2.82/1.00
% 2.82/1.00 ------ Instantiation Options
% 2.82/1.00
% 2.82/1.00 --instantiation_flag true
% 2.82/1.00 --inst_sos_flag false
% 2.82/1.00 --inst_sos_phase true
% 2.82/1.00 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 2.82/1.00 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.82/1.00 --inst_lit_sel_side num_symb
% 2.82/1.00 --inst_solver_per_active 1400
% 2.82/1.00 --inst_solver_calls_frac 1.
% 2.82/1.00 --inst_to_smt_solver true
% 2.82/1.00 --inst_passive_queue_type priority_queues
% 2.82/1.00 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.82/1.00 --inst_passive_queues_freq [25;2]
% 2.82/1.00 --inst_dismatching true
% 2.82/1.00 --inst_eager_unprocessed_to_passive true
% 2.82/1.00 --inst_unprocessed_bound 1000
% 2.82/1.00 --inst_prop_sim_given false
% 2.82/1.00 --inst_prop_sim_new false
% 2.82/1.00 --inst_subs_new false
% 2.82/1.00 --inst_eq_res_simp false
% 2.82/1.00 --inst_subs_given false
% 2.82/1.00 --inst_orphan_elimination true
% 2.82/1.00 --inst_learning_loop_flag true
% 2.82/1.00 --inst_learning_start 3000
% 2.82/1.00 --inst_learning_factor 2
% 2.82/1.00 --inst_start_prop_sim_after_learn 3
% 2.82/1.00 --inst_sel_renew solver
% 2.82/1.00 --inst_lit_activity_flag false
% 2.82/1.00 --inst_restr_to_given false
% 2.82/1.00 --inst_activity_threshold 500
% 2.82/1.00
% 2.82/1.00 ------ Resolution Options
% 2.82/1.00
% 2.82/1.00 --resolution_flag false
% 2.82/1.00 --res_lit_sel adaptive
% 2.82/1.00 --res_lit_sel_side none
% 2.82/1.00 --res_ordering kbo
% 2.82/1.00 --res_to_prop_solver active
% 2.82/1.00 --res_prop_simpl_new false
% 2.82/1.00 --res_prop_simpl_given true
% 2.82/1.00 --res_to_smt_solver true
% 2.82/1.00 --res_passive_queue_type priority_queues
% 2.82/1.00 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.82/1.00 --res_passive_queues_freq [15;5]
% 2.82/1.00 --res_forward_subs full
% 2.82/1.00 --res_backward_subs full
% 2.82/1.00 --res_forward_subs_resolution true
% 2.82/1.00 --res_backward_subs_resolution true
% 2.82/1.00 --res_orphan_elimination true
% 2.82/1.00 --res_time_limit 300.
% 2.82/1.00
% 2.82/1.00 ------ Superposition Options
% 2.82/1.00
% 2.82/1.00 --superposition_flag false
% 2.82/1.00 --sup_passive_queue_type priority_queues
% 2.82/1.00 --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.82/1.00 --sup_passive_queues_freq [8;1;4;4]
% 2.82/1.00 --demod_completeness_check fast
% 2.82/1.00 --demod_use_ground true
% 2.82/1.00 --sup_unprocessed_bound 0
% 2.82/1.00 --sup_to_prop_solver passive
% 2.82/1.00 --sup_prop_simpl_new true
% 2.82/1.00 --sup_prop_simpl_given true
% 2.82/1.00 --sup_fun_splitting false
% 2.82/1.00 --sup_iter_deepening 2
% 2.82/1.00 --sup_restarts_mult 12
% 2.82/1.00 --sup_score sim_d_gen
% 2.82/1.00 --sup_share_score_frac 0.2
% 2.82/1.00 --sup_share_max_num_cl 500
% 2.82/1.00 --sup_ordering kbo
% 2.82/1.00 --sup_symb_ordering invfreq
% 2.82/1.00 --sup_term_weight default
% 2.82/1.00
% 2.82/1.00 ------ Superposition Simplification Setup
% 2.82/1.00
% 2.82/1.00 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 2.82/1.00 --sup_full_triv [SMTSimplify;PropSubs]
% 2.82/1.00 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 2.82/1.00 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.82/1.00 --sup_immed_triv []
% 2.82/1.00 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 2.82/1.00 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 2.82/1.00 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 2.82/1.00 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.82/1.00 --sup_input_triv [Unflattening;SMTSimplify]
% 2.82/1.00 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 2.82/1.00 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.82/1.00 --sup_full_fixpoint true
% 2.82/1.00 --sup_main_fixpoint true
% 2.82/1.00 --sup_immed_fixpoint false
% 2.82/1.00 --sup_input_fixpoint true
% 2.82/1.00 --sup_cache_sim none
% 2.82/1.00 --sup_smt_interval 500
% 2.82/1.00 --sup_bw_gjoin_interval 0
% 2.82/1.00
% 2.82/1.00 ------ Combination Options
% 2.82/1.00
% 2.82/1.00 --comb_mode clause_based
% 2.82/1.00 --comb_inst_mult 5
% 2.82/1.00 --comb_res_mult 1
% 2.82/1.00 --comb_sup_mult 8
% 2.82/1.00 --comb_sup_deep_mult 2
% 2.82/1.00
% 2.82/1.00 ------ Debug Options
% 2.82/1.00
% 2.82/1.00 --dbg_backtrace false
% 2.82/1.00 --dbg_dump_prop_clauses false
% 2.82/1.00 --dbg_dump_prop_clauses_file -
% 2.82/1.00 --dbg_out_stat false
% 2.82/1.00 --dbg_just_parse false
% 2.82/1.00
% 2.82/1.00
% 2.82/1.00
% 2.82/1.00
% 2.82/1.00 ------ Proving...
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00
% 2.82/1.00 ------ Proving...
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00
% 2.82/1.00 ------ Proving...
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00
% 2.82/1.00 ------ Proving...
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00
% 2.82/1.00 ------ Proving...
% 2.82/1.00
% 2.82/1.00 ------ Trying domains of size >= : 2
% 2.82/1.00
% 2.82/1.00
% 2.82/1.00 ------ Proving...
% 2.82/1.00
% 2.82/1.00
% 2.82/1.00 % SZS status CounterSatisfiable for theBenchmark.p
% 2.82/1.00
% 2.82/1.00 ------ Building Model...Done
% 2.82/1.00
% 2.82/1.00 %------ The model is defined over ground terms (initial term algebra).
% 2.82/1.00 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.82/1.00 %------ where \phi is a formula over the term algebra.
% 2.82/1.00 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.82/1.00 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.82/1.00 %------ See help for --sat_out_model for different model outputs.
% 2.82/1.00 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.82/1.00 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.82/1.00 % SZS output start Model for theBenchmark.p
% See solution above
% 2.82/1.00
%------------------------------------------------------------------------------