TSTP Solution File: GRP184-4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP184-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:21:39 EDT 2024
% Result : Unsatisfiable 4.31s 1.23s
% Output : CNFRefutation 4.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 6 RR)
% Number of literals : 32 ( 31 equ; 4 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; 2 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
inverse(identity) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21x_1) ).
cnf(c_50,plain,
inverse(inverse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21x_2) ).
cnf(c_51,plain,
multiply(inverse(X0),inverse(X1)) = inverse(multiply(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21x_3) ).
cnf(c_52,plain,
least_upper_bound(inverse(X0),inverse(X1)) = inverse(greatest_lower_bound(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21x_4) ).
cnf(c_54,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_p21x) ).
cnf(c_55,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_56,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_57,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_58,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_63,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_65,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_67,plain,
multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(c_68,plain,
multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(c_89,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_54,c_58,c_56,c_57,c_55]) ).
cnf(c_226,plain,
multiply(X0,inverse(X0)) = identity,
inference(superposition,[status(thm)],[c_50,c_68]) ).
cnf(c_244,plain,
inverse(multiply(identity,X0)) = multiply(inverse(X0),identity),
inference(superposition,[status(thm)],[c_49,c_51]) ).
cnf(c_252,plain,
multiply(inverse(X0),identity) = inverse(X0),
inference(light_normalisation,[status(thm)],[c_244,c_67]) ).
cnf(c_260,plain,
inverse(greatest_lower_bound(identity,X0)) = least_upper_bound(identity,inverse(X0)),
inference(superposition,[status(thm)],[c_49,c_52]) ).
cnf(c_271,plain,
multiply(least_upper_bound(identity,inverse(a)),least_upper_bound(identity,a)) != multiply(least_upper_bound(identity,a),least_upper_bound(identity,inverse(a))),
inference(demodulation,[status(thm)],[c_89,c_260]) ).
cnf(c_297,plain,
multiply(X0,identity) = X0,
inference(superposition,[status(thm)],[c_50,c_252]) ).
cnf(c_429,plain,
least_upper_bound(X0,multiply(X0,X1)) = multiply(X0,least_upper_bound(identity,X1)),
inference(superposition,[status(thm)],[c_297,c_63]) ).
cnf(c_500,plain,
least_upper_bound(X0,multiply(X1,X0)) = multiply(least_upper_bound(identity,X1),X0),
inference(superposition,[status(thm)],[c_67,c_65]) ).
cnf(c_3357,plain,
multiply(inverse(X0),least_upper_bound(identity,X0)) = least_upper_bound(inverse(X0),identity),
inference(superposition,[status(thm)],[c_68,c_429]) ).
cnf(c_3363,plain,
multiply(X0,least_upper_bound(identity,inverse(X0))) = least_upper_bound(X0,identity),
inference(superposition,[status(thm)],[c_226,c_429]) ).
cnf(c_3399,plain,
multiply(inverse(X0),least_upper_bound(identity,X0)) = least_upper_bound(identity,inverse(X0)),
inference(theory_normalisation,[status(thm)],[c_3357,c_57,c_55,c_58,c_56]) ).
cnf(c_4123,plain,
multiply(least_upper_bound(identity,X0),least_upper_bound(identity,inverse(X0))) = least_upper_bound(least_upper_bound(identity,inverse(X0)),least_upper_bound(X0,identity)),
inference(superposition,[status(thm)],[c_3363,c_500]) ).
cnf(c_4168,plain,
multiply(least_upper_bound(identity,X0),least_upper_bound(identity,inverse(X0))) = least_upper_bound(identity,least_upper_bound(X0,least_upper_bound(identity,inverse(X0)))),
inference(theory_normalisation,[status(thm)],[c_4123,c_57,c_55,c_58,c_56]) ).
cnf(c_8548,plain,
multiply(least_upper_bound(identity,inverse(X0)),least_upper_bound(identity,X0)) = least_upper_bound(least_upper_bound(identity,X0),least_upper_bound(identity,inverse(X0))),
inference(superposition,[status(thm)],[c_3399,c_500]) ).
cnf(c_8577,plain,
multiply(least_upper_bound(identity,inverse(X0)),least_upper_bound(identity,X0)) = least_upper_bound(identity,least_upper_bound(X0,least_upper_bound(identity,inverse(X0)))),
inference(theory_normalisation,[status(thm)],[c_8548,c_57,c_55,c_58,c_56]) ).
cnf(c_8578,plain,
multiply(least_upper_bound(identity,inverse(X0)),least_upper_bound(identity,X0)) = multiply(least_upper_bound(identity,X0),least_upper_bound(identity,inverse(X0))),
inference(light_normalisation,[status(thm)],[c_8577,c_4168]) ).
cnf(c_8598,plain,
multiply(least_upper_bound(identity,a),least_upper_bound(identity,inverse(a))) != multiply(least_upper_bound(identity,a),least_upper_bound(identity,inverse(a))),
inference(demodulation,[status(thm)],[c_271,c_8578]) ).
cnf(c_8599,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_8598]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP184-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 23:32:34 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running UEQ theorem proving
% 0.21/0.49 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
% 4.31/1.23 % SZS status Started for theBenchmark.p
% 4.31/1.23 % SZS status Unsatisfiable for theBenchmark.p
% 4.31/1.23
% 4.31/1.23 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.31/1.23
% 4.31/1.23 ------ iProver source info
% 4.31/1.23
% 4.31/1.23 git: date: 2024-05-02 19:28:25 +0000
% 4.31/1.23 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.31/1.23 git: non_committed_changes: false
% 4.31/1.23
% 4.31/1.23 ------ Parsing...successful
% 4.31/1.23
% 4.31/1.23
% 4.31/1.23
% 4.31/1.23 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 4.31/1.23
% 4.31/1.23 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.31/1.23
% 4.31/1.23 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 4.31/1.23 ------ Proving...
% 4.31/1.23 ------ Problem Properties
% 4.31/1.23
% 4.31/1.23
% 4.31/1.23 clauses 21
% 4.31/1.23 conjectures 1
% 4.31/1.23 EPR 0
% 4.31/1.23 Horn 21
% 4.31/1.23 unary 21
% 4.31/1.23 binary 0
% 4.31/1.23 lits 21
% 4.31/1.23 lits eq 21
% 4.31/1.23 fd_pure 0
% 4.31/1.23 fd_pseudo 0
% 4.31/1.23 fd_cond 0
% 4.31/1.24 fd_pseudo_cond 0
% 4.31/1.24 AC symbols 2
% 4.31/1.24
% 4.31/1.24 ------ Input Options Time Limit: Unbounded
% 4.31/1.24
% 4.31/1.24
% 4.31/1.24 ------
% 4.31/1.24 Current options:
% 4.31/1.24 ------
% 4.31/1.24
% 4.31/1.24
% 4.31/1.24
% 4.31/1.24
% 4.31/1.24 ------ Proving...
% 4.31/1.24
% 4.31/1.24
% 4.31/1.24 % SZS status Unsatisfiable for theBenchmark.p
% 4.31/1.24
% 4.31/1.24 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.31/1.24
% 4.31/1.24
%------------------------------------------------------------------------------