%------------------------------------------------------------------------------
% File : iProver-SAT---3.9.4
% Problem : NLP248-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% Computer : n001.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 02:18:23 PM UTC 2026
% Result : Satisfiable 1.87s 1.23s
% Output : Model 1.87s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of equality_sorted
fof(lit_def,axiom,
! [X0_tType,X0,X1] :
( equality_sorted(X0_tType,X0,X1)
<=> ( ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_2
& X0_tType = $i )
| ( ( X1 != iProver_Domain_i_2
| X0 != iProver_Domain_i_3 )
& ( X1 != iProver_Domain_i_1
| X0 != iProver_Domain_i_3 )
& ( X1 != iProver_Domain_i_3
| X0 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_1
| X0 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_3
| X0 != iProver_Domain_i_1 )
& ( X1 != iProver_Domain_i_2
| X0 != iProver_Domain_i_1 )
& X0_tType = $i ) ) ) ).
%------ Positive definition of smoke
fof(lit_def_001,axiom,
! [X0,X1] :
( smoke(X0,X1)
<=> ( X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_2 ) ) ).
%------ Positive definition of event
fof(lit_def_002,axiom,
! [X0,X1] :
( event(X0,X1)
<=> ( ( X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_2 )
| ( X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of eventuality
fof(lit_def_003,axiom,
! [X0,X1] :
( eventuality(X0,X1)
<=> ( ( X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_2 )
| ( X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of thing
fof(lit_def_004,axiom,
! [X0,X1] :
( thing(X0,X1)
<=> $true ) ).
%------ Positive definition of singleton
fof(lit_def_005,axiom,
! [X0,X1] :
( singleton(X0,X1)
<=> $true ) ).
%------ Positive definition of specific
fof(lit_def_006,axiom,
! [X0,X1] :
( specific(X0,X1)
<=> ( ( X1 != iProver_Domain_i_2
& X0 = iProver_Domain_i_2 )
| ( X1 != iProver_Domain_i_2
& X0 = iProver_Domain_i_1 )
| ( ( X1 != iProver_Domain_i_2
| X0 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_2
| X0 != iProver_Domain_i_1 ) ) ) ) ).
%------ Positive definition of nonexistent
fof(lit_def_007,axiom,
! [X0,X1] :
( nonexistent(X0,X1)
<=> ( ( X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_2 )
| ( X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of unisex
fof(lit_def_008,axiom,
! [X0,X1] :
( unisex(X0,X1)
<=> ( ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_2 )
| ( X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_2 )
| ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_1 )
| ( X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of proposition
fof(lit_def_009,axiom,
! [X0,X1] :
( proposition(X0,X1)
<=> ( ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_2 )
| ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of relation
fof(lit_def_010,axiom,
! [X0,X1] :
( relation(X0,X1)
<=> ( ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_2 )
| ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of abstraction
fof(lit_def_011,axiom,
! [X0,X1] :
( abstraction(X0,X1)
<=> ( ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_2 )
| ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of nonhuman
fof(lit_def_012,axiom,
! [X0,X1] :
( nonhuman(X0,X1)
<=> ( ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_2 )
| ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of general
fof(lit_def_013,axiom,
! [X0,X1] :
( general(X0,X1)
<=> ( ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_2 )
| ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of state
fof(lit_def_014,axiom,
! [X0,X1] :
( state(X0,X1)
<=> ( ( X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_2 )
| ( X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of man
fof(lit_def_015,axiom,
! [X0,X1] :
( man(X0,X1)
<=> ( ( X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_1
& X0 = iProver_Domain_i_2 )
| ( X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_1
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of human_person
fof(lit_def_016,axiom,
! [X0,X1] :
( human_person(X0,X1)
<=> ( ( X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_1
& X0 = iProver_Domain_i_2 )
| ( X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_1
& X0 = iProver_Domain_i_1 )
| ( ( X1 != iProver_Domain_i_2
| X0 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_1
| X0 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_2
| X0 != iProver_Domain_i_1 )
& ( X1 != iProver_Domain_i_1
| X0 != iProver_Domain_i_1 )
& X0 != iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of organism
fof(lit_def_017,axiom,
! [X0,X1] :
( organism(X0,X1)
<=> ( ( X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_1
& X0 = iProver_Domain_i_2 )
| ( X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_1
& X0 = iProver_Domain_i_1 )
| ( ( X1 != iProver_Domain_i_2
| X0 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_1
| X0 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_2
| X0 != iProver_Domain_i_1 )
& ( X1 != iProver_Domain_i_1
| X0 != iProver_Domain_i_1 )
& X0 != iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of entity
fof(lit_def_018,axiom,
! [X0,X1] :
( entity(X0,X1)
<=> ( ( X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_1
& X0 = iProver_Domain_i_2 )
| ( X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_1
& X0 = iProver_Domain_i_1 )
| ( ( X1 != iProver_Domain_i_2
| X0 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_1
| X0 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_2
| X0 != iProver_Domain_i_1 )
& ( X1 != iProver_Domain_i_1
| X0 != iProver_Domain_i_1 )
& X0 != iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of existent
fof(lit_def_019,axiom,
! [X0,X1] :
( existent(X0,X1)
<=> ( ( X1 != iProver_Domain_i_1
& X0 = iProver_Domain_i_2 )
| ( X1 != iProver_Domain_i_1
& X0 = iProver_Domain_i_1 )
| ( ( X1 != iProver_Domain_i_1
| X0 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_1
| X0 != iProver_Domain_i_1 )
& X0 != iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of impartial
fof(lit_def_020,axiom,
! [X0,X1] :
( impartial(X0,X1)
<=> ( X0 = iProver_Domain_i_2
| X0 = iProver_Domain_i_1
| X0 != iProver_Domain_i_1 ) ) ).
%------ Positive definition of living
fof(lit_def_021,axiom,
! [X0,X1] :
( living(X0,X1)
<=> ( X0 = iProver_Domain_i_2
| X0 = iProver_Domain_i_1
| X0 != iProver_Domain_i_1 ) ) ).
%------ Positive definition of human
fof(lit_def_022,axiom,
! [X0,X1] :
( human(X0,X1)
<=> ( ( X1 != iProver_Domain_i_2
& X0 = iProver_Domain_i_2 )
| ( X1 != iProver_Domain_i_2
& X0 = iProver_Domain_i_1 )
| ( ( X1 != iProver_Domain_i_2
| X0 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_2
| X0 != iProver_Domain_i_1 )
& X0 != iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of animate
fof(lit_def_023,axiom,
! [X0,X1] :
( animate(X0,X1)
<=> ( X0 = iProver_Domain_i_2
| X0 = iProver_Domain_i_1
| X0 != iProver_Domain_i_1 ) ) ).
%------ Positive definition of male
fof(lit_def_024,axiom,
! [X0,X1] :
( male(X0,X1)
<=> ( ( X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_1
& X0 = iProver_Domain_i_2 )
| ( X1 != iProver_Domain_i_2
& X1 != iProver_Domain_i_1
& X0 = iProver_Domain_i_1 )
| ( ( X1 != iProver_Domain_i_2
| X0 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_1
| X0 != iProver_Domain_i_2 )
& ( X1 != iProver_Domain_i_2
| X0 != iProver_Domain_i_1 )
& ( X1 != iProver_Domain_i_1
| X0 != iProver_Domain_i_1 )
& X0 != iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of forename
fof(lit_def_025,axiom,
! [X0,X1] :
( forename(X0,X1)
<=> ( ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_2 )
| ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of relname
fof(lit_def_026,axiom,
! [X0,X1] :
( relname(X0,X1)
<=> ( ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_2 )
| ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of vincent_forename
fof(lit_def_027,axiom,
! [X0,X1] :
( vincent_forename(X0,X1)
<=> ( ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_2 )
| ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of jules_forename
fof(lit_def_028,axiom,
! [X0,X1] :
( jules_forename(X0,X1)
<=> ( ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_2 )
| ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of be
fof(lit_def_029,axiom,
! [X0,X1,X2,X3] :
( be(X0,X1,X2,X3)
<=> ( ( ( X3 != iProver_Domain_i_2
| X2 != iProver_Domain_i_3 )
& ( X3 != iProver_Domain_i_1
| X2 != iProver_Domain_i_3 )
& ( X3 != iProver_Domain_i_3
| X2 != iProver_Domain_i_2 )
& ( X3 != iProver_Domain_i_1
| X2 != iProver_Domain_i_2 )
& ( X3 != iProver_Domain_i_3
| X2 != iProver_Domain_i_1 )
& ( X3 != iProver_Domain_i_2
| X2 != iProver_Domain_i_1 )
& X0 = iProver_Domain_i_2 )
| ( X1 != iProver_Domain_i_2
& X3 = X2
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of accessible_world
fof(lit_def_030,axiom,
! [X0,X1] :
( accessible_world(X0,X1)
<=> ( ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_1 )
| ( X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of present
fof(lit_def_031,axiom,
! [X0,X1] :
( present(X0,X1)
<=> ( ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_2 )
| ( X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_2 )
| X0 = iProver_Domain_i_2
| ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_1 )
| ( X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_1 )
| X0 = iProver_Domain_i_1 ) ) ).
%------ Positive definition of think_believe_consider
fof(lit_def_032,axiom,
! [X0,X1] :
( think_believe_consider(X0,X1)
<=> ( ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_2 )
| X0 = iProver_Domain_i_2
| ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_1 )
| ( X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_1 )
| X0 = iProver_Domain_i_1 ) ) ).
%------ Positive definition of agent
fof(lit_def_033,axiom,
! [X0,X1,X2] :
( agent(X0,X1,X2)
<=> ( ( X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_2 )
| X0 = iProver_Domain_i_2
| ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_1 )
| ( X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_1 )
| X0 = iProver_Domain_i_1 ) ) ).
%------ Positive definition of theme
fof(lit_def_034,axiom,
! [X0,X1,X2] :
( theme(X0,X1,X2)
<=> ( ( X2 = iProver_Domain_i_2
& X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_2 )
| ( X2 = iProver_Domain_i_2
& X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_2 )
| ( X2 = iProver_Domain_i_2
& X1 = iProver_Domain_i_1
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of of
fof(lit_def_035,axiom,
! [X0,X1,X2] :
( of(X0,X1,X2)
<=> ( ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_2 )
| ( X1 = iProver_Domain_i_2
& X0 = iProver_Domain_i_1 ) ) ) ).
%------ Positive definition of actual_world
fof(lit_def_036,axiom,
! [X0] :
( actual_world(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_skc13
fof(lit_def_037,axiom,
! [X0] :
( iProver_Flat_skc13(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_skc14
fof(lit_def_038,axiom,
! [X0] :
( iProver_Flat_skc14(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_skc26
fof(lit_def_039,axiom,
! [X0] :
( iProver_Flat_skc26(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_skc24
fof(lit_def_040,axiom,
! [X0] :
( iProver_Flat_skc24(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_skc25
fof(lit_def_041,axiom,
! [X0] :
( iProver_Flat_skc25(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_skc23
fof(lit_def_042,axiom,
! [X0] :
( iProver_Flat_skc23(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_skc20
fof(lit_def_043,axiom,
! [X0] :
( iProver_Flat_skc20(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_skc19
fof(lit_def_044,axiom,
! [X0] :
( iProver_Flat_skc19(X0)
<=> X0 = iProver_Domain_i_3 ) ).
%------ Positive definition of iProver_Flat_skc18
fof(lit_def_045,axiom,
! [X0] :
( iProver_Flat_skc18(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_skc17
fof(lit_def_046,axiom,
! [X0] :
( iProver_Flat_skc17(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_skc15
fof(lit_def_047,axiom,
! [X0] :
( iProver_Flat_skc15(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_skc16
fof(lit_def_048,axiom,
! [X0] :
( iProver_Flat_skc16(X0)
<=> X0 = iProver_Domain_i_2 ) ).
%------ Positive definition of iProver_Flat_skc22
fof(lit_def_049,axiom,
! [X0] :
( iProver_Flat_skc22(X0)
<=> X0 = iProver_Domain_i_1 ) ).
%------ Positive definition of iProver_Flat_skf1
fof(lit_def_050,axiom,
! [X0,X1] :
( iProver_Flat_skf1(X0,X1)
<=> X0 = iProver_Domain_i_1 ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP248-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% 0.11/0.37 % Computer : n001.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 02:38:36 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% 0.15/0.42 Running model finding
% 0.15/0.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fnt_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.44
% 0.15/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.44
% 0.15/0.44 % Detected problem language: tptp
% 0.15/0.46 % Proving...
% 1.87/1.23 % SZS status Started for theBenchmark.p
% 1.87/1.23 % SZS status Satisfiable for theBenchmark.p
% 1.87/1.23
% 1.87/1.23 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.87/1.23
% 1.87/1.23 ------ iProver source info
% 1.87/1.23
% 1.87/1.23 git: date: 2026-07-19 20:42:38 +0200
% 1.87/1.23 git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.87/1.23 git: non_committed_changes: false
% 1.87/1.23
% 1.87/1.23 ------ Parsing...successful
% 1.87/1.23
% 1.87/1.23
% 1.87/1.23 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.87/1.23 ------ Proving...
% 1.87/1.23 ------ Problem Properties
% 1.87/1.23
% 1.87/1.23
% 1.87/1.23 clauses 110
% 1.87/1.23 conjectures 39
% 1.87/1.23 EPR 106
% 1.87/1.23 Horn 110
% 1.87/1.23 unary 35
% 1.87/1.23 binary 39
% 1.87/1.23 lits 230
% 1.87/1.23 lits eq 3
% 1.87/1.23 fd_pure 0
% 1.87/1.23 fd_pseudo 0
% 1.87/1.23 fd_cond 0
% 1.87/1.23 fd_pseudo_cond 3
% 1.87/1.23 AC symbols 0
% 1.87/1.23
% 1.87/1.23 ------ Input Options Time Limit: Unbounded
% 1.87/1.23
% 1.87/1.23
% 1.87/1.23 ------ Finite Models:
% 1.87/1.23
% 1.87/1.23 ------ lit_activity_flag true
% 1.87/1.23
% 1.87/1.23
% 1.87/1.23 ------ Trying domains of size >= : 1
% 1.87/1.23
% 1.87/1.23 ------ Trying domains of size >= : 2
% 1.87/1.23
% 1.87/1.23 ------ Trying domains of size >= : 2
% 1.87/1.23
% 1.87/1.23 ------ Trying domains of size >= : 2
% 1.87/1.23
% 1.87/1.23 ------ Trying domains of size >= : 2
% 1.87/1.23 ------
% 1.87/1.23 Current options:
% 1.87/1.23 ------
% 1.87/1.23
% 1.87/1.23 ------ Input Options
% 1.87/1.23
% 1.87/1.23 --out_options all
% 1.87/1.23 --tptp_safe_out true
% 1.87/1.23 --problem_path ""
% 1.87/1.23 --include_path ""
% 1.87/1.23 --clausifier res/vclausify_rel
% 1.87/1.23 --clausifier_options --mode clausify -t 101.66 -updr off
% 1.87/1.23 --stdin false
% 1.87/1.23 --proof_out true
% 1.87/1.23 --proof_dot_file ""
% 1.87/1.23 --proof_reduce_dot []
% 1.87/1.23 --suppress_sat_res false
% 1.87/1.23 --suppress_unsat_res true
% 1.87/1.23 --stats_out none
% 1.87/1.23 --stats_mem false
% 1.87/1.23 --theory_stats_out false
% 1.87/1.23
% 1.87/1.23 ------ General Options
% 1.87/1.23
% 1.87/1.23 --fof false
% 1.87/1.23 --time_out_real 304.98
% 1.87/1.23 --time_out_virtual -1.
% 1.87/1.23 --rnd_seed 13
% 1.87/1.23 --symbol_type_check false
% 1.87/1.23 --clausify_out false
% 1.87/1.23 --sig_cnt_out false
% 1.87/1.23 --trig_cnt_out false
% 1.87/1.23 --trig_cnt_out_tolerance 1.
% 1.87/1.23 --trig_cnt_out_sk_spl false
% 1.87/1.23 --abstr_cl_out false
% 1.87/1.23
% 1.87/1.23 ------ Interactive Mode
% 1.87/1.23
% 1.87/1.23 --interactive_mode false
% 1.87/1.23 --external_ip_address ""
% 1.87/1.23 --external_port 0
% 1.87/1.23
% 1.87/1.23 ------ Global Options
% 1.87/1.23
% 1.87/1.23 --schedule none
% 1.87/1.23 --add_important_lit false
% 1.87/1.23 --prop_solver_per_cl 500
% 1.87/1.23 --subs_bck_mult 8
% 1.87/1.23 --min_unsat_core false
% 1.87/1.23 --soft_assumptions false
% 1.87/1.23 --soft_lemma_size 3
% 1.87/1.23 --prop_impl_unit_size 0
% 1.87/1.23 --prop_impl_unit []
% 1.87/1.23 --share_sel_clauses true
% 1.87/1.23 --reset_solvers false
% 1.87/1.23 --bc_imp_inh [conj_cone]
% 1.87/1.23 --conj_cone_tolerance 3.
% 1.87/1.23 --extra_neg_conj none
% 1.87/1.23 --large_theory_mode true
% 1.87/1.23 --prolific_symb_bound 200
% 1.87/1.23 --lt_threshold 2000
% 1.87/1.23 --clause_weak_htbl true
% 1.87/1.23 --gc_record_bc_elim false
% 1.87/1.23
% 1.87/1.23 ------ Preprocessing Options
% 1.87/1.23
% 1.87/1.23 --preprocessing_flag false
% 1.87/1.23 --time_out_prep_mult 0.1
% 1.87/1.23 --splitting_mode input
% 1.87/1.23 --splitting_grd true
% 1.87/1.23 --splitting_cvd false
% 1.87/1.23 --splitting_cvd_svl false
% 1.87/1.23 --splitting_nvd 32
% 1.87/1.23 --sub_typing false
% 1.87/1.23 --prep_eq_flat_conj false
% 1.87/1.23 --prep_ineq_split false
% 1.87/1.23 --prep_eq_flat_all_gr false
% 1.87/1.23 --prep_gs_sim true
% 1.87/1.23 --prep_unflatten true
% 1.87/1.23 --prep_res_sim true
% 1.87/1.23 --prep_sup_sim_all true
% 1.87/1.23 --prep_sup_sim_sup false
% 1.87/1.23 --prep_upred true
% 1.87/1.23 --prep_well_definedness true
% 1.87/1.23 --prep_sem_filter exhaustive
% 1.87/1.23 --prep_sem_filter_out false
% 1.87/1.23 --pred_elim true
% 1.87/1.23 --res_sim_input true
% 1.87/1.23 --eq_ax_congr_red true
% 1.87/1.23 --pure_diseq_elim true
% 1.87/1.23 --brand_transform false
% 1.87/1.23 --non_eq_to_eq false
% 1.87/1.23 --prep_eq_proxy false
% 1.87/1.23 --prep_def_merge true
% 1.87/1.23 --prep_def_merge_prop_impl false
% 1.87/1.23 --prep_def_merge_mbd true
% 1.87/1.23 --prep_def_merge_tr_red false
% 1.87/1.23 --prep_def_merge_tr_cl false
% 1.87/1.23 --smt_preprocessing false
% 1.87/1.23 --smt_ac_axioms fast
% 1.87/1.23 --preprocessed_out false
% 1.87/1.23 --preprocessed_stats false
% 1.87/1.23
% 1.87/1.23 ------ Abstraction refinement Options
% 1.87/1.23
% 1.87/1.23 --abstr_ref []
% 1.87/1.23 --abstr_ref_prep false
% 1.87/1.23 --abstr_ref_until_sat false
% 1.87/1.23 --abstr_ref_sig_restrict funpre
% 1.87/1.23 --abstr_ref_af_restrict_to_split_sk false
% 1.87/1.23 --abstr_ref_under []
% 1.87/1.23
% 1.87/1.23 ------ SAT Options
% 1.87/1.23
% 1.87/1.23 --sat_mode true
% 1.87/1.23 --sat_fm_restart_options ""
% 1.87/1.23 --sat_gr_def false
% 1.87/1.23 --sat_epr_types true
% 1.87/1.23 --sat_non_cyclic_types false
% 1.87/1.23 --sat_finite_models true
% 1.87/1.23 --sat_fm_lemmas false
% 1.87/1.23 --sat_fm_prep false
% 1.87/1.23 --sat_fm_uc_incr true
% 1.87/1.23 --sat_out_model pos
% 1.87/1.23 --sat_out_clauses false
% 1.87/1.23
% 1.87/1.23 ------ QBF Options
% 1.87/1.23
% 1.87/1.23 --qbf_mode false
% 1.87/1.23 --qbf_elim_univ false
% 1.87/1.23 --qbf_dom_inst none
% 1.87/1.23 --qbf_dom_pre_inst false
% 1.87/1.23 --qbf_sk_in false
% 1.87/1.23 --qbf_pred_elim true
% 1.87/1.23 --qbf_split 512
% 1.87/1.23
% 1.87/1.23 ------ BMC1 Options
% 1.87/1.23
% 1.87/1.23 --bmc1_incremental false
% 1.87/1.23 --bmc1_axioms reachable_all
% 1.87/1.23 --bmc1_min_bound 0
% 1.87/1.23 --bmc1_max_bound -1
% 1.87/1.23 --bmc1_max_bound_default -1
% 1.87/1.23 --bmc1_symbol_reachability true
% 1.87/1.23 --bmc1_property_lemmas false
% 1.87/1.23 --bmc1_k_induction false
% 1.87/1.23 --bmc1_non_equiv_states false
% 1.87/1.23 --bmc1_deadlock false
% 1.87/1.23 --bmc1_ucm false
% 1.87/1.23 --bmc1_add_unsat_core none
% 1.87/1.23 --bmc1_unsat_core_children false
% 1.87/1.23 --bmc1_unsat_core_extrapolate_axioms false
% 1.87/1.23 --bmc1_out_stat full
% 1.87/1.23 --bmc1_ground_init false
% 1.87/1.23 --bmc1_pre_inst_next_state false
% 1.87/1.23 --bmc1_pre_inst_state false
% 1.87/1.23 --bmc1_pre_inst_reach_state false
% 1.87/1.23 --bmc1_out_unsat_core false
% 1.87/1.23 --bmc1_aig_witness_out false
% 1.87/1.23 --bmc1_verbose false
% 1.87/1.23 --bmc1_dump_clauses_tptp false
% 1.87/1.23 --bmc1_dump_unsat_core_tptp false
% 1.87/1.23 --bmc1_dump_file -
% 1.87/1.23 --bmc1_ucm_expand_uc_limit 128
% 1.87/1.23 --bmc1_ucm_n_expand_iterations 6
% 1.87/1.23 --bmc1_ucm_extend_mode 1
% 1.87/1.23 --bmc1_ucm_init_mode 2
% 1.87/1.23 --bmc1_ucm_cone_mode none
% 1.87/1.23 --bmc1_ucm_reduced_relation_type 0
% 1.87/1.23 --bmc1_ucm_relax_model 4
% 1.87/1.23 --bmc1_ucm_full_tr_after_sat true
% 1.87/1.23 --bmc1_ucm_expand_neg_assumptions false
% 1.87/1.23 --bmc1_ucm_layered_model none
% 1.87/1.23 --bmc1_ucm_max_lemma_size 10
% 1.87/1.23
% 1.87/1.23 ------ AIG Options
% 1.87/1.23
% 1.87/1.23 --aig_mode false
% 1.87/1.23
% 1.87/1.23 ------ Instantiation Options
% 1.87/1.23
% 1.87/1.23 --instantiation_flag true
% 1.87/1.23 --inst_sos_flag false
% 1.87/1.23 --inst_sos_phase true
% 1.87/1.23 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 1.87/1.23 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.87/1.23 --inst_lit_sel_side num_symb
% 1.87/1.23 --inst_solver_per_active 1400
% 1.87/1.23 --inst_solver_calls_frac 1.
% 1.87/1.23 --inst_to_smt_solver true
% 1.87/1.23 --inst_passive_queue_type priority_queues
% 1.87/1.23 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.87/1.23 --inst_passive_queues_freq [25;2]
% 1.87/1.23 --inst_dismatching true
% 1.87/1.23 --inst_eager_unprocessed_to_passive true
% 1.87/1.23 --inst_unprocessed_bound 1000
% 1.87/1.23 --inst_prop_sim_given true
% 1.87/1.23 --inst_prop_sim_new false
% 1.87/1.23 --inst_subs_new false
% 1.87/1.23 --inst_eq_res_simp false
% 1.87/1.23 --inst_subs_given false
% 1.87/1.23 --inst_orphan_elimination true
% 1.87/1.23 --inst_learning_loop_flag true
% 1.87/1.23 --inst_learning_start 3000
% 1.87/1.23 --inst_learning_factor 2
% 1.87/1.23 --inst_start_prop_sim_after_learn 3
% 1.87/1.23 --inst_sel_renew solver
% 1.87/1.23 --inst_lit_activity_flag true
% 1.87/1.23 --inst_restr_to_given false
% 1.87/1.23 --inst_activity_threshold 500
% 1.87/1.23
% 1.87/1.23 ------ Resolution Options
% 1.87/1.23
% 1.87/1.23 --resolution_flag false
% 1.87/1.23 --res_lit_sel adaptive
% 1.87/1.23 --res_lit_sel_side none
% 1.87/1.23 --res_ordering kbo
% 1.87/1.23 --res_to_prop_solver active
% 1.87/1.23 --res_prop_simpl_new false
% 1.87/1.23 --res_prop_simpl_given true
% 1.87/1.23 --res_to_smt_solver true
% 1.87/1.23 --res_passive_queue_type priority_queues
% 1.87/1.23 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.87/1.23 --res_passive_queues_freq [15;5]
% 1.87/1.23 --res_forward_subs full
% 1.87/1.23 --res_backward_subs full
% 1.87/1.23 --res_forward_subs_resolution true
% 1.87/1.23 --res_backward_subs_resolution true
% 1.87/1.23 --res_orphan_elimination true
% 1.87/1.23 --res_time_limit 300.
% 1.87/1.23
% 1.87/1.23 ------ Superposition Options
% 1.87/1.23
% 1.87/1.23 --superposition_flag false
% 1.87/1.23 --sup_passive_queue_type priority_queues
% 1.87/1.23 --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]]
% 1.87/1.23 --sup_passive_queues_freq [8;1;4;4]
% 1.87/1.23 --twee_lhs_weight 4
% 1.87/1.23 --sup_set_join false
% 1.87/1.23 --sup_set_join_goals true
% 1.87/1.23 --sup_set_join_limit 1000
% 1.87/1.23 --demod_completeness_check fast
% 1.87/1.23 --demod_use_ground true
% 1.87/1.23 --sup_unprocessed_bound 0
% 1.87/1.23 --sup_to_prop_solver passive
% 1.87/1.23 --sup_prop_simpl_new true
% 1.87/1.23 --sup_prop_simpl_given true
% 1.87/1.23 --sup_fun_splitting false
% 1.87/1.23 --sup_iter_deepening 2
% 1.87/1.23 --sup_restarts_mult 12
% 1.87/1.23 --sup_score sim_d_gen
% 1.87/1.23 --sup_share_score_frac 0.2
% 1.87/1.23 --sup_share_max_num_cl 500
% 1.87/1.23 --sup_ordering kbo
% 1.87/1.23 --sup_symb_ordering invfreq
% 1.87/1.23 --sup_term_weight default
% 1.87/1.23
% 1.87/1.23 ------ Superposition Simplification Setup
% 1.87/1.23
% 1.87/1.23 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 1.87/1.23 --sup_full_triv [SMTSimplify;PropSubs]
% 1.87/1.23 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 1.87/1.23 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 1.87/1.23 --sup_immed_triv []
% 1.87/1.23 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 1.87/1.23 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 1.87/1.23 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 1.87/1.23 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 1.87/1.23 --sup_input_triv [Unflattening;SMTSimplify]
% 1.87/1.23 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 1.87/1.23 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 1.87/1.23 --sup_full_fixpoint true
% 1.87/1.23 --sup_main_fixpoint true
% 1.87/1.23 --sup_immed_fixpoint false
% 1.87/1.23 --sup_input_fixpoint true
% 1.87/1.23 --sup_cache_sim none
% 1.87/1.23 --sup_smt_interval 500
% 1.87/1.23 --sup_bw_gjoin_interval 0
% 1.87/1.23
% 1.87/1.23 ------ Combination Options
% 1.87/1.23
% 1.87/1.23 --comb_mode clause_based
% 1.87/1.23 --comb_inst_mult 5
% 1.87/1.23 --comb_res_mult 1
% 1.87/1.23 --comb_sup_mult 8
% 1.87/1.23 --comb_sup_deep_mult 2
% 1.87/1.23
% 1.87/1.23 ------ Debug Options
% 1.87/1.23
% 1.87/1.23 --dbg_backtrace false
% 1.87/1.23 --dbg_dump_prop_clauses false
% 1.87/1.23 --dbg_dump_prop_clauses_file -
% 1.87/1.23 --dbg_out_stat false
% 1.87/1.23 --dbg_just_parse false
% 1.87/1.23
% 1.87/1.23
% 1.87/1.23
% 1.87/1.23
% 1.87/1.23 ------ Proving...
% 1.87/1.23
% 1.87/1.23 ------ Trying domains of size >= : 2
% 1.87/1.23
% 1.87/1.23 ------ Trying domains of size >= : 2
% 1.87/1.23
% 1.87/1.23 ------ Trying domains of size >= : 2
% 1.87/1.23
% 1.87/1.23 ------ Trying domains of size >= : 3
% 1.87/1.23
% 1.87/1.23
% 1.87/1.23 ------ Proving...
% 1.87/1.23
% 1.87/1.23 ------ Trying domains of size >= : 3
% 1.87/1.23
% 1.87/1.23
% 1.87/1.23 ------ Proving...
% 1.87/1.23
% 1.87/1.23
% 1.87/1.23 % SZS status Satisfiable for theBenchmark.p
% 1.87/1.23
% 1.87/1.23 ------ Building Model...Done
% 1.87/1.23
% 1.87/1.23 %------ The model is defined over ground terms (initial term algebra).
% 1.87/1.23 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.87/1.23 %------ where \phi is a formula over the term algebra.
% 1.87/1.23 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.87/1.23 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.87/1.23 %------ See help for --sat_out_model for different model outputs.
% 1.87/1.23 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.87/1.23 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.87/1.23 % SZS output start Model for theBenchmark.p
% See solution above
% 1.87/1.23
%------------------------------------------------------------------------------