TSTP Solution File: GRP560-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP560-1 : TPTP v8.2.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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:48 EDT 2024
% Result : Unsatisfiable 0.47s 1.16s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 3
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 2 RR)
% Number of literals : 24 ( 23 equ; 1 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 : 56 ( 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(a,b) != multiply(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_4) ).
cnf(c_60,plain,
multiply(X0,divide(divide(X1,X2),divide(X0,X2))) = X1,
inference(demodulation,[status(thm)],[c_49,c_50]) ).
cnf(c_99,plain,
multiply(X0,divide(multiply(X1,X2),divide(X0,inverse(X2)))) = X1,
inference(superposition,[status(thm)],[c_50,c_60]) ).
cnf(c_103,plain,
multiply(X0,divide(multiply(X1,X2),multiply(X0,X2))) = X1,
inference(demodulation,[status(thm)],[c_99,c_50]) ).
cnf(c_104,plain,
multiply(X0,divide(X1,multiply(X0,divide(divide(X1,X2),divide(X3,X2))))) = X3,
inference(superposition,[status(thm)],[c_60,c_103]) ).
cnf(c_114,plain,
multiply(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_60,c_104]) ).
cnf(c_127,plain,
multiply(X0,divide(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_114,c_104]) ).
cnf(c_135,plain,
multiply(inverse(X0),multiply(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_50,c_127]) ).
cnf(c_198,plain,
multiply(inverse(divide(divide(X0,X1),divide(X2,X1))),X0) = X2,
inference(superposition,[status(thm)],[c_60,c_135]) ).
cnf(c_252,plain,
inverse(divide(divide(X0,X1),divide(X2,X1))) = multiply(inverse(X0),X2),
inference(superposition,[status(thm)],[c_198,c_135]) ).
cnf(c_254,plain,
multiply(multiply(inverse(X0),X1),X0) = X1,
inference(demodulation,[status(thm)],[c_198,c_252]) ).
cnf(c_421,plain,
multiply(inverse(X0),X0) = divide(X1,X1),
inference(superposition,[status(thm)],[c_114,c_254]) ).
cnf(c_454,plain,
divide(X0,X0) = divide(X1,X1),
inference(superposition,[status(thm)],[c_421,c_421]) ).
cnf(c_497,plain,
multiply(X0,divide(divide(X1,X0),divide(X2,X2))) = X1,
inference(superposition,[status(thm)],[c_454,c_60]) ).
cnf(c_641,plain,
divide(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_497,c_127]) ).
cnf(c_765,plain,
multiply(divide(X0,X0),X1) = X1,
inference(superposition,[status(thm)],[c_641,c_127]) ).
cnf(c_826,plain,
divide(divide(X0,X1),divide(divide(X2,X2),X1)) = X0,
inference(superposition,[status(thm)],[c_765,c_60]) ).
cnf(c_1118,plain,
divide(divide(X0,inverse(X1)),multiply(divide(X2,X2),X1)) = X0,
inference(superposition,[status(thm)],[c_50,c_826]) ).
cnf(c_1153,plain,
divide(multiply(X0,X1),multiply(divide(X2,X2),X1)) = X0,
inference(light_normalisation,[status(thm)],[c_1118,c_50]) ).
cnf(c_1249,plain,
divide(multiply(X0,X1),X1) = X0,
inference(demodulation,[status(thm)],[c_1153,c_765]) ).
cnf(c_1272,plain,
multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_1249,c_127]) ).
cnf(c_1280,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_1272]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP560-1 : TPTP v8.2.0. Bugfixed v2.7.0.
% 0.08/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n027.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 : Thu Jun 20 10:38:54 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running UEQ theorem proving
% 0.20/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
% 0.47/1.16 % SZS status Started for theBenchmark.p
% 0.47/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.16
% 0.47/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.47/1.16
% 0.47/1.16 ------ iProver source info
% 0.47/1.16
% 0.47/1.16 git: date: 2024-06-12 09:56:46 +0000
% 0.47/1.16 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.47/1.16 git: non_committed_changes: false
% 0.47/1.16
% 0.47/1.16 ------ Parsing...successful
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.47/1.16
% 0.47/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.16
% 0.47/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.47/1.16 ------ Proving...
% 0.47/1.16 ------ Problem Properties
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16 clauses 3
% 0.47/1.16 conjectures 1
% 0.47/1.16 EPR 0
% 0.47/1.16 Horn 3
% 0.47/1.16 unary 3
% 0.47/1.16 binary 0
% 0.47/1.16 lits 3
% 0.47/1.16 lits eq 3
% 0.47/1.16 fd_pure 0
% 0.47/1.16 fd_pseudo 0
% 0.47/1.16 fd_cond 0
% 0.47/1.16 fd_pseudo_cond 0
% 0.47/1.16 AC symbols 0
% 0.47/1.16
% 0.47/1.16 ------ Input Options Time Limit: Unbounded
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16 ------
% 0.47/1.16 Current options:
% 0.47/1.16 ------
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16 ------ Proving...
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.16
% 0.47/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.16
% 0.47/1.16
%------------------------------------------------------------------------------