TSTP Solution File: GRP173-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP173-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:05 EDT 2022
% Result : Unsatisfiable 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 12 RR)
% Number of literals : 12 ( 0 equ; 1 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(least_upper_bound(identity,a),identity),
file('GRP173-1.p',unknown),
[] ).
cnf(2,axiom,
equal(least_upper_bound(identity,inverse(a)),identity),
file('GRP173-1.p',unknown),
[] ).
cnf(3,axiom,
~ equal(a,identity),
file('GRP173-1.p',unknown),
[] ).
cnf(4,axiom,
equal(multiply(identity,u),u),
file('GRP173-1.p',unknown),
[] ).
cnf(5,axiom,
equal(multiply(inverse(u),u),identity),
file('GRP173-1.p',unknown),
[] ).
cnf(8,axiom,
equal(least_upper_bound(u,v),least_upper_bound(v,u)),
file('GRP173-1.p',unknown),
[] ).
cnf(17,axiom,
equal(multiply(least_upper_bound(u,v),w),least_upper_bound(multiply(u,w),multiply(v,w))),
file('GRP173-1.p',unknown),
[] ).
cnf(321,plain,
equal(least_upper_bound(multiply(identity,u),multiply(inverse(a),u)),multiply(identity,u)),
inference(spr,[status(thm),theory(equality)],[2,17]),
[iquote('0:SpR:2.0,17.0')] ).
cnf(338,plain,
equal(least_upper_bound(u,multiply(inverse(a),u)),u),
inference(rew,[status(thm),theory(equality)],[4,321]),
[iquote('0:Rew:4.0,321.0')] ).
cnf(361,plain,
equal(least_upper_bound(a,identity),a),
inference(spr,[status(thm),theory(equality)],[5,338]),
[iquote('0:SpR:5.0,338.0')] ).
cnf(364,plain,
equal(a,identity),
inference(rew,[status(thm),theory(equality)],[1,361,8]),
[iquote('0:Rew:1.0,361.0,8.0,361.0')] ).
cnf(365,plain,
$false,
inference(mrr,[status(thm)],[364,3]),
[iquote('0:MRR:364.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP173-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n017.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 18:38:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Proof found.
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 291 clauses, backtracked 0 clauses, performed 0 splits and kept 100 clauses.
% 0.19/0.44 SPASS allocated 63504 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.08 on the problem.
% 0.19/0.44 0:00:00.04 for the input.
% 0.19/0.44 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.02 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Here is a proof with depth 2, length 12 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : p05a_1 p05a_2 prove_p05a left_identity left_inverse symmetry_of_lub monotony_lub2
% 0.19/0.44
%------------------------------------------------------------------------------