%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN446-1 : TPTP v9.3.1. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n019.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:40:15 PM UTC 2026
% Result : Satisfiable 3.27s 1.16s
% Output : Model 3.27s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of hskp8
fof(lit_def,axiom,
( hskp8
<=> $true ) ).
%------ Positive definition of hskp17
fof(lit_def_001,axiom,
( hskp17
<=> $false ) ).
%------ Positive definition of hskp30
fof(lit_def_002,axiom,
( hskp30
<=> $true ) ).
%------ Positive definition of ndr1_0
fof(lit_def_003,axiom,
( ndr1_0
<=> $true ) ).
%------ Positive definition of hskp29
fof(lit_def_004,axiom,
( hskp29
<=> $false ) ).
%------ Positive definition of hskp28
fof(lit_def_005,axiom,
( hskp28
<=> $true ) ).
%------ Positive definition of hskp27
fof(lit_def_006,axiom,
( hskp27
<=> $false ) ).
%------ Positive definition of hskp26
fof(lit_def_007,axiom,
( hskp26
<=> $false ) ).
%------ Positive definition of hskp25
fof(lit_def_008,axiom,
( hskp25
<=> $false ) ).
%------ Positive definition of hskp24
fof(lit_def_009,axiom,
( hskp24
<=> $false ) ).
%------ Positive definition of hskp23
fof(lit_def_010,axiom,
( hskp23
<=> $true ) ).
%------ Positive definition of hskp22
fof(lit_def_011,axiom,
( hskp22
<=> $false ) ).
%------ Positive definition of hskp21
fof(lit_def_012,axiom,
( hskp21
<=> $true ) ).
%------ Positive definition of hskp20
fof(lit_def_013,axiom,
( hskp20
<=> $false ) ).
%------ Positive definition of hskp19
fof(lit_def_014,axiom,
( hskp19
<=> $true ) ).
%------ Positive definition of hskp18
fof(lit_def_015,axiom,
( hskp18
<=> $false ) ).
%------ Positive definition of hskp16
fof(lit_def_016,axiom,
( hskp16
<=> $false ) ).
%------ Positive definition of hskp15
fof(lit_def_017,axiom,
( hskp15
<=> $true ) ).
%------ Positive definition of hskp14
fof(lit_def_018,axiom,
( hskp14
<=> $false ) ).
%------ Positive definition of hskp13
fof(lit_def_019,axiom,
( hskp13
<=> $false ) ).
%------ Positive definition of hskp12
fof(lit_def_020,axiom,
( hskp12
<=> $true ) ).
%------ Positive definition of hskp11
fof(lit_def_021,axiom,
( hskp11
<=> $true ) ).
%------ Positive definition of hskp10
fof(lit_def_022,axiom,
( hskp10
<=> $true ) ).
%------ Positive definition of hskp9
fof(lit_def_023,axiom,
( hskp9
<=> $false ) ).
%------ Positive definition of hskp7
fof(lit_def_024,axiom,
( hskp7
<=> $true ) ).
%------ Positive definition of hskp6
fof(lit_def_025,axiom,
( hskp6
<=> $false ) ).
%------ Positive definition of hskp5
fof(lit_def_026,axiom,
( hskp5
<=> $true ) ).
%------ Positive definition of hskp4
fof(lit_def_027,axiom,
( hskp4
<=> $true ) ).
%------ Positive definition of hskp3
fof(lit_def_028,axiom,
( hskp3
<=> $true ) ).
%------ Positive definition of hskp2
fof(lit_def_029,axiom,
( hskp2
<=> $false ) ).
%------ Positive definition of hskp1
fof(lit_def_030,axiom,
( hskp1
<=> $true ) ).
%------ Positive definition of hskp0
fof(lit_def_031,axiom,
( hskp0
<=> $true ) ).
%------ Positive definition of c0_1
fof(lit_def_032,axiom,
! [X0] :
( c0_1(X0)
<=> ( X0 = a376
| X0 = a380
| X0 = a385
| X0 = a387
| X0 = a392
| X0 = a394
| X0 = a395
| X0 = a398
| X0 = a400
| X0 = a401
| X0 = a404
| X0 = a407
| X0 = a418
| X0 = a374
| X0 = a390
| X0 = a397
| ( X0 != a379
& X0 != a399
& X0 != a420
& X0 != a427
& X0 != a375
& X0 != a376
& X0 != a377
& X0 != a378
& X0 != a380
& X0 != a381
& X0 != a384
& X0 != a385
& X0 != a387
& X0 != a392
& X0 != a394
& X0 != a395
& X0 != a396
& X0 != a398
& X0 != a400
& X0 != a401
& X0 != a404
& X0 != a407
& X0 != a409
& X0 != a411
& X0 != a418
& X0 != a424
& X0 != a425
& X0 != a386
& X0 != a390
& X0 != a397 ) ) ) ).
%------ Positive definition of c2_1
fof(lit_def_033,axiom,
! [X0] :
( c2_1(X0)
<=> ( X0 = a381
| X0 = a385
| X0 = a409
| X0 = a411
| X0 = a424
| X0 = a386
| X0 = a397 ) ) ).
%------ Positive definition of c3_1
fof(lit_def_034,axiom,
! [X0] :
( c3_1(X0)
<=> ( X0 = a375
| X0 = a377
| X0 = a378
| X0 = a381
| X0 = a384
| X0 = a385
| X0 = a387
| X0 = a394
| X0 = a395
| X0 = a396
| X0 = a398
| X0 = a400
| X0 = a401
| X0 = a407
| X0 = a409
| X0 = a411
| X0 = a424
| X0 = a425
| X0 = a386
| X0 = a397
| ( X0 != a379
& X0 != a399
& X0 != a420
& X0 != a427
& X0 != a375
& X0 != a376
& X0 != a377
& X0 != a378
& X0 != a380
& X0 != a381
& X0 != a384
& X0 != a385
& X0 != a387
& X0 != a392
& X0 != a394
& X0 != a396
& X0 != a398
& X0 != a400
& X0 != a401
& X0 != a404
& X0 != a407
& X0 != a409
& X0 != a411
& X0 != a418
& X0 != a425
& X0 != a386
& X0 != a390
& X0 != a397 ) ) ) ).
%------ Positive definition of c1_1
fof(lit_def_035,axiom,
! [X0] :
( c1_1(X0)
<=> ( X0 = a375
| X0 = a376
| X0 = a377
| X0 = a378
| X0 = a380
| X0 = a381
| X0 = a384
| X0 = a392
| X0 = a396
| X0 = a404
| X0 = a409
| X0 = a411
| X0 = a418
| X0 = a424
| X0 = a425
| X0 = a386
| X0 = a390 ) ) ).
%------ Positive definition of iPr_def_10
fof(lit_def_036,axiom,
( iPr_def_10
<=> $false ) ).
%------ Positive definition of iPr_def_11
fof(lit_def_037,axiom,
( iPr_def_11
<=> $true ) ).
%------ Positive definition of iPr_def_12
fof(lit_def_038,axiom,
( iPr_def_12
<=> $false ) ).
%------ Positive definition of iPr_def_13
fof(lit_def_039,axiom,
( iPr_def_13
<=> $false ) ).
%------ Positive definition of iPr_def_14
fof(lit_def_040,axiom,
( iPr_def_14
<=> $true ) ).
%------ Positive definition of iPr_def_15
fof(lit_def_041,axiom,
( iPr_def_15
<=> $false ) ).
%------ Positive definition of iPr_def_16
fof(lit_def_042,axiom,
( iPr_def_16
<=> $false ) ).
%------ Positive definition of iPr_def_17
fof(lit_def_043,axiom,
( iPr_def_17
<=> $false ) ).
%------ Positive definition of iPr_def_18
fof(lit_def_044,axiom,
( iPr_def_18
<=> $true ) ).
%------ Positive definition of iPr_def_19
fof(lit_def_045,axiom,
( iPr_def_19
<=> $false ) ).
%------ Positive definition of iPr_def_20
fof(lit_def_046,axiom,
( iPr_def_20
<=> $true ) ).
%------ Positive definition of iPr_def_21
fof(lit_def_047,axiom,
( iPr_def_21
<=> $false ) ).
%------ Positive definition of iPr_def_22
fof(lit_def_048,axiom,
( iPr_def_22
<=> $true ) ).
%------ Positive definition of iPr_def_23
fof(lit_def_049,axiom,
( iPr_def_23
<=> $false ) ).
%------ Positive definition of iPr_def_24
fof(lit_def_050,axiom,
( iPr_def_24
<=> $true ) ).
%------ Positive definition of iPr_def_25
fof(lit_def_051,axiom,
( iPr_def_25
<=> $true ) ).
%------ Positive definition of iPr_def_26
fof(lit_def_052,axiom,
( iPr_def_26
<=> $true ) ).
%------ Positive definition of iPr_def_27
fof(lit_def_053,axiom,
( iPr_def_27
<=> $false ) ).
%------ Positive definition of iPr_def_28
fof(lit_def_054,axiom,
( iPr_def_28
<=> $false ) ).
%------ Positive definition of iPr_def_29
fof(lit_def_055,axiom,
( iPr_def_29
<=> $false ) ).
%------ Positive definition of iPr_def_30
fof(lit_def_056,axiom,
( iPr_def_30
<=> $false ) ).
%------ Positive definition of iPr_def_31
fof(lit_def_057,axiom,
( iPr_def_31
<=> $false ) ).
%------ Positive definition of iPr_def_32
fof(lit_def_058,axiom,
( iPr_def_32
<=> $false ) ).
%------ Positive definition of iPr_def_33
fof(lit_def_059,axiom,
( iPr_def_33
<=> $true ) ).
%------ Positive definition of iPr_def_34
fof(lit_def_060,axiom,
( iPr_def_34
<=> $true ) ).
%------ Positive definition of iPr_def_35
fof(lit_def_061,axiom,
( iPr_def_35
<=> $false ) ).
%------ Positive definition of iPr_def_36
fof(lit_def_062,axiom,
( iPr_def_36
<=> $false ) ).
%------ Positive definition of iPr_def_37
fof(lit_def_063,axiom,
( iPr_def_37
<=> $true ) ).
%------ Positive definition of iPr_def_38
fof(lit_def_064,axiom,
( iPr_def_38
<=> $false ) ).
%------ Positive definition of iPr_def_39
fof(lit_def_065,axiom,
( iPr_def_39
<=> $false ) ).
%------ Positive definition of iPr_def_40
fof(lit_def_066,axiom,
( iPr_def_40
<=> $false ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN446-1 : TPTP v9.3.1. Released v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n019.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 01:13:49 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40 Running EPR theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s epr_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 3.27/1.16 % SZS status Started for theBenchmark.p
% 3.27/1.16 % SZS status Satisfiable for theBenchmark.p
% 3.27/1.16
% 3.27/1.16 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.27/1.16
% 3.27/1.16 % ------ iProver source info
% 3.27/1.16
% 3.27/1.16 % git: date: 2026-07-19 20:42:38 +0200
% 3.27/1.16 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.27/1.16 % git: non_committed_changes: false
% 3.27/1.16
% 3.27/1.16 % ------ Parsing...% successful
% 3.27/1.16
% 3.27/1.16
% 3.27/1.16 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 3.27/1.16 %
% 3.27/1.16
% 3.27/1.16 % ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.27/1.16
% 3.27/1.16 % ------ Preprocessing...% ------ preprocesses with Option_epr_non_horn_non_eq
% 3.27/1.16 gs_s sp: 91 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.27/1.16 % ------ Proving...
% 3.27/1.16 % ------ Problem Properties
% 3.27/1.16
% 3.27/1.16 %
% 3.27/1.16 % clauses 184
% 3.27/1.16 % conjectures 184
% 3.27/1.16 % EPR 184
% 3.27/1.16 % Horn 109
% 3.27/1.16 % unary 0
% 3.27/1.16 % binary 94
% 3.27/1.16 % lits 489
% 3.27/1.16 % lits eq 0
% 3.27/1.16 % fd_pure 0
% 3.27/1.16 % fd_pseudo 0
% 3.27/1.16 % fd_cond 0
% 3.27/1.16 % fd_pseudo_cond 0
% 3.27/1.16 % AC symbols 0
% 3.27/1.16
% 3.27/1.16 % ------ Schedule EPR non Horn non eq is on
% 3.27/1.16
% 3.27/1.16 % ------ no equalities: superposition off
% 3.27/1.16
% 3.27/1.16 % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 3.27/1.16
% 3.27/1.16
% 3.27/1.16 % ------
% 3.27/1.16 % Current options:
% 3.27/1.16 % ------
% 3.27/1.16
% 3.27/1.16
% 3.27/1.16 %
% 3.27/1.16
% 3.27/1.16 % ------ Proving...
% 3.27/1.16 %
% 3.27/1.16
% 3.27/1.16 % SZS status Satisfiable for theBenchmark.p
% 3.27/1.16
% 3.27/1.16 ------ Building Model...Done
% 3.27/1.16
% 3.27/1.16 %------ The model is defined over ground terms (initial term algebra).
% 3.27/1.16 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.27/1.16 %------ where \phi is a formula over the term algebra.
% 3.27/1.16 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.27/1.16 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.27/1.16 %------ See help for --sat_out_model for different model outputs.
% 3.27/1.16 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.27/1.16 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.27/1.16 % SZS output start Model for theBenchmark.p
% See solution above
% 3.27/1.17
%------------------------------------------------------------------------------