TSTP Solution File: GRP169-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP169-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n006.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 : 600s
% DateTime : Sat Jul 16 11:46:03 EDT 2022
% Result : Unsatisfiable 0.98s 1.16s
% Output : Refutation 0.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 21 RR)
% Number of literals : 21 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(least_upper_bound(inverse(a),inverse(b)),inverse(b)),
file('GRP169-1.p',unknown),
[] ).
cnf(2,axiom,
~ equal(least_upper_bound(a,b),a),
file('GRP169-1.p',unknown),
[] ).
cnf(3,axiom,
equal(multiply(identity,u),u),
file('GRP169-1.p',unknown),
[] ).
cnf(4,axiom,
equal(multiply(inverse(u),u),identity),
file('GRP169-1.p',unknown),
[] ).
cnf(5,axiom,
equal(multiply(multiply(u,v),w),multiply(u,multiply(v,w))),
file('GRP169-1.p',unknown),
[] ).
cnf(7,axiom,
equal(least_upper_bound(u,v),least_upper_bound(v,u)),
file('GRP169-1.p',unknown),
[] ).
cnf(14,axiom,
equal(multiply(u,least_upper_bound(v,w)),least_upper_bound(multiply(u,v),multiply(u,w))),
file('GRP169-1.p',unknown),
[] ).
cnf(16,axiom,
equal(multiply(least_upper_bound(u,v),w),least_upper_bound(multiply(u,w),multiply(v,w))),
file('GRP169-1.p',unknown),
[] ).
cnf(335,plain,
equal(multiply(inverse(u),multiply(u,v)),multiply(identity,v)),
inference(spr,[status(thm),theory(equality)],[4,5]),
[iquote('0:SpR:4.0,5.0')] ).
cnf(336,plain,
equal(multiply(inverse(u),multiply(u,v)),v),
inference(rew,[status(thm),theory(equality)],[3,335]),
[iquote('0:Rew:3.0,335.0')] ).
cnf(339,plain,
equal(multiply(inverse(inverse(u)),v),multiply(u,v)),
inference(spr,[status(thm),theory(equality)],[336]),
[iquote('0:SpR:336.0,336.0')] ).
cnf(342,plain,
equal(multiply(inverse(inverse(u)),identity),u),
inference(spr,[status(thm),theory(equality)],[4,336]),
[iquote('0:SpR:4.0,336.0')] ).
cnf(344,plain,
equal(multiply(u,identity),u),
inference(rew,[status(thm),theory(equality)],[339,342]),
[iquote('0:Rew:339.0,342.0')] ).
cnf(363,plain,
equal(multiply(u,multiply(inverse(u),v)),v),
inference(spr,[status(thm),theory(equality)],[339,336]),
[iquote('0:SpR:339.0,336.0')] ).
cnf(465,plain,
equal(least_upper_bound(multiply(inverse(a),u),multiply(inverse(b),u)),multiply(inverse(b),u)),
inference(spr,[status(thm),theory(equality)],[1,16]),
[iquote('0:SpR:1.0,16.0')] ).
cnf(6573,plain,
equal(least_upper_bound(multiply(inverse(a),b),identity),identity),
inference(spr,[status(thm),theory(equality)],[4,465]),
[iquote('0:SpR:4.0,465.0')] ).
cnf(6597,plain,
equal(least_upper_bound(identity,multiply(inverse(a),b)),identity),
inference(rew,[status(thm),theory(equality)],[7,6573]),
[iquote('0:Rew:7.0,6573.0')] ).
cnf(6654,plain,
equal(least_upper_bound(multiply(u,identity),multiply(u,multiply(inverse(a),b))),multiply(u,identity)),
inference(spr,[status(thm),theory(equality)],[6597,14]),
[iquote('0:SpR:6597.0,14.0')] ).
cnf(6673,plain,
equal(least_upper_bound(u,multiply(u,multiply(inverse(a),b))),u),
inference(rew,[status(thm),theory(equality)],[344,6654]),
[iquote('0:Rew:344.0,6654.0')] ).
cnf(6795,plain,
equal(least_upper_bound(a,b),a),
inference(spr,[status(thm),theory(equality)],[363,6673]),
[iquote('0:SpR:363.0,6673.0')] ).
cnf(6798,plain,
$false,
inference(mrr,[status(thm)],[6795,2]),
[iquote('0:MRR:6795.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP169-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 15:31:42 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.98/1.16
% 0.98/1.16 SPASS V 3.9
% 0.98/1.16 SPASS beiseite: Proof found.
% 0.98/1.16 % SZS status Theorem
% 0.98/1.16 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.98/1.16 SPASS derived 4487 clauses, backtracked 0 clauses, performed 0 splits and kept 621 clauses.
% 0.98/1.16 SPASS allocated 68637 KBytes.
% 0.98/1.16 SPASS spent 0:00:00.79 on the problem.
% 0.98/1.16 0:00:00.04 for the input.
% 0.98/1.16 0:00:00.00 for the FLOTTER CNF translation.
% 0.98/1.16 0:00:00.03 for inferences.
% 0.98/1.16 0:00:00.00 for the backtracking.
% 0.98/1.16 0:00:00.69 for the reduction.
% 0.98/1.16
% 0.98/1.16
% 0.98/1.16 Here is a proof with depth 4, length 21 :
% 0.98/1.16 % SZS output start Refutation
% See solution above
% 0.98/1.16 Formulae used in the proof : p02a_1 prove_p02a left_identity left_inverse associativity symmetry_of_lub monotony_lub1 monotony_lub2
% 0.98/1.16
%------------------------------------------------------------------------------