TSTP Solution File: GRP013-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP013-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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:56:36 EDT 2023
% Result : Unsatisfiable 2.47s 1.14s
% Output : CNFRefutation 2.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 19 unt; 0 nHn; 12 RR)
% Number of literals : 23 ( 14 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
product(X0,X0,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',squareness) ).
cnf(c_50,plain,
product(a,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_b_is_c) ).
cnf(c_51,plain,
product(inverse(a),inverse(b),d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse_a_times_inverse_b_is_d) ).
cnf(c_52,plain,
( ~ product(inverse(X0),inverse(X1),X2)
| product(X0,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverses_have_property) ).
cnf(c_53,negated_conjecture,
~ product(c,d,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c_times_d_is_identity) ).
cnf(c_55,plain,
product(X0,identity,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',right_identity) ).
cnf(c_57,plain,
product(X0,inverse(X0),identity),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',right_inverse) ).
cnf(c_67,plain,
multiply(X0,X0) = identity,
inference(well_definedness,[status(thm)],[c_49]) ).
cnf(c_68,plain,
multiply(a,b) = c,
inference(well_definedness,[status(thm)],[c_50]) ).
cnf(c_69,plain,
multiply(inverse(a),inverse(b)) = d,
inference(well_definedness,[status(thm)],[c_51]) ).
cnf(c_70,plain,
( multiply(inverse(X0),inverse(X1)) != X2
| multiply(X0,X2) = X1 ),
inference(well_definedness,[status(thm)],[c_52]) ).
cnf(c_72,plain,
multiply(c,d) != identity,
inference(well_definedness,[status(thm)],[c_53]) ).
cnf(c_74,plain,
multiply(X0,identity) = X0,
inference(well_definedness,[status(thm)],[c_55]) ).
cnf(c_76,plain,
multiply(X0,inverse(X0)) = identity,
inference(well_definedness,[status(thm)],[c_57]) ).
cnf(c_134,plain,
multiply(X0,multiply(inverse(X0),inverse(X1))) = X1,
inference(unflattening,[status(thm)],[c_70]) ).
cnf(c_222,plain,
multiply(X0,identity) = inverse(X0),
inference(superposition,[status(thm)],[c_76,c_134]) ).
cnf(c_226,plain,
inverse(X0) = X0,
inference(light_normalisation,[status(thm)],[c_222,c_74]) ).
cnf(c_232,plain,
multiply(a,inverse(b)) = d,
inference(demodulation,[status(thm)],[c_69,c_226]) ).
cnf(c_246,plain,
c = d,
inference(demodulation,[status(thm)],[c_232,c_68,c_226]) ).
cnf(c_248,plain,
multiply(c,c) != identity,
inference(demodulation,[status(thm)],[c_72,c_246]) ).
cnf(c_249,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_248,c_67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP013-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n025.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 : Mon Aug 28 21:16:40 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
% 2.47/1.14 % SZS status Started for theBenchmark.p
% 2.47/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 2.47/1.14
% 2.47/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.47/1.14
% 2.47/1.14 ------ iProver source info
% 2.47/1.14
% 2.47/1.14 git: date: 2023-05-31 18:12:56 +0000
% 2.47/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.47/1.14 git: non_committed_changes: false
% 2.47/1.14 git: last_make_outside_of_git: false
% 2.47/1.14
% 2.47/1.14 ------ Parsing...successful
% 2.47/1.14
% 2.47/1.14
% 2.47/1.14
% 2.47/1.14 ------ Preprocessing... sup_sim: 5 sf_s rm: 0 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 2.47/1.14
% 2.47/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.47/1.14
% 2.47/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.47/1.14 ------ Proving...
% 2.47/1.14 ------ Problem Properties
% 2.47/1.14
% 2.47/1.14
% 2.47/1.14 clauses 10
% 2.47/1.14 conjectures 0
% 2.47/1.14 EPR 0
% 2.47/1.14 Horn 10
% 2.47/1.14 unary 10
% 2.47/1.14 binary 0
% 2.47/1.14 lits 10
% 2.47/1.14 lits eq 10
% 2.47/1.14 fd_pure 0
% 2.47/1.14 fd_pseudo 0
% 2.47/1.14 fd_cond 0
% 2.47/1.14 fd_pseudo_cond 0
% 2.47/1.14 AC symbols 0
% 2.47/1.14
% 2.47/1.14 ------ Schedule UEQ
% 2.47/1.14
% 2.47/1.14 ------ Option_UEQ Time Limit: 10.
% 2.47/1.14
% 2.47/1.14
% 2.47/1.14 ------
% 2.47/1.14 Current options:
% 2.47/1.14 ------
% 2.47/1.14
% 2.47/1.14
% 2.47/1.14
% 2.47/1.14
% 2.47/1.14 ------ Proving...
% 2.47/1.14
% 2.47/1.14
% 2.47/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 2.47/1.14
% 2.47/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.47/1.14
% 2.47/1.14
%------------------------------------------------------------------------------