TSTP Solution File: GRP017-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP017-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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 : Fri May 3 02:19:46 EDT 2024
% Result : Unsatisfiable 2.14s 1.14s
% Output : CNFRefutation 2.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 16 unt; 0 nHn; 11 RR)
% Number of literals : 24 ( 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; 4 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
product(a,b,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_b_is_identity) ).
cnf(c_52,plain,
product(c,a,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_times_a_is_identity) ).
cnf(c_53,negated_conjecture,
b != c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_b_equals_c) ).
cnf(c_54,plain,
product(identity,X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',left_identity) ).
cnf(c_55,plain,
product(X0,identity,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',right_identity) ).
cnf(c_61,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_67,plain,
multiply(a,b) = identity,
inference(well_definedness,[status(thm)],[c_49]) ).
cnf(c_70,plain,
multiply(c,a) = identity,
inference(well_definedness,[status(thm)],[c_52]) ).
cnf(c_71,plain,
multiply(identity,X0) = X0,
inference(well_definedness,[status(thm)],[c_54]) ).
cnf(c_72,plain,
multiply(X0,identity) = X0,
inference(well_definedness,[status(thm)],[c_55]) ).
cnf(c_80,plain,
( multiply(X0,X1) != X2
| multiply(X0,X3) != X4
| multiply(X1,X5) != X3
| multiply(X2,X5) = X4 ),
inference(well_definedness,[status(thm)],[c_61]) ).
cnf(c_130,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(unflattening,[status(thm)],[c_80]) ).
cnf(c_159,negated_conjecture,
b != c,
inference(demodulation,[status(thm)],[c_53]) ).
cnf(c_207,plain,
multiply(c,multiply(a,X0)) = multiply(identity,X0),
inference(superposition,[status(thm)],[c_70,c_130]) ).
cnf(c_216,plain,
multiply(c,multiply(a,X0)) = X0,
inference(light_normalisation,[status(thm)],[c_207,c_71]) ).
cnf(c_223,plain,
multiply(c,identity) = b,
inference(superposition,[status(thm)],[c_67,c_216]) ).
cnf(c_228,plain,
b = c,
inference(demodulation,[status(thm)],[c_223,c_72]) ).
cnf(c_229,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_228,c_159]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP017-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 23:38:32 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.14/1.14 % SZS status Started for theBenchmark.p
% 2.14/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 2.14/1.14
% 2.14/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.14/1.14
% 2.14/1.14 ------ iProver source info
% 2.14/1.14
% 2.14/1.14 git: date: 2024-05-02 19:28:25 +0000
% 2.14/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.14/1.14 git: non_committed_changes: false
% 2.14/1.14
% 2.14/1.14 ------ Parsing...successful
% 2.14/1.14
% 2.14/1.14
% 2.14/1.14
% 2.14/1.14 ------ 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.14/1.14
% 2.14/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.14/1.14
% 2.14/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.14/1.14 ------ Proving...
% 2.14/1.14 ------ Problem Properties
% 2.14/1.14
% 2.14/1.14
% 2.14/1.14 clauses 10
% 2.14/1.14 conjectures 1
% 2.14/1.14 EPR 1
% 2.14/1.14 Horn 10
% 2.14/1.14 unary 10
% 2.14/1.14 binary 0
% 2.14/1.14 lits 10
% 2.14/1.14 lits eq 10
% 2.14/1.14 fd_pure 0
% 2.14/1.14 fd_pseudo 0
% 2.14/1.14 fd_cond 0
% 2.14/1.14 fd_pseudo_cond 0
% 2.14/1.14 AC symbols 0
% 2.14/1.14
% 2.14/1.14 ------ Schedule UEQ
% 2.14/1.14
% 2.14/1.14 ------ Option_UEQ Time Limit: 10.
% 2.14/1.14
% 2.14/1.14
% 2.14/1.14 ------
% 2.14/1.14 Current options:
% 2.14/1.14 ------
% 2.14/1.14
% 2.14/1.14
% 2.14/1.14
% 2.14/1.14
% 2.14/1.14 ------ Proving...
% 2.14/1.14
% 2.14/1.14
% 2.14/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 2.14/1.14
% 2.14/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.14/1.14
% 2.14/1.14
%------------------------------------------------------------------------------