TSTP Solution File: GRP433-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP433-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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:59:53 EDT 2023
% Result : Unsatisfiable 7.96s 1.47s
% Output : CNFRefutation 7.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 2
% Syntax : Number of clauses : 35 ( 35 unt; 0 nHn; 4 RR)
% Number of literals : 35 ( 34 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 13 ( 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 : 96 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X0,X1),X2)),X0),X1),multiply(X3,inverse(X3)))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(c_91,plain,
inverse(multiply(multiply(multiply(X0,multiply(inverse(multiply(multiply(X1,X2),X0)),X1)),X2),multiply(X3,inverse(X3)))) = multiply(X4,inverse(X4)),
inference(superposition,[status(thm)],[c_49,c_49]) ).
cnf(c_111,plain,
multiply(X0,inverse(X0)) = multiply(X1,inverse(X1)),
inference(superposition,[status(thm)],[c_91,c_91]) ).
cnf(c_307,plain,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X0,inverse(X0)),X1)),X2),inverse(X2)),multiply(X3,inverse(X3)))) = X1,
inference(superposition,[status(thm)],[c_111,c_49]) ).
cnf(c_309,plain,
inverse(multiply(multiply(multiply(inverse(multiply(X0,inverse(X0))),X1),X2),multiply(X3,inverse(X3)))) = inverse(multiply(X1,X2)),
inference(superposition,[status(thm)],[c_111,c_49]) ).
cnf(c_463,plain,
inverse(multiply(multiply(inverse(multiply(multiply(X0,X1),inverse(multiply(X2,inverse(X2))))),X0),X1)) = multiply(X3,inverse(X3)),
inference(superposition,[status(thm)],[c_309,c_91]) ).
cnf(c_470,plain,
inverse(multiply(X0,inverse(X0))) = inverse(multiply(X1,inverse(X1))),
inference(superposition,[status(thm)],[c_309,c_307]) ).
cnf(c_595,plain,
multiply(multiply(X0,inverse(X0)),inverse(multiply(X1,inverse(X1)))) = multiply(X2,inverse(X2)),
inference(superposition,[status(thm)],[c_470,c_111]) ).
cnf(c_658,plain,
multiply(multiply(X0,inverse(X0)),inverse(multiply(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(X4,inverse(X4))),X3))) = multiply(X5,inverse(X5)),
inference(superposition,[status(thm)],[c_49,c_595]) ).
cnf(c_1990,plain,
inverse(multiply(multiply(inverse(multiply(X0,inverse(X0))),X1),inverse(X1))) = multiply(X2,inverse(X2)),
inference(superposition,[status(thm)],[c_595,c_463]) ).
cnf(c_2373,plain,
inverse(multiply(multiply(multiply(multiply(X0,inverse(X0)),inverse(multiply(X1,inverse(X1)))),X2),multiply(X3,inverse(X3)))) = inverse(X2),
inference(superposition,[status(thm)],[c_1990,c_49]) ).
cnf(c_3395,plain,
inverse(multiply(multiply(multiply(X0,inverse(X0)),X1),multiply(X2,inverse(X2)))) = inverse(X1),
inference(superposition,[status(thm)],[c_595,c_2373]) ).
cnf(c_3443,plain,
inverse(multiply(multiply(multiply(multiply(X0,inverse(X0)),inverse(multiply(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(X4,inverse(X4))),X3))),X5),multiply(X6,inverse(X6)))) = inverse(X5),
inference(superposition,[status(thm)],[c_49,c_2373]) ).
cnf(c_4256,plain,
inverse(multiply(multiply(multiply(multiply(X0,inverse(X0)),inverse(multiply(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(X4,inverse(X4))),X3))),X5),multiply(X6,inverse(X6)))) = inverse(multiply(inverse(inverse(multiply(X7,inverse(X7)))),X5)),
inference(superposition,[status(thm)],[c_658,c_309]) ).
cnf(c_4266,plain,
inverse(multiply(inverse(inverse(multiply(X0,inverse(X0)))),X1)) = inverse(X1),
inference(light_normalisation,[status(thm)],[c_4256,c_3443]) ).
cnf(c_4996,plain,
inverse(multiply(inverse(inverse(inverse(inverse(inverse(multiply(X0,inverse(X0))))))),X1)) = inverse(X1),
inference(superposition,[status(thm)],[c_4266,c_4266]) ).
cnf(c_5672,plain,
inverse(inverse(inverse(inverse(multiply(multiply(X0,inverse(X0)),X1))))) = X1,
inference(superposition,[status(thm)],[c_3395,c_307]) ).
cnf(c_5800,plain,
inverse(inverse(inverse(inverse(inverse(multiply(X0,inverse(X0))))))) = multiply(X1,inverse(X1)),
inference(superposition,[status(thm)],[c_3395,c_5672]) ).
cnf(c_6211,plain,
inverse(inverse(inverse(inverse(multiply(inverse(inverse(inverse(inverse(inverse(multiply(X0,inverse(X0))))))),X1))))) = X1,
inference(superposition,[status(thm)],[c_5800,c_5672]) ).
cnf(c_6264,plain,
inverse(inverse(inverse(inverse(X0)))) = X0,
inference(light_normalisation,[status(thm)],[c_6211,c_4996]) ).
cnf(c_6275,plain,
multiply(multiply(X0,inverse(X0)),X1) = X1,
inference(demodulation,[status(thm)],[c_5672,c_6264]) ).
cnf(c_6276,plain,
inverse(multiply(X0,multiply(X1,inverse(X1)))) = inverse(X0),
inference(demodulation,[status(thm)],[c_3395,c_6275]) ).
cnf(c_6287,plain,
inverse(multiply(multiply(inverse(multiply(multiply(X0,X1),X2)),X0),X1)) = X2,
inference(demodulation,[status(thm)],[c_49,c_6276]) ).
cnf(c_7152,plain,
multiply(inverse(inverse(inverse(X0))),X0) = multiply(X1,inverse(X1)),
inference(superposition,[status(thm)],[c_6264,c_111]) ).
cnf(c_7336,plain,
multiply(X0,multiply(X1,inverse(X1))) = inverse(inverse(inverse(inverse(X0)))),
inference(superposition,[status(thm)],[c_6276,c_6264]) ).
cnf(c_7345,plain,
multiply(X0,multiply(X1,inverse(X1))) = X0,
inference(light_normalisation,[status(thm)],[c_7336,c_6264]) ).
cnf(c_14838,plain,
inverse(multiply(inverse(multiply(multiply(multiply(X0,inverse(X0)),X1),X2)),X1)) = X2,
inference(superposition,[status(thm)],[c_7345,c_6287]) ).
cnf(c_14960,plain,
inverse(multiply(inverse(multiply(X0,X1)),X0)) = X1,
inference(light_normalisation,[status(thm)],[c_14838,c_6275]) ).
cnf(c_15089,plain,
inverse(inverse(multiply(multiply(X0,inverse(X0)),X1))) = X1,
inference(superposition,[status(thm)],[c_7345,c_14960]) ).
cnf(c_15168,plain,
inverse(inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_15089,c_6275]) ).
cnf(c_15189,plain,
multiply(inverse(X0),X0) = multiply(X1,inverse(X1)),
inference(demodulation,[status(thm)],[c_7152,c_15168]) ).
cnf(c_15431,plain,
multiply(X0,inverse(X0)) != multiply(inverse(a1),a1),
inference(superposition,[status(thm)],[c_15189,c_50]) ).
cnf(c_15517,plain,
multiply(X0,inverse(X0)) != multiply(X1,inverse(X1)),
inference(superposition,[status(thm)],[c_15189,c_15431]) ).
cnf(c_15518,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_15517,c_111]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.08 % Problem : GRP433-1 : TPTP v8.1.2. Released v2.6.0.
% 0.06/0.08 % Command : run_iprover %s %d THM
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Mon Aug 28 21:55:01 EDT 2023
% 0.08/0.27 % CPUTime :
% 0.12/0.34 Running UEQ theorem proving
% 0.12/0.34 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.96/1.47 % SZS status Started for theBenchmark.p
% 7.96/1.47 % SZS status Unsatisfiable for theBenchmark.p
% 7.96/1.47
% 7.96/1.47 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.96/1.47
% 7.96/1.47 ------ iProver source info
% 7.96/1.47
% 7.96/1.47 git: date: 2023-05-31 18:12:56 +0000
% 7.96/1.47 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.96/1.47 git: non_committed_changes: false
% 7.96/1.47 git: last_make_outside_of_git: false
% 7.96/1.47
% 7.96/1.47 ------ Parsing...successful
% 7.96/1.47
% 7.96/1.47
% 7.96/1.47
% 7.96/1.47 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 7.96/1.47
% 7.96/1.47 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.96/1.47
% 7.96/1.47 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 7.96/1.47 ------ Proving...
% 7.96/1.47 ------ Problem Properties
% 7.96/1.47
% 7.96/1.47
% 7.96/1.47 clauses 2
% 7.96/1.47 conjectures 1
% 7.96/1.47 EPR 0
% 7.96/1.47 Horn 2
% 7.96/1.47 unary 2
% 7.96/1.47 binary 0
% 7.96/1.47 lits 2
% 7.96/1.47 lits eq 2
% 7.96/1.47 fd_pure 0
% 7.96/1.47 fd_pseudo 0
% 7.96/1.47 fd_cond 0
% 7.96/1.47 fd_pseudo_cond 0
% 7.96/1.47 AC symbols 0
% 7.96/1.47
% 7.96/1.47 ------ Input Options Time Limit: Unbounded
% 7.96/1.47
% 7.96/1.47
% 7.96/1.47 ------
% 7.96/1.47 Current options:
% 7.96/1.47 ------
% 7.96/1.47
% 7.96/1.47
% 7.96/1.47
% 7.96/1.47
% 7.96/1.47 ------ Proving...
% 7.96/1.47
% 7.96/1.47
% 7.96/1.47 % SZS status Unsatisfiable for theBenchmark.p
% 7.96/1.47
% 7.96/1.47 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.96/1.48
% 7.96/1.48
%------------------------------------------------------------------------------