TSTP Solution File: GRP010-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP010-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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:34 EDT 2023
% Result : Unsatisfiable 1.96s 1.16s
% Output : CNFRefutation 1.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 17 unt; 0 nHn; 10 RR)
% Number of literals : 25 ( 15 equ; 8 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
product(a,b,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_multiply_b_is_identity) ).
cnf(c_50,negated_conjecture,
~ product(b,a,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_b_multiply_a_is_identity) ).
cnf(c_51,plain,
product(identity,X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',left_identity) ).
cnf(c_52,plain,
product(X0,identity,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',right_identity) ).
cnf(c_54,plain,
product(X0,inverse(X0),identity),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',right_inverse) ).
cnf(c_58,plain,
( ~ product(X0,X1,X2)
| ~ product(X0,X3,X4)
| ~ product(X1,X5,X3)
| product(X2,X5,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',associativity2) ).
cnf(c_64,plain,
multiply(a,b) = identity,
inference(well_definedness,[status(thm)],[c_49]) ).
cnf(c_65,plain,
multiply(b,a) != identity,
inference(well_definedness,[status(thm)],[c_50]) ).
cnf(c_66,plain,
multiply(identity,X0) = X0,
inference(well_definedness,[status(thm)],[c_51]) ).
cnf(c_67,plain,
multiply(X0,identity) = X0,
inference(well_definedness,[status(thm)],[c_52]) ).
cnf(c_69,plain,
multiply(X0,inverse(X0)) = identity,
inference(well_definedness,[status(thm)],[c_54]) ).
cnf(c_75,plain,
( multiply(X0,X1) != X2
| multiply(X0,X3) != X4
| multiply(X1,X5) != X3
| multiply(X2,X5) = X4 ),
inference(well_definedness,[status(thm)],[c_58]) ).
cnf(c_119,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(unflattening,[status(thm)],[c_75]) ).
cnf(c_182,plain,
multiply(a,multiply(b,X0)) = multiply(identity,X0),
inference(superposition,[status(thm)],[c_64,c_119]) ).
cnf(c_191,plain,
multiply(a,multiply(b,X0)) = X0,
inference(light_normalisation,[status(thm)],[c_182,c_66]) ).
cnf(c_195,plain,
multiply(a,identity) = inverse(b),
inference(superposition,[status(thm)],[c_69,c_191]) ).
cnf(c_197,plain,
inverse(b) = a,
inference(demodulation,[status(thm)],[c_195,c_67]) ).
cnf(c_198,plain,
multiply(b,a) = identity,
inference(superposition,[status(thm)],[c_197,c_69]) ).
cnf(c_200,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_198,c_65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP010-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n016.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 : Tue Aug 29 02:29:00 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.96/1.16 % SZS status Started for theBenchmark.p
% 1.96/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 1.96/1.16
% 1.96/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.96/1.16
% 1.96/1.16 ------ iProver source info
% 1.96/1.16
% 1.96/1.16 git: date: 2023-05-31 18:12:56 +0000
% 1.96/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.96/1.16 git: non_committed_changes: false
% 1.96/1.16 git: last_make_outside_of_git: false
% 1.96/1.16
% 1.96/1.16 ------ Parsing...successful
% 1.96/1.16
% 1.96/1.16
% 1.96/1.16
% 1.96/1.16 ------ Preprocessing... sup_sim: 4 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
% 1.96/1.16
% 1.96/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.96/1.16
% 1.96/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.96/1.16 ------ Proving...
% 1.96/1.16 ------ Problem Properties
% 1.96/1.16
% 1.96/1.16
% 1.96/1.16 clauses 7
% 1.96/1.16 conjectures 0
% 1.96/1.16 EPR 0
% 1.96/1.16 Horn 7
% 1.96/1.16 unary 7
% 1.96/1.16 binary 0
% 1.96/1.16 lits 7
% 1.96/1.16 lits eq 7
% 1.96/1.16 fd_pure 0
% 1.96/1.16 fd_pseudo 0
% 1.96/1.16 fd_cond 0
% 1.96/1.16 fd_pseudo_cond 0
% 1.96/1.16 AC symbols 0
% 1.96/1.16
% 1.96/1.16 ------ Schedule UEQ
% 1.96/1.16
% 1.96/1.16 ------ Option_UEQ Time Limit: 10.
% 1.96/1.16
% 1.96/1.16
% 1.96/1.16 ------
% 1.96/1.16 Current options:
% 1.96/1.16 ------
% 1.96/1.16
% 1.96/1.16
% 1.96/1.16
% 1.96/1.16
% 1.96/1.16 ------ Proving...
% 1.96/1.16
% 1.96/1.16
% 1.96/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 1.96/1.16
% 1.96/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.96/1.16
% 1.96/1.16
%------------------------------------------------------------------------------