TSTP Solution File: GRP404-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP404-1 : TPTP v8.1.2. Released v2.6.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 : Fri May 3 02:22:29 EDT 2024
% Result : Unsatisfiable 62.09s 8.62s
% Output : CNFRefutation 62.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of clauses : 30 ( 30 unt; 0 nHn; 7 RR)
% Number of literals : 30 ( 29 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 84 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
multiply(X0,inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),X2)),inverse(multiply(X1,multiply(inverse(X1),X1)))))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(c_92,plain,
inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),X2)),X3)),inverse(multiply(X2,multiply(inverse(X2),X2))))) = multiply(X0,inverse(multiply(inverse(X3),inverse(multiply(X1,multiply(inverse(X1),X1)))))),
inference(superposition,[status(thm)],[c_49,c_49]) ).
cnf(c_118,plain,
multiply(inverse(multiply(X0,X1)),multiply(X0,inverse(multiply(inverse(X2),inverse(multiply(X1,multiply(inverse(X1),X1))))))) = X2,
inference(superposition,[status(thm)],[c_92,c_49]) ).
cnf(c_129,plain,
inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),X2)),multiply(inverse(multiply(X0,X1)),X3))),inverse(multiply(X2,multiply(inverse(X2),X2))))) = X3,
inference(superposition,[status(thm)],[c_92,c_49]) ).
cnf(c_203,plain,
inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),multiply(X0,X2))),inverse(multiply(X1,multiply(inverse(X1),X1))))) = X2,
inference(superposition,[status(thm)],[c_129,c_129]) ).
cnf(c_240,plain,
multiply(inverse(multiply(X0,X1)),inverse(multiply(X2,inverse(multiply(multiply(X0,X2),multiply(inverse(multiply(X0,X2)),multiply(X0,X2))))))) = inverse(multiply(X1,multiply(inverse(X1),X1))),
inference(superposition,[status(thm)],[c_203,c_49]) ).
cnf(c_251,plain,
multiply(inverse(multiply(X0,X1)),multiply(X0,X2)) = multiply(inverse(multiply(X3,X1)),multiply(X3,X2)),
inference(superposition,[status(thm)],[c_203,c_118]) ).
cnf(c_295,plain,
multiply(inverse(multiply(X0,inverse(multiply(X1,multiply(inverse(X1),X1))))),multiply(X0,X2)) = multiply(X3,multiply(inverse(multiply(inverse(multiply(X4,X1)),multiply(X4,X3))),X2)),
inference(superposition,[status(thm)],[c_203,c_251]) ).
cnf(c_1183,plain,
multiply(inverse(multiply(inverse(multiply(X0,X1)),multiply(X0,inverse(X2)))),inverse(multiply(X1,multiply(inverse(X1),X1)))) = X2,
inference(superposition,[status(thm)],[c_240,c_118]) ).
cnf(c_2354,plain,
multiply(inverse(multiply(X0,inverse(multiply(X1,multiply(inverse(X1),X1))))),multiply(X0,inverse(multiply(X1,multiply(inverse(X1),X1))))) = multiply(inverse(X2),X2),
inference(superposition,[status(thm)],[c_1183,c_295]) ).
cnf(c_2818,plain,
multiply(inverse(X0),X0) = multiply(inverse(X1),X1),
inference(superposition,[status(thm)],[c_2354,c_2354]) ).
cnf(c_4401,plain,
multiply(inverse(multiply(X0,X1)),multiply(X0,inverse(multiply(inverse(X2),inverse(multiply(X1,multiply(inverse(X3),X3))))))) = X2,
inference(superposition,[status(thm)],[c_2818,c_118]) ).
cnf(c_4403,plain,
multiply(X0,inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),X2)),inverse(multiply(X1,multiply(inverse(X3),X3)))))) = X2,
inference(superposition,[status(thm)],[c_2818,c_49]) ).
cnf(c_4404,plain,
multiply(multiply(inverse(X0),X0),a2) != a2,
inference(superposition,[status(thm)],[c_2818,c_50]) ).
cnf(c_4433,plain,
inverse(multiply(inverse(multiply(inverse(X0),X0)),inverse(multiply(X1,multiply(inverse(X1),X1))))) = X1,
inference(superposition,[status(thm)],[c_2818,c_203]) ).
cnf(c_4477,plain,
multiply(inverse(multiply(inverse(X0),X0)),inverse(multiply(inverse(X1),multiply(inverse(inverse(X1)),inverse(X1))))) = X1,
inference(superposition,[status(thm)],[c_2818,c_1183]) ).
cnf(c_4690,plain,
inverse(multiply(inverse(multiply(inverse(X0),X0)),inverse(multiply(X1,multiply(inverse(X2),X2))))) = X1,
inference(superposition,[status(thm)],[c_2818,c_4433]) ).
cnf(c_4810,plain,
multiply(multiply(X0,multiply(inverse(multiply(inverse(X1),X1)),inverse(multiply(X0,multiply(inverse(X2),X2))))),a2) != a2,
inference(superposition,[status(thm)],[c_4690,c_4404]) ).
cnf(c_4811,plain,
multiply(X0,multiply(inverse(multiply(inverse(X1),X1)),inverse(multiply(X0,multiply(inverse(X2),X2))))) = multiply(inverse(X3),X3),
inference(superposition,[status(thm)],[c_4690,c_2818]) ).
cnf(c_5146,plain,
multiply(inverse(multiply(inverse(X0),X0)),inverse(multiply(inverse(X1),multiply(inverse(X2),X2)))) = X1,
inference(superposition,[status(thm)],[c_2818,c_4477]) ).
cnf(c_5237,plain,
multiply(inverse(multiply(inverse(X0),X0)),inverse(multiply(inverse(X1),X1))) = multiply(inverse(X2),X2),
inference(superposition,[status(thm)],[c_2818,c_5146]) ).
cnf(c_5466,plain,
multiply(multiply(inverse(multiply(inverse(X0),X0)),multiply(inverse(X1),X1)),a2) != a2,
inference(superposition,[status(thm)],[c_5237,c_4810]) ).
cnf(c_16988,plain,
multiply(inverse(multiply(X0,X1)),multiply(X0,inverse(multiply(inverse(X2),X2)))) = inverse(multiply(X1,multiply(inverse(X3),X3))),
inference(superposition,[status(thm)],[c_2818,c_4401]) ).
cnf(c_38497,plain,
inverse(multiply(multiply(inverse(X0),X0),multiply(inverse(X1),X1))) = multiply(inverse(X2),X2),
inference(superposition,[status(thm)],[c_16988,c_4811]) ).
cnf(c_38503,plain,
multiply(inverse(multiply(inverse(multiply(inverse(X0),X0)),multiply(inverse(X1),X1))),a2) != a2,
inference(superposition,[status(thm)],[c_16988,c_5466]) ).
cnf(c_39680,plain,
multiply(X0,inverse(multiply(inverse(multiply(inverse(multiply(X0,multiply(inverse(X1),X1))),X2)),multiply(inverse(X3),X3)))) = X2,
inference(superposition,[status(thm)],[c_38497,c_4403]) ).
cnf(c_99441,plain,
multiply(inverse(multiply(inverse(multiply(inverse(X0),X0)),multiply(inverse(X1),X1))),X2) = X2,
inference(superposition,[status(thm)],[c_39680,c_5146]) ).
cnf(c_99454,plain,
a2 != a2,
inference(demodulation,[status(thm)],[c_38503,c_99441]) ).
cnf(c_99455,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_99454]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : GRP404-1 : TPTP v8.1.2. Released v2.6.0.
% 0.06/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n025.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 : Fri May 3 00:09:58 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running UEQ theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 62.09/8.62 % SZS status Started for theBenchmark.p
% 62.09/8.62 % SZS status Unsatisfiable for theBenchmark.p
% 62.09/8.62
% 62.09/8.62 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 62.09/8.62
% 62.09/8.62 ------ iProver source info
% 62.09/8.62
% 62.09/8.62 git: date: 2024-05-02 19:28:25 +0000
% 62.09/8.62 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 62.09/8.62 git: non_committed_changes: false
% 62.09/8.62
% 62.09/8.62 ------ Parsing...successful
% 62.09/8.62
% 62.09/8.62
% 62.09/8.62
% 62.09/8.62 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 62.09/8.62
% 62.09/8.62 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 62.09/8.62
% 62.09/8.62 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 62.09/8.62 ------ Proving...
% 62.09/8.62 ------ Problem Properties
% 62.09/8.62
% 62.09/8.62
% 62.09/8.62 clauses 2
% 62.09/8.62 conjectures 1
% 62.09/8.62 EPR 0
% 62.09/8.62 Horn 2
% 62.09/8.62 unary 2
% 62.09/8.62 binary 0
% 62.09/8.62 lits 2
% 62.09/8.62 lits eq 2
% 62.09/8.62 fd_pure 0
% 62.09/8.62 fd_pseudo 0
% 62.09/8.62 fd_cond 0
% 62.09/8.62 fd_pseudo_cond 0
% 62.09/8.62 AC symbols 0
% 62.09/8.62
% 62.09/8.62 ------ Input Options Time Limit: Unbounded
% 62.09/8.62
% 62.09/8.62
% 62.09/8.62 ------
% 62.09/8.62 Current options:
% 62.09/8.62 ------
% 62.09/8.62
% 62.09/8.62
% 62.09/8.62
% 62.09/8.62
% 62.09/8.62 ------ Proving...
% 62.09/8.62
% 62.09/8.62
% 62.09/8.62 % SZS status Unsatisfiable for theBenchmark.p
% 62.09/8.62
% 62.09/8.62 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 62.09/8.62
% 62.09/8.62
%------------------------------------------------------------------------------