TSTP Solution File: FLD025-4 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : FLD025-4 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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:21 EDT 2022
% Result : Unsatisfiable 0.17s 0.52s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 21 ( 10 unt; 0 nHn; 21 RR)
% Number of literals : 40 ( 0 equ; 20 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 12 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
defined(u__dfg),
file('FLD025-4.p',unknown),
[] ).
cnf(6,axiom,
product(multiplicative_identity,a,b),
file('FLD025-4.p',unknown),
[] ).
cnf(7,axiom,
product(multiplicative_identity,c,d),
file('FLD025-4.p',unknown),
[] ).
cnf(8,axiom,
product(a,c,u__dfg),
file('FLD025-4.p',unknown),
[] ).
cnf(9,axiom,
~ product(d,b,u__dfg),
file('FLD025-4.p',unknown),
[] ).
cnf(15,axiom,
( ~ product(u,v,w)
| ~ product(x,v,y)
| ~ product(z,x,u)
| product(z,y,w) ),
file('FLD025-4.p',unknown),
[] ).
cnf(16,axiom,
( ~ product(u,v,w)
| ~ product(x,y,v)
| ~ product(u,x,z)
| product(z,y,w) ),
file('FLD025-4.p',unknown),
[] ).
cnf(17,axiom,
( ~ defined(u)
| product(multiplicative_identity,u,u) ),
file('FLD025-4.p',unknown),
[] ).
cnf(19,axiom,
( ~ product(u,v,w)
| product(v,u,w) ),
file('FLD025-4.p',unknown),
[] ).
cnf(51,plain,
( ~ product(multiplicative_identity,u,v)
| ~ product(c,w,u)
| product(d,w,v) ),
inference(res,[status(thm),theory(equality)],[7,16]),
[iquote('0:Res:7.0,16.0')] ).
cnf(63,plain,
( ~ product(b,u,v)
| ~ product(a,u,w)
| product(multiplicative_identity,w,v) ),
inference(res,[status(thm),theory(equality)],[6,15]),
[iquote('0:Res:6.0,15.0')] ).
cnf(64,plain,
( ~ product(multiplicative_identity,u,v)
| ~ product(a,w,u)
| product(b,w,v) ),
inference(res,[status(thm),theory(equality)],[6,16]),
[iquote('0:Res:6.0,16.0')] ).
cnf(116,plain,
( ~ defined(u)
| ~ product(a,v,u)
| product(b,v,u) ),
inference(res,[status(thm),theory(equality)],[17,64]),
[iquote('0:Res:17.1,64.0')] ).
cnf(138,plain,
( ~ defined(u__dfg)
| product(b,c,u__dfg) ),
inference(res,[status(thm),theory(equality)],[8,116]),
[iquote('0:Res:8.0,116.1')] ).
cnf(144,plain,
product(b,c,u__dfg),
inference(ssi,[status(thm)],[138,5]),
[iquote('0:SSi:138.0,5.0')] ).
cnf(150,plain,
product(c,b,u__dfg),
inference(res,[status(thm),theory(equality)],[144,19]),
[iquote('0:Res:144.0,19.0')] ).
cnf(351,plain,
( ~ product(a,c,u)
| product(multiplicative_identity,u,u__dfg) ),
inference(res,[status(thm),theory(equality)],[144,63]),
[iquote('0:Res:144.0,63.0')] ).
cnf(378,plain,
product(multiplicative_identity,u__dfg,u__dfg),
inference(res,[status(thm),theory(equality)],[8,351]),
[iquote('0:Res:8.0,351.0')] ).
cnf(449,plain,
( ~ product(c,u,u__dfg)
| product(d,u,u__dfg) ),
inference(res,[status(thm),theory(equality)],[378,51]),
[iquote('0:Res:378.0,51.0')] ).
cnf(633,plain,
product(d,b,u__dfg),
inference(res,[status(thm),theory(equality)],[150,449]),
[iquote('0:Res:150.0,449.0')] ).
cnf(634,plain,
$false,
inference(mrr,[status(thm)],[633,9]),
[iquote('0:MRR:633.0,9.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : FLD025-4 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.32 % Computer : n025.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon Jun 6 14:02:18 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.17/0.52
% 0.17/0.52 SPASS V 3.9
% 0.17/0.52 SPASS beiseite: Proof found.
% 0.17/0.52 % SZS status Theorem
% 0.17/0.52 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.52 SPASS derived 521 clauses, backtracked 0 clauses, performed 1 splits and kept 441 clauses.
% 0.17/0.52 SPASS allocated 76186 KBytes.
% 0.17/0.52 SPASS spent 0:00:00.18 on the problem.
% 0.17/0.52 0:00:00.03 for the input.
% 0.17/0.52 0:00:00.00 for the FLOTTER CNF translation.
% 0.17/0.52 0:00:00.01 for inferences.
% 0.17/0.52 0:00:00.00 for the backtracking.
% 0.17/0.52 0:00:00.11 for the reduction.
% 0.17/0.52
% 0.17/0.52
% 0.17/0.52 Here is a proof with depth 7, length 21 :
% 0.17/0.52 % SZS output start Refutation
% See solution above
% 0.17/0.52 Formulae used in the proof : u_is_defined product_6 product_7 product_8 not_product_9 associativity_multiplication_1 associativity_multiplication_2 existence_of_identity_multiplication commutativity_multiplication
% 0.17/0.52
%------------------------------------------------------------------------------