TSTP Solution File: FLD031-5 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : FLD031-5 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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 02:28:24 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 19 ( 9 unt; 2 nHn; 19 RR)
% Number of literals : 34 ( 0 equ; 19 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
defined(a),
file('FLD031-5.p',unknown),
[] ).
cnf(2,axiom,
product(multiplicative_identity,a,multiplicative_identity),
file('FLD031-5.p',unknown),
[] ).
cnf(3,axiom,
~ sum__dfg(additive_identity,a,additive_identity),
file('FLD031-5.p',unknown),
[] ).
cnf(4,axiom,
~ product(multiplicative_identity,multiplicative_identity,multiplicative_inverse(a)),
file('FLD031-5.p',unknown),
[] ).
cnf(10,axiom,
( ~ product(u,v,w)
| ~ product(x,v,y)
| ~ product(z,x,u)
| product(z,y,w) ),
file('FLD031-5.p',unknown),
[] ).
cnf(12,axiom,
( ~ defined(u)
| product(multiplicative_identity,u,u) ),
file('FLD031-5.p',unknown),
[] ).
cnf(13,axiom,
( ~ defined(u)
| sum__dfg(additive_identity,u,additive_identity)
| product(multiplicative_inverse(u),u,multiplicative_identity) ),
file('FLD031-5.p',unknown),
[] ).
cnf(14,axiom,
( ~ product(u,v,w)
| product(v,u,w) ),
file('FLD031-5.p',unknown),
[] ).
cnf(22,axiom,
( ~ defined(u)
| defined(multiplicative_inverse(u))
| sum__dfg(additive_identity,u,additive_identity) ),
file('FLD031-5.p',unknown),
[] ).
cnf(44,plain,
( ~ defined(a)
| product(multiplicative_inverse(a),a,multiplicative_identity) ),
inference(res,[status(thm),theory(equality)],[13,3]),
[iquote('0:Res:13.2,3.0')] ).
cnf(45,plain,
( ~ defined(a)
| defined(multiplicative_inverse(a)) ),
inference(res,[status(thm),theory(equality)],[22,3]),
[iquote('0:Res:22.2,3.0')] ).
cnf(52,plain,
( ~ product(u,v,multiplicative_identity)
| ~ product(w,v,multiplicative_inverse(a))
| ~ product(multiplicative_identity,u,w) ),
inference(res,[status(thm),theory(equality)],[10,4]),
[iquote('0:Res:10.3,4.0')] ).
cnf(55,plain,
defined(multiplicative_inverse(a)),
inference(mrr,[status(thm)],[45,1]),
[iquote('0:MRR:45.0,1.0')] ).
cnf(56,plain,
product(multiplicative_inverse(a),a,multiplicative_identity),
inference(mrr,[status(thm)],[44,1]),
[iquote('0:MRR:44.0,1.0')] ).
cnf(57,plain,
( ~ product(a,u,multiplicative_identity)
| ~ product(multiplicative_identity,u,multiplicative_inverse(a)) ),
inference(res,[status(thm),theory(equality)],[2,52]),
[iquote('0:Res:2.0,52.0')] ).
cnf(86,plain,
product(a,multiplicative_inverse(a),multiplicative_identity),
inference(res,[status(thm),theory(equality)],[56,14]),
[iquote('0:Res:56.0,14.0')] ).
cnf(102,plain,
( ~ defined(multiplicative_inverse(a))
| ~ product(a,multiplicative_inverse(a),multiplicative_identity) ),
inference(res,[status(thm),theory(equality)],[12,57]),
[iquote('0:Res:12.1,57.1')] ).
cnf(103,plain,
~ product(a,multiplicative_inverse(a),multiplicative_identity),
inference(ssi,[status(thm)],[102,55]),
[iquote('0:SSi:102.0,55.0')] ).
cnf(104,plain,
$false,
inference(mrr,[status(thm)],[103,86]),
[iquote('0:MRR:103.0,86.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD031-5 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 6 13:23:34 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.42
% 0.19/0.42 SPASS V 3.9
% 0.19/0.42 SPASS beiseite: Proof found.
% 0.19/0.42 % SZS status Theorem
% 0.19/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.42 SPASS derived 60 clauses, backtracked 0 clauses, performed 0 splits and kept 69 clauses.
% 0.19/0.42 SPASS allocated 75693 KBytes.
% 0.19/0.42 SPASS spent 0:00:00.06 on the problem.
% 0.19/0.42 0:00:00.03 for the input.
% 0.19/0.42 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.42 0:00:00.00 for inferences.
% 0.19/0.42 0:00:00.00 for the backtracking.
% 0.19/0.42 0:00:00.00 for the reduction.
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Here is a proof with depth 3, length 19 :
% 0.19/0.42 % SZS output start Refutation
% See solution above
% 0.19/0.42 Formulae used in the proof : a_is_defined product_2 not_sum_3 not_product_4 associativity_multiplication_1 existence_of_identity_multiplication existence_of_inverse_multiplication commutativity_multiplication well_definedness_of_multiplicative_inverse
% 0.19/0.42
%------------------------------------------------------------------------------