TSTP Solution File: GRP128-3.004 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP128-3.004 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 00:58:03 EDT 2023
% Result : Satisfiable 0.48s 1.16s
% Output : Model 0.48s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of next
fof(lit_def,axiom,
! [X0,X1] :
( next(X0,X1)
<=> ( ( X0 = e_0
& X1 = e_1 )
| ( X0 = e_1
& X1 = e_2 )
| ( X0 = e_2
& X1 = e_3 )
| ( X0 = e_3
& X1 = e_4 ) ) ) ).
%------ Positive definition of greater
fof(lit_def_001,axiom,
! [X0,X1] :
( greater(X0,X1)
<=> ( ( X0 = e_1
& X1 = e_0 )
| ( X0 = e_2
& X1 = e_0 )
| ( X0 = e_2
& X1 = e_1 )
| ( X0 = e_3
& X1 = e_0 )
| ( X0 = e_3
& X1 = e_1 )
| ( X0 = e_3
& X1 = e_2 )
| ( X0 = e_4
& X1 = e_0 )
| ( X0 = e_4
& X1 = e_1 )
| ( X0 = e_4
& X1 = e_2 )
| ( X0 = e_4
& X1 = e_3 ) ) ) ).
%------ Positive definition of cycle
fof(lit_def_002,axiom,
! [X0,X1] :
( cycle(X0,X1)
<=> ( ( X0 = e_1
& X1 = e_0 )
| ( X0 = e_2
& X1 = e_2 )
| ( X0 = e_3
& X1 = e_1 )
| ( X0 = e_4
& X1 = e_0 )
| ( X1 = e_0
& X0 != e_0
& X0 != e_1
& X0 != e_2
& X0 != e_3
& X0 != e_4 ) ) ) ).
%------ Negative definition of equalish
fof(lit_def_003,axiom,
! [X0,X1] :
( ~ equalish(X0,X1)
<=> ( ( X0 = e_1
& X1 = e_2 )
| ( X0 = e_1
& X1 = e_3 )
| ( X0 = e_1
& X1 = e_4 )
| ( X0 = e_2
& X1 = e_1 )
| ( X0 = e_2
& X1 = e_3 )
| ( X0 = e_2
& X1 = e_4 )
| ( X0 = e_3
& X1 = e_1 )
| ( X0 = e_3
& X1 = e_2 )
| ( X0 = e_3
& X1 = e_4 )
| ( X0 = e_4
& X1 = e_1 )
| ( X0 = e_4
& X1 = e_2 )
| ( X0 = e_4
& X1 = e_3 ) ) ) ).
%------ Negative definition of group_element
fof(lit_def_004,axiom,
! [X0] :
( ~ group_element(X0)
<=> X0 = e_0 ) ).
%------ Positive definition of product
fof(lit_def_005,axiom,
! [X0,X1,X2] :
( product(X0,X1,X2)
<=> ( ( X0 != e_0
& ( X0 != e_0
| X1 != e_1
| X2 != e_2 )
& ( X0 != e_0
| X1 != e_1
| X2 != e_3 )
& ( X0 != e_0
| X1 != e_1
| X2 != e_4 )
& ( X0 != e_0
| X2 != e_1 )
& ( X0 != e_1
| X1 != e_1
| X2 != e_2 )
& ( X0 != e_1
| X1 != e_1
| X2 != e_3 )
& ( X0 != e_1
| X1 != e_1
| X2 != e_4 )
& ( X0 != e_1
| X1 != e_2 )
& ( X0 != e_1
| X1 != e_2
| X2 != e_3 )
& X0 != e_2
& ( X0 != e_2
| X1 != e_1
| X2 != e_2 )
& ( X0 != e_2
| X1 != e_1
| X2 != e_3 )
& ( X0 != e_2
| X1 != e_1
| X2 != e_4 )
& ( X0 != e_2
| X1 != e_2 )
& ( X0 != e_2
| X1 != e_2
| X2 != e_1 )
& ( X0 != e_2
| X1 != e_2
| X2 != e_3 )
& ( X0 != e_2
| X1 != e_2
| X2 != e_4 )
& ( X0 != e_2
| X1 != e_3 )
& ( X0 != e_2
| X1 != e_3
| X2 != e_2 )
& ( X0 != e_2
| X1 != e_3
| X2 != e_3 )
& ( X0 != e_2
| X1 != e_3
| X2 != e_4 )
& ( X0 != e_2
| X1 != e_4 )
& ( X0 != e_2
| X1 != e_4
| X2 != e_2 )
& ( X0 != e_2
| X2 != e_2 )
& X0 != e_3
& ( X0 != e_3
| X1 != e_1
| X2 != e_4 )
& ( X0 != e_3
| X1 != e_2 )
& ( X0 != e_3
| X1 != e_2
| X2 != e_3 )
& ( X0 != e_3
| X1 != e_2
| X2 != e_4 )
& ( X0 != e_3
| X1 != e_3 )
& ( X0 != e_3
| X1 != e_3
| X2 != e_2 )
& ( X0 != e_3
| X1 != e_3
| X2 != e_4 )
& ( X0 != e_3
| X1 != e_4 )
& ( X0 != e_3
| X1 != e_4
| X2 != e_2 )
& ( X0 != e_3
| X1 != e_4
| X2 != e_3 )
& X0 != e_4
& ( X0 != e_4
| X1 != e_2 )
& ( X0 != e_4
| X1 != e_2
| X2 != e_1 )
& ( X0 != e_4
| X1 != e_2
| X2 != e_2 )
& ( X0 != e_4
| X1 != e_2
| X2 != e_4 )
& ( X0 != e_4
| X1 != e_3 )
& ( X0 != e_4
| X1 != e_3
| X2 != e_2 )
& ( X0 != e_4
| X1 != e_3
| X2 != e_3 )
& ( X0 != e_4
| X1 != e_3
| X2 != e_4 )
& ( X0 != e_4
| X1 != e_4
| X2 != e_1 )
& ( X0 != e_4
| X1 != e_4
| X2 != e_2 )
& ( X0 != e_4
| X1 != e_4
| X2 != e_3 )
& ( X0 != e_4
| X2 != e_4 )
& X1 != e_2
& ( X1 != e_2
| X2 != e_1 )
& ( X1 != e_2
| X2 != e_2 )
& ( X1 != e_2
| X2 != e_3 )
& ( X1 != e_2
| X2 != e_4 )
& X1 != e_3
& ( X1 != e_3
| X2 != e_3 )
& ( X1 != e_3
| X2 != e_4 )
& X1 != e_4
& ( X1 != e_4
| X2 != e_2 )
& ( X1 != e_4
| X2 != e_4 )
& X2 != e_2
& X2 != e_3
& X2 != e_4 )
| ( X0 = e_1
& X1 = e_1
& X2 = e_1 )
| ( X0 = e_1
& X1 = e_2
& X2 = e_4 )
| ( X0 = e_1
& X1 = e_3
& X2 = e_2 )
| ( X0 = e_1
& X1 = e_4
& X2 = e_3 )
| ( X0 = e_1
& X2 = e_1
& X1 != e_1
& X1 != e_2
& X1 != e_3
& X1 != e_4 )
| ( X0 = e_2
& X1 = e_1
& X2 = e_3 )
| ( X0 = e_2
& X1 = e_2
& X2 = e_2 )
| ( X0 = e_2
& X1 = e_3
& X2 = e_4 )
| ( X0 = e_2
& X1 = e_4
& X2 != e_1
& X2 != e_2
& X2 != e_3
& X2 != e_4 )
| ( X0 = e_2
& X1 = e_4
& X2 = e_1 )
| ( X0 = e_2
& X2 = e_3
& X1 != e_1
& X1 != e_2
& X1 != e_3
& X1 != e_4 )
| ( X0 = e_3
& X1 = e_1
& X2 = e_4 )
| ( X0 = e_3
& X1 = e_2
& X2 != e_1
& X2 != e_2
& X2 != e_3
& X2 != e_4 )
| ( X0 = e_3
& X1 = e_2
& X2 = e_1 )
| ( X0 = e_3
& X1 = e_3
& X2 = e_3 )
| ( X0 = e_3
& X1 = e_4
& X2 = e_2 )
| ( X0 = e_3
& X2 = e_4
& X1 != e_1
& X1 != e_2
& X1 != e_3
& X1 != e_4 )
| ( X0 = e_4
& X1 = e_1
& X2 = e_2 )
| ( X0 = e_4
& X1 = e_2
& X2 = e_3 )
| ( X0 = e_4
& X1 = e_3
& X2 != e_1
& X2 != e_2
& X2 != e_3
& X2 != e_4 )
| ( X0 = e_4
& X1 = e_3
& X2 = e_1 )
| ( X0 = e_4
& X1 = e_4
& X2 = e_4 )
| ( X0 = e_4
& X2 = e_2
& X1 != e_1
& X1 != e_2
& X1 != e_3
& X1 != e_4 )
| ( X1 = e_1
& X2 = e_1
& X0 != e_0
& X0 != e_1
& X0 != e_2
& X0 != e_3
& X0 != e_4 )
| ( X1 = e_2
& X2 = e_4
& X0 != e_0
& X0 != e_1
& X0 != e_2
& X0 != e_3
& X0 != e_4 )
| ( X1 = e_3
& X2 = e_2
& X0 != e_0
& X0 != e_1
& X0 != e_2
& X0 != e_3
& X0 != e_4 )
| ( X1 = e_4
& X2 = e_3
& X0 != e_0
& X0 != e_1
& X0 != e_2
& X0 != e_3
& X0 != e_4 )
| ( X2 = e_1
& X0 != e_0
& ( X0 != e_0
| X1 != e_1 )
& ( X0 != e_0
| X1 != e_2 )
& ( X0 != e_0
| X1 != e_4 )
& X0 != e_1
& ( X0 != e_1
| X1 != e_2 )
& ( X0 != e_1
| X1 != e_3 )
& ( X0 != e_1
| X1 != e_4 )
& X0 != e_2
& ( X0 != e_2
| X1 != e_1 )
& ( X0 != e_2
| X1 != e_2 )
& ( X0 != e_2
| X1 != e_3 )
& ( X0 != e_2
| X1 != e_4 )
& X0 != e_3
& ( X0 != e_3
| X1 != e_1 )
& ( X0 != e_3
| X1 != e_2 )
& ( X0 != e_3
| X1 != e_3 )
& ( X0 != e_3
| X1 != e_4 )
& X0 != e_4
& ( X0 != e_4
| X1 != e_1 )
& ( X0 != e_4
| X1 != e_2 )
& ( X0 != e_4
| X1 != e_3 )
& ( X0 != e_4
| X1 != e_4 )
& X1 != e_1
& X1 != e_2
& X1 != e_3
& X1 != e_4 ) ) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP128-3.004 : TPTP v8.1.2. Released v1.2.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 29 00:55:55 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.48/1.16 % SZS status Started for theBenchmark.p
% 0.48/1.16 % SZS status Satisfiable for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.48/1.16
% 0.48/1.16 ------ iProver source info
% 0.48/1.16
% 0.48/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.48/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.48/1.16 git: non_committed_changes: false
% 0.48/1.16 git: last_make_outside_of_git: false
% 0.48/1.16
% 0.48/1.16 ------ Parsing...successful
% 0.48/1.16
% 0.48/1.16 ------ preprocesses with Option_epr_non_horn_non_eq
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing...------ preprocesses with Option_epr_non_horn_non_eq
% 0.48/1.16 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.16 ------ Proving...
% 0.48/1.16 ------ Problem Properties
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 clauses 42
% 0.48/1.16 conjectures 1
% 0.48/1.16 EPR 42
% 0.48/1.16 Horn 40
% 0.48/1.16 unary 31
% 0.48/1.16 binary 0
% 0.48/1.16 lits 77
% 0.48/1.16 lits eq 0
% 0.48/1.16 fd_pure 0
% 0.48/1.16 fd_pseudo 0
% 0.48/1.16 fd_cond 0
% 0.48/1.16 fd_pseudo_cond 0
% 0.48/1.16 AC symbols 0
% 0.48/1.16
% 0.48/1.16 ------ Schedule EPR non Horn non eq is on
% 0.48/1.16
% 0.48/1.16 ------ no equalities: superposition off
% 0.48/1.16
% 0.48/1.16 ------ Input Options "--resolution_flag false" Time Limit: 70.
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------
% 0.48/1.16 Current options:
% 0.48/1.16 ------
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------ Proving...
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 % SZS status Satisfiable for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 ------ Building Model...Done
% 0.48/1.16
% 0.48/1.16 %------ The model is defined over ground terms (initial term algebra).
% 0.48/1.16 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 0.48/1.16 %------ where \phi is a formula over the term algebra.
% 0.48/1.16 %------ If we have equality in the problem then it is also defined as a predicate above,
% 0.48/1.16 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 0.48/1.16 %------ See help for --sat_out_model for different model outputs.
% 0.48/1.16 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 0.48/1.16 %------ where the first argument stands for the sort ($i in the unsorted case)
% 0.48/1.16 % SZS output start Model for theBenchmark.p
% See solution above
% 0.48/1.16
%------------------------------------------------------------------------------