TSTP Solution File: GRP523-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP523-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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 : Mon Jun 24 07:00:42 EDT 2024
% Result : Unsatisfiable 2.35s 1.18s
% Output : CNFRefutation 2.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 4 RR)
% Number of literals : 37 ( 36 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(X0,divide(X1,divide(X2,divide(X0,X1)))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
divide(X0,divide(divide(X1,X1),X2)) = multiply(X0,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_51,plain,
divide(divide(X0,X0),X1) = inverse(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(c_52,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_64,plain,
divide(X0,inverse(X1)) = multiply(X0,X1),
inference(demodulation,[status(thm)],[c_50,c_51]) ).
cnf(c_105,plain,
divide(inverse(divide(X0,X0)),X1) = inverse(X1),
inference(superposition,[status(thm)],[c_51,c_51]) ).
cnf(c_110,plain,
multiply(divide(X0,X0),X1) = inverse(inverse(X1)),
inference(superposition,[status(thm)],[c_64,c_51]) ).
cnf(c_119,plain,
multiply(inverse(divide(X0,X0)),X1) = inverse(inverse(X1)),
inference(superposition,[status(thm)],[c_105,c_64]) ).
cnf(c_206,plain,
divide(X0,divide(divide(X1,divide(X2,X0)),X1)) = X2,
inference(superposition,[status(thm)],[c_49,c_49]) ).
cnf(c_290,plain,
divide(X0,inverse(divide(X1,X0))) = X1,
inference(superposition,[status(thm)],[c_51,c_206]) ).
cnf(c_307,plain,
divide(divide(X0,divide(X1,X2)),divide(X0,X1)) = X2,
inference(superposition,[status(thm)],[c_206,c_49]) ).
cnf(c_403,plain,
multiply(X0,divide(X1,X0)) = X1,
inference(demodulation,[status(thm)],[c_290,c_64]) ).
cnf(c_408,plain,
multiply(X0,inverse(X0)) = divide(X1,X1),
inference(superposition,[status(thm)],[c_51,c_403]) ).
cnf(c_409,plain,
multiply(inverse(X0),multiply(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_64,c_403]) ).
cnf(c_476,plain,
divide(X0,X0) = divide(X1,X1),
inference(superposition,[status(thm)],[c_408,c_408]) ).
cnf(c_634,plain,
multiply(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_476,c_403]) ).
cnf(c_712,plain,
inverse(inverse(multiply(X0,divide(X1,X1)))) = X0,
inference(superposition,[status(thm)],[c_409,c_119]) ).
cnf(c_714,plain,
inverse(inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_712,c_634]) ).
cnf(c_717,plain,
multiply(divide(X0,X0),X1) = X1,
inference(demodulation,[status(thm)],[c_110,c_714]) ).
cnf(c_757,plain,
divide(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_717,c_403]) ).
cnf(c_790,plain,
divide(X0,divide(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_757,c_49]) ).
cnf(c_850,plain,
divide(X0,multiply(X0,X1)) = inverse(X1),
inference(superposition,[status(thm)],[c_64,c_790]) ).
cnf(c_866,plain,
multiply(divide(X0,X1),X1) = X0,
inference(superposition,[status(thm)],[c_790,c_403]) ).
cnf(c_894,plain,
multiply(inverse(X0),X1) = divide(X1,X0),
inference(superposition,[status(thm)],[c_866,c_409]) ).
cnf(c_898,plain,
divide(multiply(X0,X1),X1) = X0,
inference(demodulation,[status(thm)],[c_409,c_894]) ).
cnf(c_910,plain,
multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_898,c_403]) ).
cnf(c_914,plain,
multiply(a3,multiply(b3,c3)) != multiply(c3,multiply(a3,b3)),
inference(demodulation,[status(thm)],[c_52,c_910]) ).
cnf(c_1007,plain,
inverse(divide(X0,X1)) = divide(X1,X0),
inference(superposition,[status(thm)],[c_403,c_850]) ).
cnf(c_1054,plain,
divide(X0,divide(X1,X2)) = multiply(divide(X0,X1),X2),
inference(superposition,[status(thm)],[c_307,c_403]) ).
cnf(c_1195,plain,
divide(X0,inverse(X1)) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_714,c_894]) ).
cnf(c_1235,plain,
divide(inverse(X0),X1) = inverse(multiply(X0,X1)),
inference(superposition,[status(thm)],[c_1195,c_1007]) ).
cnf(c_1334,plain,
divide(X0,divide(inverse(X1),X2)) = multiply(X0,multiply(X1,X2)),
inference(superposition,[status(thm)],[c_1235,c_64]) ).
cnf(c_1440,plain,
divide(X0,divide(X1,X2)) = multiply(X2,divide(X0,X1)),
inference(superposition,[status(thm)],[c_1054,c_910]) ).
cnf(c_1929,plain,
divide(X0,divide(inverse(X1),X2)) = multiply(X2,multiply(X0,X1)),
inference(superposition,[status(thm)],[c_64,c_1440]) ).
cnf(c_2174,plain,
multiply(X0,multiply(X1,X2)) = multiply(X1,multiply(X2,X0)),
inference(superposition,[status(thm)],[c_1929,c_1334]) ).
cnf(c_2192,plain,
multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(b3,c3)),
inference(demodulation,[status(thm)],[c_914,c_2174]) ).
cnf(c_2193,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_2192]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP523-1 : TPTP v8.2.0. Released v2.6.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.12/0.35 % Computer : n029.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Thu Jun 20 12:43:39 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.22/0.49 Running UEQ theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_j12_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.35/1.18 % SZS status Started for theBenchmark.p
% 2.35/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.35/1.18
% 2.35/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.35/1.18
% 2.35/1.18 ------ iProver source info
% 2.35/1.18
% 2.35/1.18 git: date: 2024-06-12 09:56:46 +0000
% 2.35/1.18 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 2.35/1.18 git: non_committed_changes: false
% 2.35/1.18
% 2.35/1.18 ------ Parsing...successful
% 2.35/1.18
% 2.35/1.18
% 2.35/1.18
% 2.35/1.18 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 2.35/1.18
% 2.35/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.35/1.18
% 2.35/1.18 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.35/1.18 ------ Proving...
% 2.35/1.18 ------ Problem Properties
% 2.35/1.18
% 2.35/1.18
% 2.35/1.18 clauses 4
% 2.35/1.18 conjectures 1
% 2.35/1.18 EPR 0
% 2.35/1.18 Horn 4
% 2.35/1.18 unary 4
% 2.35/1.18 binary 0
% 2.35/1.18 lits 4
% 2.35/1.18 lits eq 4
% 2.35/1.18 fd_pure 0
% 2.35/1.18 fd_pseudo 0
% 2.35/1.18 fd_cond 0
% 2.35/1.18 fd_pseudo_cond 0
% 2.35/1.18 AC symbols 0
% 2.35/1.18
% 2.35/1.18 ------ Input Options Time Limit: Unbounded
% 2.35/1.18
% 2.35/1.18
% 2.35/1.18 ------
% 2.35/1.18 Current options:
% 2.35/1.18 ------
% 2.35/1.18
% 2.35/1.18
% 2.35/1.18
% 2.35/1.18
% 2.35/1.18 ------ Proving...
% 2.35/1.18
% 2.35/1.18
% 2.35/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.35/1.18
% 2.35/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.35/1.18
% 2.35/1.18
%------------------------------------------------------------------------------