TSTP Solution File: GRP473-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP473-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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:03 EDT 2023
% Result : Unsatisfiable 46.96s 6.65s
% Output : CNFRefutation 46.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 4 RR)
% Number of literals : 33 ( 32 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 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 : 144 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(divide(inverse(divide(X0,X1)),divide(divide(X2,X3),X0)),divide(X3,X2)) = X1,
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(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(c_151,plain,
divide(divide(inverse(X0),divide(divide(X1,X2),divide(inverse(divide(X3,X0)),divide(divide(X4,X5),X3)))),divide(X2,X1)) = divide(X5,X4),
inference(superposition,[status(thm)],[c_49,c_49]) ).
cnf(c_659,plain,
divide(divide(inverse(X0),divide(divide(X1,X2),divide(inverse(divide(X3,X0)),divide(X4,X3)))),divide(X2,X1)) = divide(divide(X5,X6),divide(inverse(divide(X7,X4)),divide(divide(X6,X5),X7))),
inference(superposition,[status(thm)],[c_49,c_151]) ).
cnf(c_1227,plain,
divide(divide(X0,X1),divide(inverse(divide(X2,divide(X3,X4))),divide(divide(X1,X0),X2))) = divide(X4,X3),
inference(superposition,[status(thm)],[c_659,c_151]) ).
cnf(c_12693,plain,
divide(divide(inverse(divide(divide(X0,X1),X2)),X3),divide(divide(divide(X1,X0),X4),inverse(divide(X4,X3)))) = X2,
inference(superposition,[status(thm)],[c_49,c_49]) ).
cnf(c_12696,plain,
multiply(divide(inverse(b2),inverse(b2)),a2) != a2,
inference(superposition,[status(thm)],[c_50,c_51]) ).
cnf(c_12709,plain,
divide(divide(inverse(divide(X0,X1)),divide(divide(X2,X3),divide(inverse(X4),divide(divide(X5,X6),divide(inverse(divide(X7,X4)),divide(divide(X1,X0),X7)))))),divide(X3,X2)) = divide(X6,X5),
inference(superposition,[status(thm)],[c_151,c_49]) ).
cnf(c_12711,plain,
divide(divide(inverse(divide(divide(X0,X1),X2)),divide(X3,X4)),divide(divide(divide(X1,X0),divide(inverse(divide(X5,X6)),divide(divide(X4,X3),X5))),inverse(X6))) = X2,
inference(superposition,[status(thm)],[c_151,c_49]) ).
cnf(c_12719,plain,
divide(X0,divide(inverse(divide(X1,divide(X2,X3))),divide(divide(divide(X4,X5),divide(inverse(divide(X6,X0)),divide(divide(X5,X4),X6))),X1))) = divide(X3,X2),
inference(superposition,[status(thm)],[c_49,c_1227]) ).
cnf(c_12722,plain,
divide(divide(X0,X1),divide(inverse(X2),divide(divide(X1,X0),divide(inverse(divide(X3,X2)),divide(divide(X4,X5),X3))))) = divide(X4,X5),
inference(superposition,[status(thm)],[c_49,c_1227]) ).
cnf(c_12723,plain,
divide(divide(X0,X1),divide(inverse(divide(X2,X3)),divide(divide(X1,X0),divide(inverse(X4),divide(divide(X5,X6),divide(inverse(divide(X7,X4)),divide(divide(X3,X2),X7))))))) = divide(X5,X6),
inference(superposition,[status(thm)],[c_151,c_1227]) ).
cnf(c_12743,plain,
divide(divide(inverse(divide(X0,X1)),divide(X1,X0)),divide(X2,X3)) = divide(X3,X2),
inference(superposition,[status(thm)],[c_1227,c_151]) ).
cnf(c_12791,plain,
divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2,
inference(demodulation,[status(thm)],[c_12696,c_50]) ).
cnf(c_15341,plain,
divide(divide(inverse(divide(divide(inverse(divide(X0,divide(X1,X2))),divide(divide(X3,X4),X0)),divide(X4,X3))),divide(divide(X5,X6),divide(inverse(divide(X7,X8)),divide(X8,X7)))),divide(X6,X5)) = divide(X2,X1),
inference(superposition,[status(thm)],[c_12719,c_12709]) ).
cnf(c_15636,plain,
divide(divide(X0,X1),divide(inverse(divide(X2,X3)),divide(X3,X2))) = divide(X0,X1),
inference(superposition,[status(thm)],[c_12722,c_12723]) ).
cnf(c_15667,plain,
divide(divide(X0,X1),divide(inverse(divide(X2,X3)),divide(divide(X1,X0),divide(inverse(divide(X4,X5)),divide(X5,X4))))) = divide(X2,X3),
inference(superposition,[status(thm)],[c_1227,c_12723]) ).
cnf(c_15871,plain,
divide(divide(X0,X1),divide(inverse(divide(X2,X3)),divide(X1,X0))) = divide(X2,X3),
inference(demodulation,[status(thm)],[c_15667,c_15636]) ).
cnf(c_15876,plain,
divide(divide(inverse(divide(divide(inverse(divide(X0,divide(X1,X2))),divide(divide(X3,X4),X0)),divide(X4,X3))),divide(X5,X6)),divide(X6,X5)) = divide(X2,X1),
inference(demodulation,[status(thm)],[c_15341,c_15636]) ).
cnf(c_15877,plain,
divide(divide(inverse(divide(X0,X1)),divide(X2,X3)),divide(X3,X2)) = divide(X1,X0),
inference(demodulation,[status(thm)],[c_15876,c_49]) ).
cnf(c_16453,plain,
divide(X0,divide(inverse(divide(X1,X2)),divide(X2,X1))) = X0,
inference(superposition,[status(thm)],[c_12711,c_15636]) ).
cnf(c_17033,plain,
divide(X0,inverse(divide(divide(X1,X2),inverse(divide(X2,X1))))) = X0,
inference(superposition,[status(thm)],[c_16453,c_16453]) ).
cnf(c_17088,plain,
divide(divide(X0,X1),divide(inverse(X2),divide(X1,X0))) = X2,
inference(superposition,[status(thm)],[c_16453,c_15871]) ).
cnf(c_17169,plain,
divide(divide(inverse(divide(X0,X1)),X2),divide(divide(divide(X3,X4),X5),inverse(divide(X5,X2)))) = divide(inverse(divide(X0,X1)),divide(X3,X4)),
inference(superposition,[status(thm)],[c_15871,c_12693]) ).
cnf(c_17404,plain,
divide(divide(inverse(divide(divide(divide(X0,X1),divide(inverse(divide(X2,X3)),divide(X1,X0))),X4)),X5),divide(divide(divide(X3,X2),X6),inverse(divide(X6,X5)))) = X4,
inference(superposition,[status(thm)],[c_15877,c_12693]) ).
cnf(c_17500,plain,
divide(inverse(divide(divide(X0,X1),X2)),divide(X1,X0)) = X2,
inference(demodulation,[status(thm)],[c_17404,c_17088,c_17169]) ).
cnf(c_17854,plain,
divide(divide(divide(X0,X1),inverse(divide(X1,X0))),inverse(X2)) = X2,
inference(superposition,[status(thm)],[c_17088,c_12743]) ).
cnf(c_18046,plain,
inverse(divide(divide(divide(X0,X1),inverse(divide(X1,X0))),X2)) = X2,
inference(superposition,[status(thm)],[c_17500,c_16453]) ).
cnf(c_18657,plain,
divide(divide(X0,inverse(divide(divide(inverse(divide(X1,X2)),divide(X2,X1)),X0))),inverse(X3)) = X3,
inference(superposition,[status(thm)],[c_16453,c_17854]) ).
cnf(c_18845,plain,
inverse(divide(divide(inverse(divide(X0,X1)),divide(X1,X0)),X2)) = X2,
inference(superposition,[status(thm)],[c_17033,c_18046]) ).
cnf(c_18986,plain,
divide(divide(X0,X0),inverse(X1)) = X1,
inference(demodulation,[status(thm)],[c_18657,c_18845]) ).
cnf(c_19257,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_12791,c_18986]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP473-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n005.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 : Mon Aug 28 22:08:23 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.21/0.46 Running UEQ theorem proving
% 0.21/0.46 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
% 46.96/6.65 % SZS status Started for theBenchmark.p
% 46.96/6.65 % SZS status Unsatisfiable for theBenchmark.p
% 46.96/6.65
% 46.96/6.65 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 46.96/6.65
% 46.96/6.65 ------ iProver source info
% 46.96/6.65
% 46.96/6.65 git: date: 2023-05-31 18:12:56 +0000
% 46.96/6.65 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 46.96/6.65 git: non_committed_changes: false
% 46.96/6.65 git: last_make_outside_of_git: false
% 46.96/6.65
% 46.96/6.65 ------ Parsing...successful
% 46.96/6.65
% 46.96/6.65
% 46.96/6.65
% 46.96/6.65 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 46.96/6.65
% 46.96/6.65 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 46.96/6.65
% 46.96/6.65 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 46.96/6.65 ------ Proving...
% 46.96/6.65 ------ Problem Properties
% 46.96/6.65
% 46.96/6.65
% 46.96/6.65 clauses 3
% 46.96/6.65 conjectures 1
% 46.96/6.65 EPR 0
% 46.96/6.65 Horn 3
% 46.96/6.65 unary 3
% 46.96/6.65 binary 0
% 46.96/6.65 lits 3
% 46.96/6.65 lits eq 3
% 46.96/6.65 fd_pure 0
% 46.96/6.65 fd_pseudo 0
% 46.96/6.65 fd_cond 0
% 46.96/6.65 fd_pseudo_cond 0
% 46.96/6.65 AC symbols 0
% 46.96/6.65
% 46.96/6.65 ------ Input Options Time Limit: Unbounded
% 46.96/6.65
% 46.96/6.65
% 46.96/6.65 ------
% 46.96/6.65 Current options:
% 46.96/6.65 ------
% 46.96/6.65
% 46.96/6.65
% 46.96/6.65
% 46.96/6.65
% 46.96/6.65 ------ Proving...
% 46.96/6.65
% 46.96/6.65
% 46.96/6.65 % SZS status Unsatisfiable for theBenchmark.p
% 46.96/6.65
% 46.96/6.65 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 46.96/6.65
% 46.96/6.65
%------------------------------------------------------------------------------