TSTP Solution File: BOO013-3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : BOO013-3 : TPTP v8.1.0. Released v1.0.0.
% 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 : Thu Jul 14 23:49:26 EDT 2022
% Result : Unsatisfiable 12.03s 12.24s
% Output : Refutation 12.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 32 ( 19 unt; 0 nHn; 32 RR)
% Number of literals : 55 ( 0 equ; 28 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 12 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
sum__dfg(x__dfg,y__dfg,multiplicative_identity),
file('BOO013-3.p',unknown),
[] ).
cnf(3,axiom,
sum__dfg(x__dfg,z__dfg,multiplicative_identity),
file('BOO013-3.p',unknown),
[] ).
cnf(4,axiom,
product(x__dfg,y__dfg,additive_identity),
file('BOO013-3.p',unknown),
[] ).
cnf(5,axiom,
product(x__dfg,z__dfg,additive_identity),
file('BOO013-3.p',unknown),
[] ).
cnf(6,axiom,
~ equal(z__dfg,y__dfg),
file('BOO013-3.p',unknown),
[] ).
cnf(8,axiom,
product(u,v,multiply(u,v)),
file('BOO013-3.p',unknown),
[] ).
cnf(9,axiom,
( ~ sum__dfg(u,v,w)
| sum__dfg(v,u,w) ),
file('BOO013-3.p',unknown),
[] ).
cnf(10,axiom,
( ~ product(u,v,w)
| product(v,u,w) ),
file('BOO013-3.p',unknown),
[] ).
cnf(11,axiom,
sum__dfg(additive_identity,u,u),
file('BOO013-3.p',unknown),
[] ).
cnf(12,axiom,
sum__dfg(u,additive_identity,u),
file('BOO013-3.p',unknown),
[] ).
cnf(13,axiom,
product(multiplicative_identity,u,u),
file('BOO013-3.p',unknown),
[] ).
cnf(18,axiom,
( ~ sum__dfg(u,v,w)
| ~ sum__dfg(x,y,z)
| ~ product(y,x1,v)
| ~ product(x,x1,u)
| product(z,x1,w) ),
file('BOO013-3.p',unknown),
[] ).
cnf(28,axiom,
( ~ product(u,v,w)
| ~ product(u,v,x)
| equal(x,w) ),
file('BOO013-3.p',unknown),
[] ).
cnf(30,plain,
( ~ product(u,v,y__dfg)
| ~ product(u,v,z__dfg) ),
inference(res,[status(thm),theory(equality)],[28,6]),
[iquote('0:Res:28.2,6.0')] ).
cnf(66,plain,
( ~ sum__dfg(u,additive_identity,v)
| ~ sum__dfg(w,x__dfg,x)
| ~ product(w,y__dfg,u)
| product(x,y__dfg,v) ),
inference(res,[status(thm),theory(equality)],[4,18]),
[iquote('0:Res:4.0,18.1')] ).
cnf(87,plain,
product(u,v,multiply(v,u)),
inference(res,[status(thm),theory(equality)],[8,10]),
[iquote('0:Res:8.0,10.0')] ).
cnf(99,plain,
sum__dfg(z__dfg,x__dfg,multiplicative_identity),
inference(res,[status(thm),theory(equality)],[3,9]),
[iquote('0:Res:3.0,9.0')] ).
cnf(120,plain,
( ~ product(multiplicative_identity,u,v)
| equal(v,u) ),
inference(res,[status(thm),theory(equality)],[13,28]),
[iquote('0:Res:13.0,28.0')] ).
cnf(122,plain,
( ~ product(u,v,w)
| equal(w,multiply(u,v)) ),
inference(res,[status(thm),theory(equality)],[8,28]),
[iquote('0:Res:8.0,28.0')] ).
cnf(171,plain,
( ~ sum__dfg(u,v,w)
| ~ product(v,x,y)
| ~ product(u,x,additive_identity)
| product(w,x,y) ),
inference(res,[status(thm),theory(equality)],[11,18]),
[iquote('0:Res:11.0,18.0')] ).
cnf(327,plain,
~ product(multiplicative_identity,z__dfg,y__dfg),
inference(res,[status(thm),theory(equality)],[13,30]),
[iquote('0:Res:13.0,30.1')] ).
cnf(350,plain,
equal(multiply(u,v),multiply(v,u)),
inference(res,[status(thm),theory(equality)],[87,122]),
[iquote('0:Res:87.0,122.0')] ).
cnf(923,plain,
( ~ sum__dfg(u,x__dfg,v)
| ~ product(u,y__dfg,w)
| product(v,y__dfg,w) ),
inference(res,[status(thm),theory(equality)],[12,66]),
[iquote('0:Res:12.0,66.0')] ).
cnf(4462,plain,
( ~ product(y__dfg,u,v)
| ~ product(x__dfg,u,additive_identity)
| product(multiplicative_identity,u,v) ),
inference(res,[status(thm),theory(equality)],[2,171]),
[iquote('0:Res:2.0,171.0')] ).
cnf(15201,plain,
( ~ product(y__dfg,z__dfg,y__dfg)
| ~ product(x__dfg,z__dfg,additive_identity) ),
inference(res,[status(thm),theory(equality)],[4462,327]),
[iquote('0:Res:4462.2,327.0')] ).
cnf(15213,plain,
~ product(y__dfg,z__dfg,y__dfg),
inference(mrr,[status(thm)],[15201,5]),
[iquote('0:MRR:15201.1,5.0')] ).
cnf(16934,plain,
( ~ product(z__dfg,y__dfg,u)
| product(multiplicative_identity,y__dfg,u) ),
inference(res,[status(thm),theory(equality)],[99,923]),
[iquote('0:Res:99.0,923.0')] ).
cnf(16969,plain,
product(multiplicative_identity,y__dfg,multiply(z__dfg,y__dfg)),
inference(res,[status(thm),theory(equality)],[8,16934]),
[iquote('0:Res:8.0,16934.0')] ).
cnf(16981,plain,
product(multiplicative_identity,y__dfg,multiply(y__dfg,z__dfg)),
inference(rew,[status(thm),theory(equality)],[350,16969]),
[iquote('0:Rew:350.0,16969.0')] ).
cnf(17016,plain,
equal(multiply(y__dfg,z__dfg),y__dfg),
inference(res,[status(thm),theory(equality)],[16981,120]),
[iquote('0:Res:16981.0,120.0')] ).
cnf(17049,plain,
product(y__dfg,z__dfg,y__dfg),
inference(spr,[status(thm),theory(equality)],[17016,8]),
[iquote('0:SpR:17016.0,8.0')] ).
cnf(17052,plain,
$false,
inference(mrr,[status(thm)],[17049,15213]),
[iquote('0:MRR:17049.0,15213.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : BOO013-3 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n023.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 : Wed Jun 1 23:45:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 12.03/12.24
% 12.03/12.24 SPASS V 3.9
% 12.03/12.24 SPASS beiseite: Proof found.
% 12.03/12.24 % SZS status Theorem
% 12.03/12.24 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.03/12.24 SPASS derived 13396 clauses, backtracked 0 clauses, performed 0 splits and kept 7181 clauses.
% 12.03/12.24 SPASS allocated 73995 KBytes.
% 12.03/12.24 SPASS spent 0:0:11.83 on the problem.
% 12.03/12.24 0:00:00.03 for the input.
% 12.03/12.24 0:00:00.00 for the FLOTTER CNF translation.
% 12.03/12.24 0:00:00.16 for inferences.
% 12.03/12.24 0:00:00.00 for the backtracking.
% 12.03/12.24 0:0:11.54 for the reduction.
% 12.03/12.24
% 12.03/12.24
% 12.03/12.24 Here is a proof with depth 6, length 32 :
% 12.03/12.24 % SZS output start Refutation
% See solution above
% 12.03/12.24 Formulae used in the proof : sum_to_multiplicative_identity1 sum_to_multiplicative_identity2 product_to_additive_identity1 product_to_additive_identity2 prove_both_inverse_are_equal closure_of_multiplication commutativity_of_addition commutativity_of_multiplication additive_identity1 additive_identity2 multiplicative_identity1 distributivity4 multiplication_is_well_defined
% 12.03/12.24
%------------------------------------------------------------------------------