TSTP Solution File: GRP186-4 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP186-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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:13 EDT 2022
% Result : Unsatisfiable 0.19s 0.41s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 10 RR)
% Number of literals : 10 ( 0 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 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(2,axiom,
equal(inverse(inverse(u)),u),
file('GRP186-4.p',unknown),
[] ).
cnf(4,axiom,
~ equal(multiply(a,least_upper_bound(inverse(a),b)),least_upper_bound(multiply(a,b),identity)),
file('GRP186-4.p',unknown),
[] ).
cnf(6,axiom,
equal(multiply(inverse(u),u),identity),
file('GRP186-4.p',unknown),
[] ).
cnf(9,axiom,
equal(least_upper_bound(u,v),least_upper_bound(v,u)),
file('GRP186-4.p',unknown),
[] ).
cnf(16,axiom,
equal(multiply(u,least_upper_bound(v,w)),least_upper_bound(multiply(u,v),multiply(u,w))),
file('GRP186-4.p',unknown),
[] ).
cnf(20,plain,
~ equal(least_upper_bound(multiply(a,b),multiply(a,inverse(a))),least_upper_bound(identity,multiply(a,b))),
inference(rew,[status(thm),theory(equality)],[16,4,9]),
[iquote('0:Rew:16.0,4.0,9.0,4.0,9.0,4.0')] ).
cnf(30,plain,
equal(multiply(u,inverse(u)),identity),
inference(spr,[status(thm),theory(equality)],[2,6]),
[iquote('0:SpR:2.0,6.0')] ).
cnf(31,plain,
~ equal(least_upper_bound(multiply(a,b),identity),least_upper_bound(identity,multiply(a,b))),
inference(rew,[status(thm),theory(equality)],[30,20]),
[iquote('0:Rew:30.0,20.0')] ).
cnf(32,plain,
~ equal(least_upper_bound(identity,multiply(a,b)),least_upper_bound(identity,multiply(a,b))),
inference(rew,[status(thm),theory(equality)],[9,31]),
[iquote('0:Rew:9.0,31.0')] ).
cnf(33,plain,
$false,
inference(obv,[status(thm),theory(equality)],[32]),
[iquote('0:Obv:32.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP186-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 11:07:21 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.41
% 0.19/0.41 SPASS V 3.9
% 0.19/0.41 SPASS beiseite: Proof found.
% 0.19/0.41 % SZS status Theorem
% 0.19/0.41 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.41 SPASS derived 11 clauses, backtracked 0 clauses, performed 0 splits and kept 21 clauses.
% 0.19/0.41 SPASS allocated 63118 KBytes.
% 0.19/0.41 SPASS spent 0:00:00.06 on the problem.
% 0.19/0.41 0:00:00.03 for the input.
% 0.19/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.41 0:00:00.00 for inferences.
% 0.19/0.41 0:00:00.00 for the backtracking.
% 0.19/0.41 0:00:00.00 for the reduction.
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Here is a proof with depth 1, length 10 :
% 0.19/0.41 % SZS output start Refutation
% See solution above
% 0.19/0.41 Formulae used in the proof : p23x_2 prove_p23x left_inverse symmetry_of_lub monotony_lub1
% 0.19/0.41
%------------------------------------------------------------------------------