TSTP Solution File: GRP558-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP558-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:47 EDT 2024
% Result : Unsatisfiable 1.98s 1.19s
% Output : CNFRefutation 1.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 4 RR)
% Number of literals : 16 ( 15 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(X0,inverse(divide(divide(X1,X2),divide(X0,X2)))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
divide(X0,inverse(X1)) = multiply(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_51,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(c_60,plain,
multiply(X0,divide(divide(X1,X2),divide(X0,X2))) = X1,
inference(demodulation,[status(thm)],[c_49,c_50]) ).
cnf(c_106,plain,
multiply(X0,divide(multiply(X1,X2),divide(X0,inverse(X2)))) = X1,
inference(superposition,[status(thm)],[c_50,c_60]) ).
cnf(c_110,plain,
multiply(X0,divide(multiply(X1,X2),multiply(X0,X2))) = X1,
inference(demodulation,[status(thm)],[c_106,c_50]) ).
cnf(c_111,plain,
multiply(X0,divide(X1,multiply(X0,divide(divide(X1,X2),divide(X3,X2))))) = X3,
inference(superposition,[status(thm)],[c_60,c_110]) ).
cnf(c_121,plain,
multiply(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_60,c_111]) ).
cnf(c_134,plain,
multiply(X0,divide(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_121,c_111]) ).
cnf(c_146,plain,
multiply(inverse(X0),multiply(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_50,c_134]) ).
cnf(c_209,plain,
multiply(inverse(divide(X0,X1)),X0) = X1,
inference(superposition,[status(thm)],[c_134,c_146]) ).
cnf(c_364,plain,
inverse(divide(divide(X0,X0),X1)) = X1,
inference(superposition,[status(thm)],[c_209,c_121]) ).
cnf(c_366,plain,
inverse(divide(X0,X1)) = multiply(inverse(X0),X1),
inference(superposition,[status(thm)],[c_209,c_146]) ).
cnf(c_372,plain,
multiply(inverse(divide(b2,b2)),a2) != a2,
inference(demodulation,[status(thm)],[c_51,c_366]) ).
cnf(c_387,plain,
a2 != a2,
inference(demodulation,[status(thm)],[c_372,c_364,c_366]) ).
cnf(c_388,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_387]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP558-1 : TPTP v8.2.0. Released v2.6.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n022.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 : Thu Jun 20 09:10:09 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.21/0.48 Running UEQ theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_j12_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.98/1.19 % SZS status Started for theBenchmark.p
% 1.98/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 1.98/1.19
% 1.98/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.98/1.19
% 1.98/1.19 ------ iProver source info
% 1.98/1.19
% 1.98/1.19 git: date: 2024-06-12 09:56:46 +0000
% 1.98/1.19 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 1.98/1.19 git: non_committed_changes: false
% 1.98/1.19
% 1.98/1.19 ------ Parsing...successful
% 1.98/1.19
% 1.98/1.19
% 1.98/1.19
% 1.98/1.19 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 1.98/1.19
% 1.98/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.98/1.19
% 1.98/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.98/1.19 ------ Proving...
% 1.98/1.19 ------ Problem Properties
% 1.98/1.19
% 1.98/1.19
% 1.98/1.19 clauses 3
% 1.98/1.19 conjectures 1
% 1.98/1.19 EPR 0
% 1.98/1.19 Horn 3
% 1.98/1.19 unary 3
% 1.98/1.19 binary 0
% 1.98/1.19 lits 3
% 1.98/1.19 lits eq 3
% 1.98/1.19 fd_pure 0
% 1.98/1.19 fd_pseudo 0
% 1.98/1.19 fd_cond 0
% 1.98/1.19 fd_pseudo_cond 0
% 1.98/1.19 AC symbols 0
% 1.98/1.19
% 1.98/1.19 ------ Input Options Time Limit: Unbounded
% 1.98/1.19
% 1.98/1.19
% 1.98/1.19 ------
% 1.98/1.19 Current options:
% 1.98/1.19 ------
% 1.98/1.19
% 1.98/1.19
% 1.98/1.19
% 1.98/1.19
% 1.98/1.19 ------ Proving...
% 1.98/1.19
% 1.98/1.19
% 1.98/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 1.98/1.19
% 1.98/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.98/1.19
% 1.98/1.19
%------------------------------------------------------------------------------