%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN421-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 : n014.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:08 PM UTC 2026
% Result : Satisfiable 2.79s 11.15s
% Output : Model 2.79s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of ndr1_0
fof(lit_def,axiom,
( ndr1_0
<=> $true ) ).
%------ Positive definition of c1_0
fof(lit_def_001,axiom,
( c1_0
<=> $false ) ).
%------ Positive definition of c5_0
fof(lit_def_002,axiom,
( c5_0
<=> $true ) ).
%------ Positive definition of c4_0
fof(lit_def_003,axiom,
( c4_0
<=> $false ) ).
%------ Positive definition of c9_0
fof(lit_def_004,axiom,
( c9_0
<=> $true ) ).
%------ Positive definition of ssSkC32
fof(lit_def_005,axiom,
( ssSkC32
<=> $true ) ).
%------ Positive definition of ssSkC31
fof(lit_def_006,axiom,
( ssSkC31
<=> $true ) ).
%------ Positive definition of ssSkC30
fof(lit_def_007,axiom,
( ssSkC30
<=> $false ) ).
%------ Positive definition of ssSkC29
fof(lit_def_008,axiom,
( ssSkC29
<=> $true ) ).
%------ Positive definition of ssSkC26
fof(lit_def_009,axiom,
( ssSkC26
<=> $false ) ).
%------ Positive definition of ssSkC25
fof(lit_def_010,axiom,
( ssSkC25
<=> $true ) ).
%------ Positive definition of ssSkC18
fof(lit_def_011,axiom,
( ssSkC18
<=> $false ) ).
%------ Positive definition of ssSkC14
fof(lit_def_012,axiom,
( ssSkC14
<=> $false ) ).
%------ Positive definition of ssSkC13
fof(lit_def_013,axiom,
( ssSkC13
<=> $false ) ).
%------ Positive definition of ssSkC8
fof(lit_def_014,axiom,
( ssSkC8
<=> $true ) ).
%------ Positive definition of ssSkC7
fof(lit_def_015,axiom,
( ssSkC7
<=> $false ) ).
%------ Positive definition of ssSkC6
fof(lit_def_016,axiom,
( ssSkC6
<=> $true ) ).
%------ Positive definition of ssSkC4
fof(lit_def_017,axiom,
( ssSkC4
<=> $true ) ).
%------ Positive definition of ssSkC3
fof(lit_def_018,axiom,
( ssSkC3
<=> $true ) ).
%------ Positive definition of ssSkC1
fof(lit_def_019,axiom,
( ssSkC1
<=> $true ) ).
%------ Positive definition of ssSkC0
fof(lit_def_020,axiom,
( ssSkC0
<=> $true ) ).
%------ Positive definition of c8_0
fof(lit_def_021,axiom,
( c8_0
<=> $false ) ).
%------ Positive definition of c3_0
fof(lit_def_022,axiom,
( c3_0
<=> $false ) ).
%------ Positive definition of c10_0
fof(lit_def_023,axiom,
( c10_0
<=> $true ) ).
%------ Positive definition of c7_0
fof(lit_def_024,axiom,
( c7_0
<=> $false ) ).
%------ Positive definition of ndr1_1
fof(lit_def_025,axiom,
! [X0] :
( ndr1_1(X0)
<=> $true ) ).
%------ Positive definition of c5_1
fof(lit_def_026,axiom,
! [X0] :
( c5_1(X0)
<=> ( X0 = a454
| X0 = a537
| X0 = a571
| X0 != a585 ) ) ).
%------ Positive definition of c2_0
fof(lit_def_027,axiom,
( c2_0
<=> $false ) ).
%------ Positive definition of ssSkC21
fof(lit_def_028,axiom,
( ssSkC21
<=> $true ) ).
%------ Positive definition of ssSkC17
fof(lit_def_029,axiom,
( ssSkC17
<=> $true ) ).
%------ Positive definition of ssSkC11
fof(lit_def_030,axiom,
( ssSkC11
<=> $false ) ).
%------ Positive definition of c6_0
fof(lit_def_031,axiom,
( c6_0
<=> $false ) ).
%------ Positive definition of ssSkC5
fof(lit_def_032,axiom,
( ssSkC5
<=> $false ) ).
%------ Positive definition of c7_1
fof(lit_def_033,axiom,
! [X0] :
( c7_1(X0)
<=> $false ) ).
%------ Positive definition of c9_1
fof(lit_def_034,axiom,
! [X0] :
( c9_1(X0)
<=> ( X0 = a517
| X0 = a585 ) ) ).
%------ Positive definition of ssSkP10
fof(lit_def_035,axiom,
! [X0] :
( ssSkP10(X0)
<=> $true ) ).
%------ Positive definition of ssSkP9
fof(lit_def_036,axiom,
! [X0] :
( ssSkP9(X0)
<=> $false ) ).
%------ Positive definition of ssSkP8
fof(lit_def_037,axiom,
! [X0] :
( ssSkP8(X0)
<=> $true ) ).
%------ Positive definition of ssSkP7
fof(lit_def_038,axiom,
! [X0] :
( ssSkP7(X0)
<=> $true ) ).
%------ Positive definition of ssSkP6
fof(lit_def_039,axiom,
! [X0] :
( ssSkP6(X0)
<=> $true ) ).
%------ Positive definition of c4_1
fof(lit_def_040,axiom,
! [X0] :
( c4_1(X0)
<=> X0 = a523 ) ).
%------ Positive definition of ssSkP5
fof(lit_def_041,axiom,
! [X0] :
( ssSkP5(X0)
<=> $true ) ).
%------ Positive definition of ssSkP4
fof(lit_def_042,axiom,
! [X0] :
( ssSkP4(X0)
<=> $true ) ).
%------ Positive definition of ssSkP3
fof(lit_def_043,axiom,
! [X0] :
( ssSkP3(X0)
<=> $true ) ).
%------ Positive definition of c2_1
fof(lit_def_044,axiom,
! [X0] :
( c2_1(X0)
<=> X0 = a488 ) ).
%------ Positive definition of c6_1
fof(lit_def_045,axiom,
! [X0] :
( c6_1(X0)
<=> $false ) ).
%------ Positive definition of c10_1
fof(lit_def_046,axiom,
! [X0] :
( c10_1(X0)
<=> $true ) ).
%------ Positive definition of c1_1
fof(lit_def_047,axiom,
! [X0] :
( c1_1(X0)
<=> $false ) ).
%------ Positive definition of ssSkP1
fof(lit_def_048,axiom,
! [X0] :
( ssSkP1(X0)
<=> $true ) ).
%------ Positive definition of ssSkP0
fof(lit_def_049,axiom,
! [X0] :
( ssSkP0(X0)
<=> $true ) ).
%------ Positive definition of c3_1
fof(lit_def_050,axiom,
! [X0] :
( c3_1(X0)
<=> $false ) ).
%------ Positive definition of c8_1
fof(lit_def_051,axiom,
! [X0] :
( c8_1(X0)
<=> $false ) ).
%------ Positive definition of c9_2
fof(lit_def_052,axiom,
! [X0,X1] :
( c9_2(X0,X1)
<=> ( ( X1 = a568
& X0 = a488 )
| ( X1 = a518
& X0 = a517 )
| ( X1 = a544
& X0 = a585 )
| ( X1 = a572
& X0 = a571 ) ) ) ).
%------ Positive definition of ssSkC24
fof(lit_def_053,axiom,
( ssSkC24
<=> $false ) ).
%------ Positive definition of ssSkC20
fof(lit_def_054,axiom,
( ssSkC20
<=> $false ) ).
%------ Positive definition of ssSkC12
fof(lit_def_055,axiom,
( ssSkC12
<=> $false ) ).
%------ Positive definition of c5_2
fof(lit_def_056,axiom,
! [X0,X1] :
( c5_2(X0,X1)
<=> ( X1 = a483
& X0 = a481 ) ) ).
%------ Positive definition of c6_2
fof(lit_def_057,axiom,
! [X0,X1] :
( c6_2(X0,X1)
<=> ( X1 = a482
& X0 = a481 ) ) ).
%------ Positive definition of c1_2
fof(lit_def_058,axiom,
! [X0,X1] :
( c1_2(X0,X1)
<=> $false ) ).
%------ Positive definition of c3_2
fof(lit_def_059,axiom,
! [X0,X1] :
( c3_2(X0,X1)
<=> $false ) ).
%------ Positive definition of c2_2
fof(lit_def_060,axiom,
! [X0,X1] :
( c2_2(X0,X1)
<=> ( X1 = a483
& X0 = a481 ) ) ).
%------ Positive definition of c7_2
fof(lit_def_061,axiom,
! [X0,X1] :
( c7_2(X0,X1)
<=> ( X1 = a546
& X0 = a488 ) ) ).
%------ Positive definition of c4_2
fof(lit_def_062,axiom,
! [X0,X1] :
( c4_2(X0,X1)
<=> ( ( X1 = a482
& X0 = a481 )
| ( X1 = a524
& X0 = a523 )
| ( X1 = a544
& X0 = a585 ) ) ) ).
%------ Positive definition of c8_2
fof(lit_def_063,axiom,
! [X0,X1] :
( c8_2(X0,X1)
<=> ( ( X1 = a518
& X0 = a517 )
| ( X1 = a524
& X0 = a523 ) ) ) ).
%------ Positive definition of ssSkC16
fof(lit_def_064,axiom,
( ssSkC16
<=> $false ) ).
%------ Positive definition of c10_2
fof(lit_def_065,axiom,
! [X0,X1] :
( c10_2(X0,X1)
<=> ( ( X1 = a482
& X0 = a481 )
| ( X1 = a483
& X0 = a481 )
| ( X1 = a546
& X0 = a488 )
| ( X1 = a524
& X0 = a523 )
| ( X1 = a544
& X0 = a585 ) ) ) ).
%------ Positive definition of ssSkC19
fof(lit_def_066,axiom,
( ssSkC19
<=> $false ) ).
%------ Positive definition of ssSkC27
fof(lit_def_067,axiom,
( ssSkC27
<=> $false ) ).
%------ Positive definition of ssSkC23
fof(lit_def_068,axiom,
( ssSkC23
<=> $false ) ).
%------ Positive definition of ssSkC28
fof(lit_def_069,axiom,
( ssSkC28
<=> $false ) ).
%------ Positive definition of ssSkC22
fof(lit_def_070,axiom,
( ssSkC22
<=> $false ) ).
%------ Positive definition of ssSkC15
fof(lit_def_071,axiom,
( ssSkC15
<=> $false ) ).
%------ Positive definition of ssSkC9
fof(lit_def_072,axiom,
( ssSkC9
<=> $false ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN421-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.11/10.39 % Computer : n014.cluster.edu
% 0.11/10.39 % Model : x86_64 x86_64
% 0.11/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.39 % Memory : 8046.5625MB
% 0.11/10.39 % OS : Linux 6.8.0-71-generic
% 0.11/10.39 % CPULimit : 300
% 0.11/10.39 % WCLimit : 300
% 0.11/10.39 % DateTime : Fri Sep 25 01:07:13 UTC 2026
% 0.11/10.39 % CPUTime :
% 0.11/10.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/10.43 Running EPR theorem proving
% 0.15/10.43 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.15/10.44
% 0.15/10.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/10.44
% 0.15/10.44 % Detected problem language: tptp
% 0.15/10.46 % Proving...
% 2.79/11.15 % SZS status Started for theBenchmark.p
% 2.79/11.15 % SZS status Satisfiable for theBenchmark.p
% 2.79/11.15
% 2.79/11.15 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.79/11.15
% 2.79/11.15 % ------ iProver source info
% 2.79/11.15
% 2.79/11.15 % git: date: 2026-07-19 20:42:38 +0200
% 2.79/11.15 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.79/11.15 % git: non_committed_changes: false
% 2.79/11.15
% 2.79/11.15 % ------ Parsing...% successful
% 2.79/11.15
% 2.79/11.15
% 2.79/11.15 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.79/11.15 % ------ Proving...
% 2.79/11.15 % ------ Problem Properties
% 2.79/11.15
% 2.79/11.15 %
% 2.79/11.15 % clauses 547
% 2.79/11.15 % conjectures 547
% 2.79/11.15 % EPR 547
% 2.79/11.15 % Horn 203
% 2.79/11.15 % unary 0
% 2.79/11.15 % binary 132
% 2.79/11.15 % lits 2330
% 2.79/11.15 % lits eq 0
% 2.79/11.15 % fd_pure 0
% 2.79/11.15 % fd_pseudo 0
% 2.79/11.15 % fd_cond 0
% 2.79/11.15 % fd_pseudo_cond 0
% 2.79/11.15 % AC symbols 0
% 2.79/11.15
% 2.79/11.15 % ------ Input Options Time Limit: Unbounded
% 2.79/11.15
% 2.79/11.15
% 2.79/11.15 % ------
% 2.79/11.15 % Current options:
% 2.79/11.15 % ------
% 2.79/11.15
% 2.79/11.15
% 2.79/11.15 %
% 2.79/11.15
% 2.79/11.15 % ------ Proving...
% 2.79/11.15 %
% 2.79/11.15
% 2.79/11.15 % SZS status Satisfiable for theBenchmark.p
% 2.79/11.15
% 2.79/11.15 ------ Building Model...Done
% 2.79/11.15
% 2.79/11.15 %------ The model is defined over ground terms (initial term algebra).
% 2.79/11.15 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.79/11.15 %------ where \phi is a formula over the term algebra.
% 2.79/11.15 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.79/11.15 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.79/11.15 %------ See help for --sat_out_model for different model outputs.
% 2.79/11.15 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.79/11.15 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.79/11.15 % SZS output start Model for theBenchmark.p
% See solution above
% 2.79/11.15
%------------------------------------------------------------------------------