TSTP Solution File: GRP184-2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP184-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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 00:58:33 EDT 2023
% Result : Unsatisfiable 246.63s 32.20s
% Output : CNFRefutation 246.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of clauses : 39 ( 39 unt; 0 nHn; 5 RR)
% Number of literals : 39 ( 38 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
inverse(identity) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21_1) ).
cnf(c_50,plain,
inverse(inverse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21_2) ).
cnf(c_51,plain,
multiply(inverse(X0),inverse(X1)) = inverse(multiply(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21_3) ).
cnf(c_52,negated_conjecture,
multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity)) != multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p21) ).
cnf(c_53,plain,
greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(c_54,plain,
least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
cnf(c_55,plain,
greatest_lower_bound(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(X0,greatest_lower_bound(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
cnf(c_56,plain,
least_upper_bound(least_upper_bound(X0,X1),X2) = least_upper_bound(X0,least_upper_bound(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
cnf(c_61,plain,
least_upper_bound(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,least_upper_bound(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(c_62,plain,
greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,greatest_lower_bound(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
cnf(c_63,plain,
least_upper_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(least_upper_bound(X0,X2),X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
cnf(c_64,plain,
greatest_lower_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(greatest_lower_bound(X0,X2),X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(c_65,plain,
multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(c_66,plain,
multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(c_85,negated_conjecture,
multiply(inverse(greatest_lower_bound(identity,a)),least_upper_bound(identity,a)) != multiply(least_upper_bound(identity,a),inverse(greatest_lower_bound(identity,a))),
inference(theory_normalisation,[status(thm)],[c_52,c_55,c_53,c_56,c_54]) ).
cnf(c_497459,plain,
multiply(X0,inverse(X0)) = identity,
inference(superposition,[status(thm)],[c_50,c_66]) ).
cnf(c_497478,plain,
inverse(multiply(X0,inverse(X1))) = multiply(X1,inverse(X0)),
inference(superposition,[status(thm)],[c_50,c_51]) ).
cnf(c_497479,plain,
inverse(multiply(identity,X0)) = multiply(inverse(X0),identity),
inference(superposition,[status(thm)],[c_49,c_51]) ).
cnf(c_497480,plain,
inverse(multiply(inverse(X0),X1)) = multiply(inverse(X1),X0),
inference(superposition,[status(thm)],[c_50,c_51]) ).
cnf(c_497484,plain,
multiply(inverse(X0),identity) = inverse(X0),
inference(light_normalisation,[status(thm)],[c_497479,c_65]) ).
cnf(c_497577,plain,
least_upper_bound(multiply(X0,X1),X1) = multiply(least_upper_bound(X0,identity),X1),
inference(superposition,[status(thm)],[c_65,c_63]) ).
cnf(c_497591,plain,
least_upper_bound(X0,multiply(X1,X0)) = multiply(least_upper_bound(X1,identity),X0),
inference(theory_normalisation,[status(thm)],[c_497577,c_56,c_54,c_55,c_53]) ).
cnf(c_497597,plain,
multiply(X0,identity) = X0,
inference(superposition,[status(thm)],[c_50,c_497484]) ).
cnf(c_497612,plain,
greatest_lower_bound(X0,multiply(X1,X0)) = multiply(greatest_lower_bound(identity,X1),X0),
inference(superposition,[status(thm)],[c_65,c_64]) ).
cnf(c_497639,plain,
greatest_lower_bound(X0,multiply(X0,X1)) = multiply(X0,greatest_lower_bound(identity,X1)),
inference(superposition,[status(thm)],[c_497597,c_62]) ).
cnf(c_497640,plain,
least_upper_bound(X0,multiply(X0,X1)) = multiply(X0,least_upper_bound(identity,X1)),
inference(superposition,[status(thm)],[c_497597,c_61]) ).
cnf(c_498397,plain,
multiply(greatest_lower_bound(identity,inverse(X0)),X0) = greatest_lower_bound(X0,identity),
inference(superposition,[status(thm)],[c_66,c_497612]) ).
cnf(c_498442,plain,
multiply(X0,inverse(greatest_lower_bound(identity,inverse(inverse(X0))))) = inverse(greatest_lower_bound(inverse(X0),identity)),
inference(superposition,[status(thm)],[c_498397,c_497478]) ).
cnf(c_498448,plain,
multiply(X0,inverse(greatest_lower_bound(identity,inverse(inverse(X0))))) = inverse(greatest_lower_bound(identity,inverse(X0))),
inference(theory_normalisation,[status(thm)],[c_498442,c_56,c_54,c_55,c_53]) ).
cnf(c_498449,plain,
multiply(X0,inverse(greatest_lower_bound(identity,X0))) = inverse(greatest_lower_bound(identity,inverse(X0))),
inference(light_normalisation,[status(thm)],[c_498448,c_50]) ).
cnf(c_498619,plain,
multiply(X0,greatest_lower_bound(identity,inverse(X0))) = greatest_lower_bound(X0,identity),
inference(superposition,[status(thm)],[c_497459,c_497639]) ).
cnf(c_498861,plain,
multiply(inverse(greatest_lower_bound(identity,inverse(inverse(X0)))),X0) = inverse(greatest_lower_bound(inverse(X0),identity)),
inference(superposition,[status(thm)],[c_498619,c_497480]) ).
cnf(c_498865,plain,
multiply(inverse(greatest_lower_bound(identity,inverse(inverse(X0)))),X0) = inverse(greatest_lower_bound(identity,inverse(X0))),
inference(theory_normalisation,[status(thm)],[c_498861,c_56,c_54,c_55,c_53]) ).
cnf(c_498866,plain,
multiply(inverse(greatest_lower_bound(identity,X0)),X0) = inverse(greatest_lower_bound(identity,inverse(X0))),
inference(light_normalisation,[status(thm)],[c_498865,c_50]) ).
cnf(c_883208,plain,
least_upper_bound(inverse(greatest_lower_bound(identity,X0)),inverse(greatest_lower_bound(identity,inverse(X0)))) = multiply(least_upper_bound(X0,identity),inverse(greatest_lower_bound(identity,X0))),
inference(superposition,[status(thm)],[c_498449,c_497591]) ).
cnf(c_897959,plain,
least_upper_bound(inverse(greatest_lower_bound(identity,X0)),inverse(greatest_lower_bound(identity,inverse(X0)))) = multiply(inverse(greatest_lower_bound(identity,X0)),least_upper_bound(identity,X0)),
inference(superposition,[status(thm)],[c_498866,c_497640]) ).
cnf(c_898030,plain,
multiply(inverse(greatest_lower_bound(identity,X0)),least_upper_bound(identity,X0)) = multiply(least_upper_bound(X0,identity),inverse(greatest_lower_bound(identity,X0))),
inference(light_normalisation,[status(thm)],[c_897959,c_883208]) ).
cnf(c_898075,plain,
multiply(least_upper_bound(identity,a),inverse(greatest_lower_bound(identity,a))) != multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(identity,a))),
inference(demodulation,[status(thm)],[c_85,c_898030]) ).
cnf(c_898076,plain,
$false,
inference(theory_normalisation,[status(thm)],[c_898075,c_56,c_54,c_55,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP184-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.10/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Aug 28 20:37:44 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.46 Running UEQ theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 246.63/32.20 % SZS status Started for theBenchmark.p
% 246.63/32.20 % SZS status Unsatisfiable for theBenchmark.p
% 246.63/32.20
% 246.63/32.20 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 246.63/32.20
% 246.63/32.20 ------ iProver source info
% 246.63/32.20
% 246.63/32.20 git: date: 2023-05-31 18:12:56 +0000
% 246.63/32.20 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 246.63/32.20 git: non_committed_changes: false
% 246.63/32.20 git: last_make_outside_of_git: false
% 246.63/32.20
% 246.63/32.20 ------ Parsing...successful
% 246.63/32.20
% 246.63/32.20
% 246.63/32.20
% 246.63/32.20 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 246.63/32.20
% 246.63/32.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 246.63/32.20
% 246.63/32.20 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 246.63/32.20 ------ Proving...
% 246.63/32.20 ------ Problem Properties
% 246.63/32.20
% 246.63/32.20
% 246.63/32.20 clauses 19
% 246.63/32.20 conjectures 1
% 246.63/32.20 EPR 0
% 246.63/32.20 Horn 19
% 246.63/32.20 unary 19
% 246.63/32.20 binary 0
% 246.63/32.20 lits 19
% 246.63/32.20 lits eq 19
% 246.63/32.20 fd_pure 0
% 246.63/32.20 fd_pseudo 0
% 246.63/32.20 fd_cond 0
% 246.63/32.20 fd_pseudo_cond 0
% 246.63/32.20 AC symbols 2
% 246.63/32.20
% 246.63/32.20 ------ Input Options Time Limit: Unbounded
% 246.63/32.20
% 246.63/32.20
% 246.63/32.20 ------
% 246.63/32.20 Current options:
% 246.63/32.20 ------
% 246.63/32.20
% 246.63/32.20
% 246.63/32.20
% 246.63/32.20
% 246.63/32.20 ------ Proving...
% 246.63/32.20
% 246.63/32.20
% 246.63/32.20 % SZS status Unsatisfiable for theBenchmark.p
% 246.63/32.20
% 246.63/32.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 246.63/32.20
% 246.63/32.21
%------------------------------------------------------------------------------