TSTP Solution File: GRP398-2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP398-2 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:59:43 EDT 2023
% Result : Satisfiable 0.46s 1.15s
% Output : Saturation 0.46s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( ~ product(X0,inverse(X1),X2)
| ~ subgroup_member(X0)
| ~ subgroup_member(X1)
| subgroup_member(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-2.ax',closure_of_product_and_inverse) ).
cnf(c_50,plain,
product(identity,X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',left_identity) ).
cnf(c_51,plain,
product(X0,identity,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',right_identity) ).
cnf(c_52,plain,
product(inverse(X0),X0,identity),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',left_inverse) ).
cnf(c_53,plain,
product(X0,inverse(X0),identity),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',right_inverse) ).
cnf(c_57,plain,
( ~ product(X0,X1,X2)
| ~ product(X0,X3,X4)
| ~ product(X1,X5,X3)
| product(X2,X5,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',associativity2) ).
cnf(c_63,plain,
( multiply(X0,inverse(X1)) != X2
| ~ subgroup_member(X0)
| ~ subgroup_member(X1)
| subgroup_member(X2) ),
inference(well_definedness,[status(thm)],[c_49]) ).
cnf(c_65,plain,
multiply(identity,X0) = X0,
inference(well_definedness,[status(thm)],[c_50]) ).
cnf(c_66,plain,
multiply(X0,identity) = X0,
inference(well_definedness,[status(thm)],[c_51]) ).
cnf(c_67,plain,
multiply(inverse(X0),X0) = identity,
inference(well_definedness,[status(thm)],[c_52]) ).
cnf(c_68,plain,
multiply(X0,inverse(X0)) = identity,
inference(well_definedness,[status(thm)],[c_53]) ).
cnf(c_74,plain,
( multiply(X0,X1) != X2
| multiply(X0,X3) != X4
| multiply(X1,X5) != X3
| multiply(X2,X5) = X4 ),
inference(well_definedness,[status(thm)],[c_57]) ).
cnf(c_121,plain,
( ~ subgroup_member(X0)
| ~ subgroup_member(X1)
| subgroup_member(multiply(X0,inverse(X1))) ),
inference(unflattening,[status(thm)],[c_63]) ).
cnf(c_126,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(unflattening,[status(thm)],[c_74]) ).
cnf(c_128,plain,
X0 = X0,
theory(equality) ).
cnf(c_129,plain,
X0_1 = X0_1,
theory(equality) ).
cnf(c_130,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_131,plain,
( X0 != X1
| ~ subgroup_member(X1)
| subgroup_member(X0) ),
theory(equality) ).
cnf(c_132,plain,
( X0 != X1
| X2 != X3
| multiply(X0,X2) = multiply(X1,X3) ),
theory(equality) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP398-2 : TPTP v8.1.2. Released v2.5.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 22:07:10 EDT 2023
% 0.13/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.42/0.61 WARNING - Could not infer the problem pformat. Setting FOF as default
% 0.46/1.15 % SZS status Started for theBenchmark.p
% 0.46/1.15 % SZS status Satisfiable for theBenchmark.p
% 0.46/1.15
% 0.46/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.46/1.15
% 0.46/1.15 ------ iProver source info
% 0.46/1.15
% 0.46/1.15 git: date: 2023-05-31 18:12:56 +0000
% 0.46/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.46/1.15 git: non_committed_changes: false
% 0.46/1.15 git: last_make_outside_of_git: false
% 0.46/1.15
% 0.46/1.15 ------ Parsing...successful
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing... sup_sim: 5 sf_s rm: 11 0s sf_e pe_s pe_e sf_s rm: 5 0s sf_e pe_s pe_e
% 0.46/1.15
% 0.46/1.15 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 0.46/1.15 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.46/1.15 ------ Proving...
% 0.46/1.15 ------ Problem Properties
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 clauses 0
% 0.46/1.15 conjectures 0
% 0.46/1.15 EPR 0
% 0.46/1.15 Horn 0
% 0.46/1.15 unary 0
% 0.46/1.15 binary 0
% 0.46/1.15 lits 0
% 0.46/1.15 lits eq 0
% 0.46/1.15 fd_pure 0
% 0.46/1.15 fd_pseudo 0
% 0.46/1.15 fd_cond 0
% 0.46/1.15 fd_pseudo_cond 0
% 0.46/1.15 AC symbols 0
% 0.46/1.15
% 0.46/1.15 ------ Schedule EPR Horn non eq is on
% 0.46/1.15
% 0.46/1.15 ------ no conjectures: strip conj schedule
% 0.46/1.15
% 0.46/1.15 ------ no equalities: superposition off
% 0.46/1.15
% 0.46/1.15 ------ Option_epr_horn stripped conjectures Time Limit: Unbounded
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 % SZS status Satisfiable for theBenchmark.p
% 0.46/1.15
% 0.46/1.15 % SZS output start Saturation for theBenchmark.p
% See solution above
% 0.46/1.15
% 0.46/1.15
%------------------------------------------------------------------------------