TSTP Solution File: GRP604-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP604-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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 : Fri May 3 02:23:03 EDT 2024
% Result : Unsatisfiable 3.53s 1.14s
% Output : CNFRefutation 3.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 3
% Syntax : Number of clauses : 28 ( 28 unt; 0 nHn; 3 RR)
% Number of literals : 28 ( 27 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 : 70 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
inverse(double_divide(inverse(double_divide(X0,inverse(double_divide(X1,double_divide(X0,X2))))),X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
inverse(double_divide(X0,X1)) = multiply(X1,X0),
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,multiply(multiply(double_divide(X1,X0),X2),X1)) = X2,
inference(demodulation,[status(thm)],[c_49,c_50]) ).
cnf(c_97,plain,
multiply(multiply(double_divide(X0,double_divide(X1,X2)),X3),X0) = multiply(X2,multiply(X3,X1)),
inference(superposition,[status(thm)],[c_60,c_60]) ).
cnf(c_101,plain,
multiply(double_divide(X0,X1),multiply(X1,multiply(X2,X0))) = X2,
inference(superposition,[status(thm)],[c_97,c_60]) ).
cnf(c_106,plain,
multiply(double_divide(multiply(multiply(double_divide(X0,X1),X2),X0),X3),multiply(X3,X2)) = X1,
inference(superposition,[status(thm)],[c_60,c_101]) ).
cnf(c_110,plain,
multiply(double_divide(multiply(X0,multiply(X1,X2)),X3),multiply(X3,X1)) = double_divide(X2,X0),
inference(superposition,[status(thm)],[c_101,c_101]) ).
cnf(c_189,plain,
double_divide(X0,multiply(double_divide(multiply(X1,X0),X2),X1)) = X2,
inference(superposition,[status(thm)],[c_110,c_106]) ).
cnf(c_213,plain,
double_divide(multiply(X0,X1),double_divide(X1,multiply(X2,X0))) = X2,
inference(superposition,[status(thm)],[c_110,c_189]) ).
cnf(c_261,plain,
multiply(double_divide(X0,multiply(X1,X2)),multiply(X2,X0)) = inverse(X1),
inference(superposition,[status(thm)],[c_213,c_50]) ).
cnf(c_356,plain,
multiply(double_divide(X0,double_divide(X0,multiply(X1,X2))),inverse(X1)) = X2,
inference(superposition,[status(thm)],[c_261,c_101]) ).
cnf(c_524,plain,
double_divide(multiply(inverse(X0),X1),multiply(X0,X2)) = double_divide(X1,X2),
inference(superposition,[status(thm)],[c_356,c_189]) ).
cnf(c_581,plain,
double_divide(X0,multiply(double_divide(X0,X1),inverse(X2))) = multiply(X2,X1),
inference(superposition,[status(thm)],[c_524,c_189]) ).
cnf(c_615,plain,
multiply(X0,double_divide(X1,multiply(X0,X2))) = double_divide(X1,X2),
inference(superposition,[status(thm)],[c_356,c_581]) ).
cnf(c_650,plain,
multiply(double_divide(multiply(X0,X1),X2),X2) = double_divide(X1,X0),
inference(superposition,[status(thm)],[c_189,c_615]) ).
cnf(c_1015,plain,
double_divide(multiply(X0,X1),double_divide(X1,multiply(X2,X0))) = multiply(double_divide(inverse(X2),X3),X3),
inference(superposition,[status(thm)],[c_261,c_650]) ).
cnf(c_1046,plain,
double_divide(X0,double_divide(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_650,c_189]) ).
cnf(c_1049,plain,
inverse(multiply(X0,X1)) = double_divide(X1,X0),
inference(superposition,[status(thm)],[c_650,c_261]) ).
cnf(c_1051,plain,
multiply(double_divide(inverse(X0),X1),X1) = X0,
inference(light_normalisation,[status(thm)],[c_1015,c_213]) ).
cnf(c_1249,plain,
multiply(double_divide(X0,X1),multiply(X1,X2)) = double_divide(inverse(X2),X0),
inference(superposition,[status(thm)],[c_1051,c_101]) ).
cnf(c_1258,plain,
double_divide(inverse(multiply(X0,X1)),X1) = X0,
inference(demodulation,[status(thm)],[c_101,c_1249]) ).
cnf(c_1259,plain,
double_divide(double_divide(X0,X1),X0) = X1,
inference(light_normalisation,[status(thm)],[c_1258,c_1049]) ).
cnf(c_1279,plain,
double_divide(X0,X1) = double_divide(X1,X0),
inference(superposition,[status(thm)],[c_1046,c_1259]) ).
cnf(c_1300,plain,
inverse(double_divide(X0,X1)) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_1279,c_50]) ).
cnf(c_1336,plain,
multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_1300,c_50]) ).
cnf(c_1339,plain,
multiply(a,b) != multiply(a,b),
inference(demodulation,[status(thm)],[c_51,c_1336]) ).
cnf(c_1340,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_1339]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP604-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.04/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n018.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 : Fri May 3 00:14:46 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running UEQ theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.53/1.14 % SZS status Started for theBenchmark.p
% 3.53/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 3.53/1.14
% 3.53/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.53/1.14
% 3.53/1.14 ------ iProver source info
% 3.53/1.14
% 3.53/1.14 git: date: 2024-05-02 19:28:25 +0000
% 3.53/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.53/1.14 git: non_committed_changes: false
% 3.53/1.14
% 3.53/1.14 ------ Parsing...successful
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.53/1.14
% 3.53/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.53/1.14
% 3.53/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.53/1.14 ------ Proving...
% 3.53/1.14 ------ Problem Properties
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14 clauses 3
% 3.53/1.14 conjectures 1
% 3.53/1.14 EPR 0
% 3.53/1.14 Horn 3
% 3.53/1.14 unary 3
% 3.53/1.14 binary 0
% 3.53/1.14 lits 3
% 3.53/1.14 lits eq 3
% 3.53/1.14 fd_pure 0
% 3.53/1.14 fd_pseudo 0
% 3.53/1.14 fd_cond 0
% 3.53/1.14 fd_pseudo_cond 0
% 3.53/1.14 AC symbols 0
% 3.53/1.14
% 3.53/1.14 ------ Input Options Time Limit: Unbounded
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14 ------
% 3.53/1.14 Current options:
% 3.53/1.14 ------
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14 ------ Proving...
% 3.53/1.14
% 3.53/1.14
% 3.53/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 3.53/1.14
% 3.53/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.53/1.14
% 3.53/1.14
%------------------------------------------------------------------------------