%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP127-3.005 : TPTP v9.3.1. Released v1.2.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 01:31:24 PM UTC 2026
% Result : Satisfiable 3.91s 1.36s
% Output : Model 3.91s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of next
fof(lit_def,axiom,
! [X0,X1] :
( next(X0,X1)
<=> ( ( X1 = e_5
& X0 = e_4 )
| ( X1 = e_4
& X0 = e_3 )
| ( X1 = e_3
& X0 = e_2 )
| ( X1 = e_2
& X0 = e_1 )
| ( X1 = e_1
& X0 = e_0 ) ) ) ).
%------ Positive definition of greater
fof(lit_def_001,axiom,
! [X0,X1] :
( greater(X0,X1)
<=> ( ( X1 = e_4
& X0 = e_5 )
| ( X1 = e_3
& X0 = e_5 )
| ( X1 = e_2
& X0 = e_5 )
| ( X1 = e_1
& X0 = e_5 )
| ( X1 = e_0
& X0 = e_5 )
| ( X1 = e_3
& X0 = e_4 )
| ( X1 = e_2
& X0 = e_4 )
| ( X1 = e_1
& X0 = e_4 )
| ( X1 = e_0
& X0 = e_4 )
| ( X1 = e_2
& X0 = e_3 )
| ( X1 = e_1
& X0 = e_3 )
| ( X1 = e_0
& X0 = e_3 )
| ( X1 = e_1
& X0 = e_2 )
| ( X1 = e_0
& X0 = e_2 )
| ( X1 = e_0
& X0 = e_1 ) ) ) ).
%------ Positive definition of cycle
fof(lit_def_002,axiom,
! [X0,X1] :
( cycle(X0,X1)
<=> ( ( X0 != e_5
& X0 != e_4
& X0 != e_3
& X0 != e_2
& X0 != e_0
& X1 = e_0 )
| ( X1 = e_0
& X0 = e_5 )
| ( X1 = e_1
& X0 = e_4 )
| ( X1 = e_2
& X0 = e_3 )
| ( X1 = e_3
& X0 = e_2 ) ) ) ).
%------ Positive definition of equalish
fof(lit_def_003,axiom,
! [X0,X1] :
( equalish(X0,X1)
<=> ( ( X0 != e_5
& X0 != e_4
& X0 != e_3
& X0 != e_2
& X1 = e_1 )
| ( X1 = e_4
& X0 = e_4 )
| ( X1 = e_3
& X0 = e_3 )
| ( X1 = e_0
& X0 = e_3 )
| ( X1 = e_2
& X0 = e_2 )
| ( X1 = e_0
& X0 = e_2 )
| ( X1 = e_4
& X0 = e_0 )
| ( X1 = e_0
& X0 = e_0 )
| ( ( X1 != e_4
| X0 != e_5 )
& ( X1 != e_3
| X0 != e_5 )
& ( X1 != e_2
| X0 != e_5 )
& ( X1 != e_1
| X0 != e_5 )
& ( X1 != e_5
| X0 != e_4 )
& ( X1 != e_3
| X0 != e_4 )
& ( X1 != e_2
| X0 != e_4 )
& ( X1 != e_1
| X0 != e_4 )
& ( X1 != e_5
| X0 != e_3 )
& ( X1 != e_4
| X0 != e_3 )
& ( X1 != e_2
| X0 != e_3 )
& ( X1 != e_1
| X0 != e_3 )
& ( X1 != e_5
| X0 != e_2 )
& ( X1 != e_4
| X0 != e_2 )
& ( X1 != e_3
| X0 != e_2 )
& ( X1 != e_1
| X0 != e_2 )
& ( X1 != e_5
| X0 != e_1 )
& ( X1 != e_4
| X0 != e_1 )
& ( X1 != e_3
| X0 != e_1 )
& ( X1 != e_2
| X0 != e_1 ) ) ) ) ).
%------ Positive definition of group_element
fof(lit_def_004,axiom,
! [X0] :
( group_element(X0)
<=> ( X0 = e_5
| X0 = e_4
| X0 = e_3
| X0 = e_2
| X0 = e_1 ) ) ).
%------ Positive definition of product
fof(lit_def_005,axiom,
! [X0,X1,X2] :
( product(X0,X1,X2)
<=> ( ( X1 != e_5
& X1 != e_4
& X1 != e_3
& X1 != e_2
& ( X1 != e_5
| X0 != e_5 )
& ( X1 != e_4
| X0 != e_5 )
& ( X1 != e_3
| X0 != e_5 )
& ( X1 != e_2
| X0 != e_5 )
& ( X1 != e_1
| X0 != e_5 )
& X0 != e_5
& ( X1 != e_4
| X0 != e_4 )
& ( X1 != e_3
| X0 != e_4 )
& ( X1 != e_2
| X0 != e_4 )
& ( X1 != e_1
| X0 != e_4 )
& X0 != e_4
& ( X1 != e_5
| X0 != e_3 )
& ( X1 != e_4
| X0 != e_3 )
& ( X1 != e_3
| X0 != e_3 )
& ( X1 != e_2
| X0 != e_3 )
& ( X1 != e_1
| X0 != e_3 )
& X0 != e_3
& ( X1 != e_5
| X0 != e_2 )
& ( X1 != e_4
| X0 != e_2 )
& ( X1 != e_2
| X0 != e_2 )
& ( X1 != e_1
| X0 != e_2 )
& X0 != e_2
& ( X1 != e_5
| X0 != e_1 )
& ( X1 != e_4
| X0 != e_1 )
& ( X1 != e_3
| X0 != e_1 )
& ( X1 != e_2
| X0 != e_1 )
& X2 = e_1 )
| ( X0 != e_5
& X0 != e_4
& X0 != e_3
& X0 != e_2
& X2 = X0
& X1 = X0 )
| ( X0 != e_5
& X0 != e_4
& X0 != e_3
& X0 != e_2
& X0 != e_1
& X2 = e_3
& X1 = e_5 )
| ( X0 != e_5
& X0 != e_4
& X0 != e_3
& X0 != e_2
& X0 != e_1
& X2 = e_2
& X1 = e_4 )
| ( X0 != e_5
& X0 != e_4
& X0 != e_3
& X0 != e_2
& X0 != e_1
& X2 = e_5
& X1 = e_3 )
| ( X0 != e_5
& X0 != e_4
& X0 != e_3
& X0 != e_2
& X0 != e_1
& X2 = e_4
& X1 = e_2 )
| ( X1 != e_5
& X1 != e_4
& X1 != e_3
& X1 != e_2
& X1 != e_1
& X2 = e_2
& X0 = e_5 )
| ( X2 = e_5
& X1 = e_5
& X0 = e_5 )
| ( X2 = e_3
& X1 = e_4
& X0 = e_5 )
| ( X2 = e_4
& X1 = e_3
& X0 = e_5 )
| ( X2 = e_1
& X1 = e_2
& X0 = e_5 )
| ( X2 != e_5
& X2 != e_4
& X2 != e_3
& X2 != e_2
& X1 = e_2
& X0 = e_5 )
| ( X2 = e_2
& X1 = e_1
& X0 = e_5 )
| ( X1 != e_5
& X1 != e_4
& X1 != e_3
& X1 != e_2
& X1 != e_1
& X2 = e_5
& X0 = e_4 )
| ( X2 = e_1
& X1 = e_5
& X0 = e_4 )
| ( X2 != e_5
& X2 != e_4
& X2 != e_3
& X2 != e_2
& X1 = e_5
& X0 = e_4 )
| ( X2 = e_4
& X1 = e_4
& X0 = e_4 )
| ( X2 = e_2
& X1 = e_3
& X0 = e_4 )
| ( X2 = e_3
& X1 = e_2
& X0 = e_4 )
| ( X2 = e_5
& X1 = e_1
& X0 = e_4 )
| ( X1 != e_5
& X1 != e_4
& X1 != e_3
& X1 != e_2
& X1 != e_1
& X2 = e_4
& X0 = e_3 )
| ( X2 = e_2
& X1 = e_5
& X0 = e_3 )
| ( X2 = e_1
& X1 = e_4
& X0 = e_3 )
| ( X2 != e_5
& X2 != e_4
& X2 != e_3
& X2 != e_2
& X1 = e_4
& X0 = e_3 )
| ( X2 = e_3
& X1 = e_3
& X0 = e_3 )
| ( X2 = e_5
& X1 = e_2
& X0 = e_3 )
| ( X2 = e_4
& X1 = e_1
& X0 = e_3 )
| ( X1 != e_5
& X1 != e_4
& X1 != e_3
& X1 != e_2
& X1 != e_1
& X2 = e_3
& X0 = e_2 )
| ( X2 = e_4
& X1 = e_5
& X0 = e_2 )
| ( X2 = e_5
& X1 = e_4
& X0 = e_2 )
| ( X2 = e_1
& X1 = e_3
& X0 = e_2 )
| ( X2 != e_5
& X2 != e_4
& X2 != e_3
& X2 != e_2
& X1 = e_3
& X0 = e_2 )
| ( X2 = e_2
& X1 = e_2
& X0 = e_2 )
| ( X2 = e_3
& X1 = e_1
& X0 = e_2 )
| ( X2 = e_3
& X1 = e_5
& X0 = e_1 )
| ( X2 = e_2
& X1 = e_4
& X0 = e_1 )
| ( X2 = e_5
& X1 = e_3
& X0 = e_1 )
| ( X2 = e_4
& X1 = e_2
& X0 = e_1 )
| ( X2 != e_5
& X2 != e_4
& X2 != e_3
& X2 != e_2
& ( X2 != e_2
| X1 != e_5 )
& X1 != e_5
& ( X2 != e_5
| X1 != e_4 )
& X1 != e_4
& X1 != e_3
& ( X2 != e_3
| X1 != e_2 )
& X1 != e_2
& ( X2 != e_4
| X1 != e_1 )
& ( X1 != e_3
| X0 != e_5 )
& X0 != e_5
& ( X1 != e_3
| X0 != e_4 )
& ( X1 != e_2
| X0 != e_4 )
& X0 != e_4
& ( X1 != e_5
| X0 != e_3 )
& ( X2 != e_3
| X1 != e_2
| X0 != e_3 )
& ( X1 != e_2
| X0 != e_3 )
& X0 != e_3
& ( X2 != e_2
| X1 != e_5
| X0 != e_2 )
& ( X1 != e_5
| X0 != e_2 )
& ( X1 != e_4
| X0 != e_2 )
& X0 != e_2
& ( X2 != e_5
| X1 != e_1
| X0 != e_1 )
& ( X2 != e_4
| X1 != e_1
| X0 != e_1 )
& ( X2 != e_3
| X1 != e_1
| X0 != e_1 )
& ( X2 != e_2
| X1 != e_1
| X0 != e_1 ) ) ) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP127-3.005 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.58 % Computer : n019.cluster.edu
% 0.10/0.58 % Model : x86_64 x86_64
% 0.10/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.58 % Memory : 8046.5625MB
% 0.10/0.58 % OS : Linux 6.8.0-71-generic
% 0.10/0.58 % CPULimit : 300
% 0.10/0.58 % WCLimit : 300
% 0.10/0.58 % DateTime : Wed Sep 23 13:43:20 UTC 2026
% 0.10/0.58 % CPUTime :
% 0.10/0.58 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.61 Running EPR theorem proving
% 0.10/0.61 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.62
% 0.10/0.62 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.62
% 0.10/0.63 % Detected problem language: tptp
% 0.15/0.64 % Proving...
% 3.91/1.36 % SZS status Started for theBenchmark.p
% 3.91/1.36 % SZS status Satisfiable for theBenchmark.p
% 3.91/1.36
% 3.91/1.36 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.91/1.36
% 3.91/1.36 % ------ iProver source info
% 3.91/1.36
% 3.91/1.36 % git: date: 2026-07-19 20:42:38 +0200
% 3.91/1.36 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.91/1.36 % git: non_committed_changes: false
% 3.91/1.36
% 3.91/1.36 % ------ Parsing...% successful
% 3.91/1.36
% 3.91/1.36
% 3.91/1.36 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.91/1.36 % ------ Proving...
% 3.91/1.36 % ------ Problem Properties
% 3.91/1.36
% 3.91/1.36 %
% 3.91/1.36 % clauses 58
% 3.91/1.36 % conjectures 1
% 3.91/1.36 % EPR 58
% 3.91/1.36 % Horn 56
% 3.91/1.36 % unary 47
% 3.91/1.36 % binary 0
% 3.91/1.36 % lits 95
% 3.91/1.36 % lits eq 0
% 3.91/1.36 % fd_pure 0
% 3.91/1.36 % fd_pseudo 0
% 3.91/1.36 % fd_cond 0
% 3.91/1.36 % fd_pseudo_cond 0
% 3.91/1.36 % AC symbols 0
% 3.91/1.36
% 3.91/1.36 % ------ Input Options Time Limit: Unbounded
% 3.91/1.36
% 3.91/1.36
% 3.91/1.36 % ------
% 3.91/1.36 % Current options:
% 3.91/1.36 % ------
% 3.91/1.36
% 3.91/1.36
% 3.91/1.36 %
% 3.91/1.36
% 3.91/1.36 % ------ Proving...
% 3.91/1.36 %
% 3.91/1.36
% 3.91/1.36 % SZS status Satisfiable for theBenchmark.p
% 3.91/1.36
% 3.91/1.36 ------ Building Model...Done
% 3.91/1.36
% 3.91/1.36 %------ The model is defined over ground terms (initial term algebra).
% 3.91/1.36 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.91/1.36 %------ where \phi is a formula over the term algebra.
% 3.91/1.36 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.91/1.36 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.91/1.36 %------ See help for --sat_out_model for different model outputs.
% 3.91/1.36 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.91/1.36 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.91/1.36 % SZS output start Model for theBenchmark.p
% See solution above
% 3.91/1.36
%------------------------------------------------------------------------------