%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN432-1 : TPTP v9.3.1. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/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:11 PM UTC 2026
% Result : Satisfiable 1.80s 1.23s
% Output : Model 1.80s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of hskp29
fof(lit_def,axiom,
( hskp29
<=> $false ) ).
%------ Positive definition of ndr1_0
fof(lit_def_001,axiom,
( ndr1_0
<=> $true ) ).
%------ Positive definition of hskp27
fof(lit_def_002,axiom,
( hskp27
<=> $false ) ).
%------ Positive definition of hskp26
fof(lit_def_003,axiom,
( hskp26
<=> $false ) ).
%------ Positive definition of hskp25
fof(lit_def_004,axiom,
( hskp25
<=> $true ) ).
%------ Positive definition of hskp24
fof(lit_def_005,axiom,
( hskp24
<=> $false ) ).
%------ Positive definition of hskp23
fof(lit_def_006,axiom,
( hskp23
<=> $true ) ).
%------ Positive definition of hskp21
fof(lit_def_007,axiom,
( hskp21
<=> $false ) ).
%------ Positive definition of hskp19
fof(lit_def_008,axiom,
( hskp19
<=> $true ) ).
%------ Positive definition of hskp18
fof(lit_def_009,axiom,
( hskp18
<=> $true ) ).
%------ Positive definition of hskp17
fof(lit_def_010,axiom,
( hskp17
<=> $true ) ).
%------ Positive definition of hskp16
fof(lit_def_011,axiom,
( hskp16
<=> $false ) ).
%------ Positive definition of hskp15
fof(lit_def_012,axiom,
( hskp15
<=> $true ) ).
%------ Positive definition of hskp14
fof(lit_def_013,axiom,
( hskp14
<=> $true ) ).
%------ Positive definition of hskp13
fof(lit_def_014,axiom,
( hskp13
<=> $true ) ).
%------ Positive definition of hskp12
fof(lit_def_015,axiom,
( hskp12
<=> $false ) ).
%------ Positive definition of hskp11
fof(lit_def_016,axiom,
( hskp11
<=> $true ) ).
%------ Positive definition of hskp10
fof(lit_def_017,axiom,
( hskp10
<=> $true ) ).
%------ Positive definition of hskp9
fof(lit_def_018,axiom,
( hskp9
<=> $true ) ).
%------ Positive definition of hskp8
fof(lit_def_019,axiom,
( hskp8
<=> $true ) ).
%------ Positive definition of hskp7
fof(lit_def_020,axiom,
( hskp7
<=> $false ) ).
%------ Positive definition of hskp6
fof(lit_def_021,axiom,
( hskp6
<=> $true ) ).
%------ Positive definition of hskp5
fof(lit_def_022,axiom,
( hskp5
<=> $true ) ).
%------ Positive definition of hskp4
fof(lit_def_023,axiom,
( hskp4
<=> $false ) ).
%------ Positive definition of hskp3
fof(lit_def_024,axiom,
( hskp3
<=> $true ) ).
%------ Positive definition of hskp2
fof(lit_def_025,axiom,
( hskp2
<=> $false ) ).
%------ Positive definition of hskp1
fof(lit_def_026,axiom,
( hskp1
<=> $false ) ).
%------ Positive definition of hskp0
fof(lit_def_027,axiom,
( hskp0
<=> $false ) ).
%------ Positive definition of c2_1
fof(lit_def_028,axiom,
! [X0] :
( c2_1(X0)
<=> ( X0 = a195
| X0 = a162
| X0 = a170
| X0 = a174
| X0 = a175
| X0 = a184 ) ) ).
%------ Positive definition of c3_1
fof(lit_def_029,axiom,
! [X0] :
( c3_1(X0)
<=> ( X0 = a173
| X0 = a192
| X0 = a195
| X0 = a163
| X0 = a166
| X0 = a167
| X0 = a170
| X0 = a175
| X0 = a177
| X0 = a184 ) ) ).
%------ Positive definition of c0_1
fof(lit_def_030,axiom,
! [X0] :
( c0_1(X0)
<=> ( X0 = a181
| X0 = a163
| X0 = a167
| X0 = a170
| X0 = a174
| X0 = a184 ) ) ).
%------ Positive definition of c1_1
fof(lit_def_031,axiom,
! [X0] :
( c1_1(X0)
<=> ( X0 = a166
| X0 = a170
| X0 = a175
| X0 = a177
| X0 = a184
| X0 = a186 ) ) ).
%------ Positive definition of iPr_def_10
fof(lit_def_032,axiom,
( iPr_def_10
<=> $true ) ).
%------ Positive definition of iPr_def_11
fof(lit_def_033,axiom,
( iPr_def_11
<=> $false ) ).
%------ Positive definition of iPr_def_12
fof(lit_def_034,axiom,
( iPr_def_12
<=> $false ) ).
%------ Positive definition of iPr_def_13
fof(lit_def_035,axiom,
( iPr_def_13
<=> $false ) ).
%------ Positive definition of iPr_def_14
fof(lit_def_036,axiom,
( iPr_def_14
<=> $false ) ).
%------ Positive definition of iPr_def_15
fof(lit_def_037,axiom,
( iPr_def_15
<=> $false ) ).
%------ Positive definition of iPr_def_16
fof(lit_def_038,axiom,
( iPr_def_16
<=> $false ) ).
%------ Positive definition of iPr_def_17
fof(lit_def_039,axiom,
( iPr_def_17
<=> $false ) ).
%------ Positive definition of iPr_def_18
fof(lit_def_040,axiom,
( iPr_def_18
<=> $false ) ).
%------ Positive definition of iPr_def_19
fof(lit_def_041,axiom,
( iPr_def_19
<=> $false ) ).
%------ Positive definition of iPr_def_20
fof(lit_def_042,axiom,
( iPr_def_20
<=> $false ) ).
%------ Positive definition of iPr_def_21
fof(lit_def_043,axiom,
( iPr_def_21
<=> $false ) ).
%------ Positive definition of iPr_def_22
fof(lit_def_044,axiom,
( iPr_def_22
<=> $false ) ).
%------ Positive definition of iPr_def_23
fof(lit_def_045,axiom,
( iPr_def_23
<=> $false ) ).
%------ Positive definition of iPr_def_24
fof(lit_def_046,axiom,
( iPr_def_24
<=> $false ) ).
%------ Positive definition of iPr_def_25
fof(lit_def_047,axiom,
( iPr_def_25
<=> $false ) ).
%------ Positive definition of iPr_def_26
fof(lit_def_048,axiom,
( iPr_def_26
<=> $false ) ).
%------ Positive definition of iPr_def_27
fof(lit_def_049,axiom,
( iPr_def_27
<=> $false ) ).
%------ Positive definition of iPr_def_28
fof(lit_def_050,axiom,
( iPr_def_28
<=> $false ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYN432-1 : TPTP v9.3.1. Released v2.1.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.43 % Computer : n019.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Fri Sep 25 01:10:04 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.50 Running EPR theorem proving
% 0.17/0.50 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.26/0.51
% 0.26/0.51 % ======== iProver multi-core TPTP/SMT =========
% 0.26/0.51
% 0.26/0.51 % Detected problem language: tptp
% 0.26/0.53 % Proving...
% 1.80/1.23 % SZS status Started for theBenchmark.p
% 1.80/1.23 % SZS status Satisfiable for theBenchmark.p
% 1.80/1.23
% 1.80/1.23 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.80/1.23
% 1.80/1.23 % ------ iProver source info
% 1.80/1.23
% 1.80/1.23 % git: date: 2026-07-19 20:42:38 +0200
% 1.80/1.23 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.80/1.23 % git: non_committed_changes: false
% 1.80/1.23
% 1.80/1.23 % ------ Parsing...% successful
% 1.80/1.23
% 1.80/1.23
% 1.80/1.23 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 1.80/1.23 %
% 1.80/1.23
% 1.80/1.23 % ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.80/1.23
% 1.80/1.23 % ------ Preprocessing...% ------ preprocesses with Option_epr_non_horn_non_eq
% 1.80/1.23 gs_s sp: 26 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.80/1.23 % ------ Proving...
% 1.80/1.23 % ------ Problem Properties
% 1.80/1.23
% 1.80/1.23 %
% 1.80/1.23 % clauses 126
% 1.80/1.23 % conjectures 117
% 1.80/1.23 % EPR 126
% 1.80/1.23 % Horn 89
% 1.80/1.23 % unary 0
% 1.80/1.23 % binary 81
% 1.80/1.23 % lits 316
% 1.80/1.23 % lits eq 0
% 1.80/1.23 % fd_pure 0
% 1.80/1.23 % fd_pseudo 0
% 1.80/1.23 % fd_cond 0
% 1.80/1.23 % fd_pseudo_cond 0
% 1.80/1.23 % AC symbols 0
% 1.80/1.23
% 1.80/1.23 % ------ Schedule EPR non Horn non eq is on
% 1.80/1.23
% 1.80/1.23 % ------ no equalities: superposition off
% 1.80/1.23
% 1.80/1.23 % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 1.80/1.23
% 1.80/1.23
% 1.80/1.23 % ------
% 1.80/1.23 % Current options:
% 1.80/1.23 % ------
% 1.80/1.23
% 1.80/1.23
% 1.80/1.23 %
% 1.80/1.23
% 1.80/1.23 % ------ Proving...
% 1.80/1.23 %
% 1.80/1.23
% 1.80/1.23 % SZS status Satisfiable for theBenchmark.p
% 1.80/1.23
% 1.80/1.23 ------ Building Model...Done
% 1.80/1.23
% 1.80/1.23 %------ The model is defined over ground terms (initial term algebra).
% 1.80/1.23 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.80/1.23 %------ where \phi is a formula over the term algebra.
% 1.80/1.23 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.80/1.23 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.80/1.23 %------ See help for --sat_out_model for different model outputs.
% 1.80/1.23 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.80/1.23 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.80/1.23 % SZS output start Model for theBenchmark.p
% See solution above
% 1.80/1.23
%------------------------------------------------------------------------------