TSTP Solution File: GRP031-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP031-1 : TPTP v8.2.0. Released v1.0.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 : Mon Jun 24 06:57:36 EDT 2024
% Result : Unsatisfiable 2.86s 1.17s
% Output : CNFRefutation 2.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of clauses : 14 ( 12 unt; 0 nHn; 5 RR)
% Number of literals : 20 ( 12 equ; 8 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 28 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
product(identity,X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
cnf(c_50,plain,
product(inverse(X0),X0,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).
cnf(c_51,negated_conjecture,
~ product(a,X0,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_has_an_inverse) ).
cnf(c_55,plain,
( ~ product(X0,X1,X2)
| ~ product(X0,X3,X4)
| ~ product(X1,X5,X3)
| product(X2,X5,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP002-0.ax',associativity2) ).
cnf(c_61,plain,
multiply(identity,X0) = X0,
inference(well_definedness,[status(thm)],[c_49]) ).
cnf(c_62,plain,
multiply(inverse(X0),X0) = identity,
inference(well_definedness,[status(thm)],[c_50]) ).
cnf(c_63,plain,
multiply(a,X0) != identity,
inference(well_definedness,[status(thm)],[c_51]) ).
cnf(c_69,plain,
( multiply(X0,X1) != X2
| multiply(X0,X3) != X4
| multiply(X1,X5) != X3
| multiply(X2,X5) = X4 ),
inference(well_definedness,[status(thm)],[c_55]) ).
cnf(c_107,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(unflattening,[status(thm)],[c_69]) ).
cnf(c_151,plain,
multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_62,c_107]) ).
cnf(c_155,plain,
multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_151,c_61]) ).
cnf(c_159,plain,
multiply(inverse(inverse(X0)),X1) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_155,c_155]) ).
cnf(c_221,plain,
multiply(X0,inverse(X0)) = identity,
inference(superposition,[status(thm)],[c_159,c_62]) ).
cnf(c_241,plain,
$false,
inference(superposition,[status(thm)],[c_221,c_63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP031-1 : TPTP v8.2.0. Released v1.0.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.12/0.32 % Computer : n028.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Thu Jun 20 11:47:24 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.86/1.17 % SZS status Started for theBenchmark.p
% 2.86/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 2.86/1.17
% 2.86/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.86/1.17
% 2.86/1.17 ------ iProver source info
% 2.86/1.17
% 2.86/1.17 git: date: 2024-06-12 09:56:46 +0000
% 2.86/1.17 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 2.86/1.17 git: non_committed_changes: false
% 2.86/1.17
% 2.86/1.17 ------ Parsing...successful
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17 ------ 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
% 2.86/1.17
% 2.86/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.86/1.17
% 2.86/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.86/1.17 ------ Proving...
% 2.86/1.17 ------ Problem Properties
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17 clauses 4
% 2.86/1.17 conjectures 0
% 2.86/1.17 EPR 0
% 2.86/1.17 Horn 4
% 2.86/1.17 unary 4
% 2.86/1.17 binary 0
% 2.86/1.17 lits 4
% 2.86/1.17 lits eq 4
% 2.86/1.17 fd_pure 0
% 2.86/1.17 fd_pseudo 0
% 2.86/1.17 fd_cond 0
% 2.86/1.17 fd_pseudo_cond 0
% 2.86/1.17 AC symbols 0
% 2.86/1.17
% 2.86/1.17 ------ Schedule UEQ
% 2.86/1.17
% 2.86/1.17 ------ Option_UEQ Time Limit: 10.
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17 ------
% 2.86/1.17 Current options:
% 2.86/1.17 ------
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17 ------ Proving...
% 2.86/1.17
% 2.86/1.17
% 2.86/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 2.86/1.17
% 2.86/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.86/1.17
% 2.86/1.17
%------------------------------------------------------------------------------