TSTP Solution File: GRP478-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP478-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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 01:00:04 EDT 2023
% Result : Unsatisfiable 19.19s 3.15s
% Output : CNFRefutation 19.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 3
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 3 RR)
% Number of literals : 38 ( 37 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 142 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(inverse(divide(divide(divide(X0,X0),X1),divide(X2,divide(X1,X3)))),X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
divide(X0,inverse(X1)) = multiply(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_51,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(c_111,plain,
inverse(divide(divide(divide(X0,X0),X1),divide(X2,divide(X1,divide(X3,X4))))) = divide(inverse(divide(divide(divide(X5,X5),X3),X2)),X4),
inference(superposition,[status(thm)],[c_49,c_49]) ).
cnf(c_420,plain,
divide(divide(inverse(divide(divide(divide(X0,X0),X1),X2)),X3),divide(X1,X3)) = X2,
inference(superposition,[status(thm)],[c_111,c_49]) ).
cnf(c_444,plain,
inverse(divide(divide(divide(X0,X0),X1),divide(divide(X2,divide(X3,X4)),divide(X1,divide(X3,X4))))) = X2,
inference(superposition,[status(thm)],[c_111,c_49]) ).
cnf(c_525,plain,
divide(multiply(inverse(divide(divide(divide(X0,X0),X1),X2)),X3),divide(X1,inverse(X3))) = X2,
inference(superposition,[status(thm)],[c_50,c_420]) ).
cnf(c_529,plain,
divide(divide(inverse(multiply(divide(divide(X0,X0),X1),X2)),X3),divide(X1,X3)) = inverse(X2),
inference(superposition,[status(thm)],[c_50,c_420]) ).
cnf(c_605,plain,
divide(multiply(inverse(divide(divide(divide(X0,X0),X1),X2)),X3),multiply(X1,X3)) = X2,
inference(superposition,[status(thm)],[c_50,c_525]) ).
cnf(c_656,plain,
divide(multiply(inverse(divide(multiply(divide(X0,X0),X1),X2)),X3),multiply(inverse(X1),X3)) = X2,
inference(superposition,[status(thm)],[c_50,c_605]) ).
cnf(c_658,plain,
divide(multiply(inverse(divide(divide(multiply(inverse(X0),X0),X1),X2)),X3),multiply(X1,X3)) = X2,
inference(superposition,[status(thm)],[c_50,c_605]) ).
cnf(c_1002,plain,
divide(multiply(inverse(divide(multiply(multiply(inverse(X0),X0),X1),X2)),X3),multiply(inverse(X1),X3)) = X2,
inference(superposition,[status(thm)],[c_50,c_656]) ).
cnf(c_1050,plain,
divide(multiply(inverse(divide(X0,X1)),X2),multiply(multiply(X3,divide(divide(divide(X4,X4),X3),X0)),X2)) = X1,
inference(superposition,[status(thm)],[c_605,c_658]) ).
cnf(c_1760,plain,
inverse(divide(divide(divide(X0,X0),X1),divide(divide(X2,X3),divide(X1,X3)))) = X2,
inference(superposition,[status(thm)],[c_1002,c_444]) ).
cnf(c_1896,plain,
divide(divide(X0,X1),divide(X2,X1)) = divide(multiply(X0,X3),multiply(X2,X3)),
inference(superposition,[status(thm)],[c_1760,c_605]) ).
cnf(c_1898,plain,
divide(divide(X0,X1),divide(X2,X1)) = divide(divide(X0,X3),divide(X2,X3)),
inference(superposition,[status(thm)],[c_1760,c_420]) ).
cnf(c_2118,plain,
divide(multiply(inverse(divide(multiply(divide(X0,X0),X1),multiply(X2,X1))),X3),multiply(X4,X3)) = divide(X2,X4),
inference(superposition,[status(thm)],[c_1896,c_605]) ).
cnf(c_2133,plain,
inverse(divide(divide(divide(X0,X0),X1),divide(multiply(X2,X3),multiply(X1,X3)))) = X2,
inference(superposition,[status(thm)],[c_1896,c_1760]) ).
cnf(c_2135,plain,
divide(multiply(X0,X1),multiply(X2,X1)) = divide(multiply(X0,X3),multiply(X2,X3)),
inference(superposition,[status(thm)],[c_1896,c_1896]) ).
cnf(c_4093,plain,
multiply(X0,divide(divide(divide(X1,X1),X2),divide(multiply(X3,X4),multiply(X2,X4)))) = divide(X0,X3),
inference(superposition,[status(thm)],[c_2133,c_50]) ).
cnf(c_35737,plain,
divide(X0,multiply(X1,divide(divide(divide(X2,X2),X1),multiply(divide(X3,X3),X4)))) = multiply(X0,X4),
inference(superposition,[status(thm)],[c_2118,c_1050]) ).
cnf(c_36310,plain,
divide(divide(inverse(multiply(divide(divide(X0,X0),X1),X2)),X3),divide(X1,X3)) = multiply(X4,divide(divide(divide(X5,X5),X4),multiply(divide(X6,X6),X2))),
inference(superposition,[status(thm)],[c_35737,c_420]) ).
cnf(c_36448,plain,
multiply(X0,divide(divide(divide(X1,X1),X0),multiply(divide(X2,X2),X3))) = inverse(X3),
inference(light_normalisation,[status(thm)],[c_36310,c_529]) ).
cnf(c_36830,plain,
inverse(divide(divide(divide(X0,X0),X1),divide(multiply(X2,X3),multiply(X1,X3)))) = multiply(X4,divide(divide(divide(X5,X5),X4),divide(divide(X6,X6),X2))),
inference(superposition,[status(thm)],[c_4093,c_36448]) ).
cnf(c_37066,plain,
multiply(X0,divide(divide(divide(X1,X1),X0),divide(divide(X2,X2),X3))) = X3,
inference(light_normalisation,[status(thm)],[c_36830,c_2133]) ).
cnf(c_37303,plain,
multiply(X0,divide(divide(divide(X1,X1),X2),divide(divide(X3,X3),X2))) = X0,
inference(superposition,[status(thm)],[c_1898,c_37066]) ).
cnf(c_39348,plain,
divide(multiply(X0,divide(divide(divide(X1,X1),X2),divide(divide(X3,X3),X2))),X4) = divide(multiply(X0,X5),multiply(X4,X5)),
inference(superposition,[status(thm)],[c_37303,c_2135]) ).
cnf(c_39383,plain,
divide(multiply(X0,X1),multiply(X2,X1)) = divide(X0,X2),
inference(light_normalisation,[status(thm)],[c_39348,c_37303]) ).
cnf(c_39406,plain,
multiply(X0,divide(divide(divide(X1,X1),X2),divide(X3,X2))) = divide(X0,X3),
inference(demodulation,[status(thm)],[c_4093,c_39383]) ).
cnf(c_39417,plain,
divide(X0,divide(X1,X1)) = X0,
inference(demodulation,[status(thm)],[c_37303,c_39406]) ).
cnf(c_39680,plain,
divide(X0,multiply(inverse(X1),X1)) = X0,
inference(superposition,[status(thm)],[c_50,c_39417]) ).
cnf(c_39741,plain,
divide(inverse(divide(divide(divide(X0,X0),X1),divide(X2,divide(X1,X3)))),X3) = inverse(divide(divide(X4,X4),X2)),
inference(superposition,[status(thm)],[c_39417,c_111]) ).
cnf(c_39888,plain,
inverse(divide(divide(X0,X0),X1)) = X1,
inference(light_normalisation,[status(thm)],[c_39741,c_49]) ).
cnf(c_40617,plain,
inverse(divide(X0,X0)) = divide(X1,X1),
inference(superposition,[status(thm)],[c_39417,c_39888]) ).
cnf(c_40902,plain,
divide(X0,X0) = divide(X1,X1),
inference(superposition,[status(thm)],[c_40617,c_39888]) ).
cnf(c_42427,plain,
multiply(inverse(X0),X0) = divide(X1,X1),
inference(superposition,[status(thm)],[c_40902,c_39680]) ).
cnf(c_43174,plain,
multiply(inverse(a1),a1) != divide(X0,X0),
inference(superposition,[status(thm)],[c_42427,c_51]) ).
cnf(c_43437,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_43174,c_42427]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP478-1 : TPTP v8.1.2. Released v2.6.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Aug 28 21:34:20 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running UEQ theorem proving
% 0.20/0.47 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
% 19.19/3.15 % SZS status Started for theBenchmark.p
% 19.19/3.15 % SZS status Unsatisfiable for theBenchmark.p
% 19.19/3.15
% 19.19/3.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 19.19/3.15
% 19.19/3.15 ------ iProver source info
% 19.19/3.15
% 19.19/3.15 git: date: 2023-05-31 18:12:56 +0000
% 19.19/3.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 19.19/3.15 git: non_committed_changes: false
% 19.19/3.15 git: last_make_outside_of_git: false
% 19.19/3.15
% 19.19/3.15 ------ Parsing...successful
% 19.19/3.15
% 19.19/3.15
% 19.19/3.15
% 19.19/3.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 19.19/3.15
% 19.19/3.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 19.19/3.15
% 19.19/3.15 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 19.19/3.15 ------ Proving...
% 19.19/3.15 ------ Problem Properties
% 19.19/3.15
% 19.19/3.15
% 19.19/3.15 clauses 3
% 19.19/3.15 conjectures 1
% 19.19/3.15 EPR 0
% 19.19/3.15 Horn 3
% 19.19/3.15 unary 3
% 19.19/3.15 binary 0
% 19.19/3.15 lits 3
% 19.19/3.15 lits eq 3
% 19.19/3.15 fd_pure 0
% 19.19/3.15 fd_pseudo 0
% 19.19/3.15 fd_cond 0
% 19.19/3.15 fd_pseudo_cond 0
% 19.19/3.15 AC symbols 0
% 19.19/3.15
% 19.19/3.15 ------ Input Options Time Limit: Unbounded
% 19.19/3.15
% 19.19/3.15
% 19.19/3.15 ------
% 19.19/3.15 Current options:
% 19.19/3.15 ------
% 19.19/3.15
% 19.19/3.15
% 19.19/3.15
% 19.19/3.15
% 19.19/3.15 ------ Proving...
% 19.19/3.15
% 19.19/3.15
% 19.19/3.15 % SZS status Unsatisfiable for theBenchmark.p
% 19.19/3.15
% 19.19/3.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 19.19/3.16
% 19.19/3.16
%------------------------------------------------------------------------------