TSTP Solution File: GRP012-3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP012-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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:45 EDT 2024
% Result : Unsatisfiable 3.39s 1.20s
% Output : CNFRefutation 3.39s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
multiply(inverse(b),inverse(a)) != inverse(multiply(a,b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_inverse_of_product_is_product_of_inverses) ).
cnf(c_50,plain,
product(identity,X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',left_identity) ).
cnf(c_51,plain,
product(X0,identity,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',right_identity) ).
cnf(c_52,plain,
product(inverse(X0),X0,identity),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',left_inverse) ).
cnf(c_53,plain,
product(X0,inverse(X0),identity),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/GRP003-0.ax',associativity2) ).
cnf(c_63,plain,
multiply(identity,X0) = X0,
inference(well_definedness,[status(thm)],[c_50]) ).
cnf(c_64,plain,
multiply(X0,identity) = X0,
inference(well_definedness,[status(thm)],[c_51]) ).
cnf(c_65,plain,
multiply(inverse(X0),X0) = identity,
inference(well_definedness,[status(thm)],[c_52]) ).
cnf(c_66,plain,
multiply(X0,inverse(X0)) = identity,
inference(well_definedness,[status(thm)],[c_53]) ).
cnf(c_72,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_114,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(unflattening,[status(thm)],[c_72]) ).
cnf(c_137,plain,
inverse(b) = sP0_iProver_def,
definition ).
cnf(c_138,plain,
inverse(a) = sP1_iProver_def,
definition ).
cnf(c_139,plain,
multiply(sP0_iProver_def,sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_140,plain,
multiply(a,b) = sP3_iProver_def,
definition ).
cnf(c_141,plain,
inverse(sP3_iProver_def) = sP4_iProver_def,
definition ).
cnf(c_142,negated_conjecture,
sP2_iProver_def != sP4_iProver_def,
inference(demodulation,[status(thm)],[c_49,c_140,c_141,c_138,c_137,c_139]) ).
cnf(c_192,plain,
multiply(sP4_iProver_def,sP3_iProver_def) = identity,
inference(superposition,[status(thm)],[c_141,c_65]) ).
cnf(c_195,plain,
multiply(b,sP0_iProver_def) = identity,
inference(superposition,[status(thm)],[c_137,c_66]) ).
cnf(c_196,plain,
multiply(a,sP1_iProver_def) = identity,
inference(superposition,[status(thm)],[c_138,c_66]) ).
cnf(c_203,plain,
multiply(a,multiply(b,X0)) = multiply(sP3_iProver_def,X0),
inference(superposition,[status(thm)],[c_140,c_114]) ).
cnf(c_212,plain,
multiply(sP4_iProver_def,multiply(sP3_iProver_def,X0)) = multiply(identity,X0),
inference(superposition,[status(thm)],[c_192,c_114]) ).
cnf(c_213,plain,
multiply(b,multiply(sP0_iProver_def,X0)) = multiply(identity,X0),
inference(superposition,[status(thm)],[c_195,c_114]) ).
cnf(c_221,plain,
multiply(b,multiply(sP0_iProver_def,X0)) = X0,
inference(light_normalisation,[status(thm)],[c_213,c_63]) ).
cnf(c_222,plain,
multiply(sP4_iProver_def,multiply(sP3_iProver_def,X0)) = X0,
inference(light_normalisation,[status(thm)],[c_212,c_63]) ).
cnf(c_244,plain,
multiply(b,sP2_iProver_def) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_139,c_221]) ).
cnf(c_256,plain,
multiply(a,sP1_iProver_def) = multiply(sP3_iProver_def,sP2_iProver_def),
inference(superposition,[status(thm)],[c_244,c_203]) ).
cnf(c_258,plain,
multiply(sP3_iProver_def,sP2_iProver_def) = identity,
inference(light_normalisation,[status(thm)],[c_256,c_196]) ).
cnf(c_278,plain,
multiply(sP4_iProver_def,identity) = sP2_iProver_def,
inference(superposition,[status(thm)],[c_258,c_222]) ).
cnf(c_283,plain,
sP2_iProver_def = sP4_iProver_def,
inference(demodulation,[status(thm)],[c_278,c_64]) ).
cnf(c_284,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_283,c_142]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP012-3 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n008.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 : Thu May 2 23:57:28 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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
% 3.39/1.20 % SZS status Started for theBenchmark.p
% 3.39/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 3.39/1.20
% 3.39/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.39/1.20
% 3.39/1.20 ------ iProver source info
% 3.39/1.20
% 3.39/1.20 git: date: 2024-05-02 19:28:25 +0000
% 3.39/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.39/1.20 git: non_committed_changes: false
% 3.39/1.20
% 3.39/1.20 ------ Parsing...successful
% 3.39/1.20
% 3.39/1.20
% 3.39/1.20
% 3.39/1.20 ------ 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
% 3.39/1.20
% 3.39/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.39/1.20
% 3.39/1.20 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.39/1.20 ------ Proving...
% 3.39/1.20 ------ Problem Properties
% 3.39/1.20
% 3.39/1.20
% 3.39/1.20 clauses 11
% 3.39/1.20 conjectures 1
% 3.39/1.20 EPR 1
% 3.39/1.20 Horn 11
% 3.39/1.20 unary 11
% 3.39/1.20 binary 0
% 3.39/1.20 lits 11
% 3.39/1.20 lits eq 11
% 3.39/1.20 fd_pure 0
% 3.39/1.20 fd_pseudo 0
% 3.39/1.20 fd_cond 0
% 3.39/1.20 fd_pseudo_cond 0
% 3.39/1.20 AC symbols 0
% 3.39/1.20
% 3.39/1.20 ------ Schedule UEQ
% 3.39/1.20
% 3.39/1.20 ------ Option_UEQ Time Limit: 10.
% 3.39/1.20
% 3.39/1.20
% 3.39/1.20 ------
% 3.39/1.20 Current options:
% 3.39/1.20 ------
% 3.39/1.20
% 3.39/1.20
% 3.39/1.20
% 3.39/1.20
% 3.39/1.20 ------ Proving...
% 3.39/1.20
% 3.39/1.20
% 3.39/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 3.39/1.20
% 3.39/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.39/1.20
% 3.39/1.20
%------------------------------------------------------------------------------