TSTP Solution File: BOO012-2 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : BOO012-2 : 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:25 EDT 2022

% Result   : Unsatisfiable 0.21s 0.50s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   41 (  41 unt;   0 nHn;  41 RR)
%            Number of literals    :   41 (   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    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ equal(inverse(inverse(x__dfg)),x__dfg),
    file('BOO012-2.p',unknown),
    [] ).

cnf(2,axiom,
    equal(add(u,v),add(v,u)),
    file('BOO012-2.p',unknown),
    [] ).

cnf(3,axiom,
    equal(multiply(u,v),multiply(v,u)),
    file('BOO012-2.p',unknown),
    [] ).

cnf(4,axiom,
    equal(multiply(add(u,v),add(w,v)),add(multiply(u,w),v)),
    file('BOO012-2.p',unknown),
    [] ).

cnf(5,axiom,
    equal(multiply(add(u,v),add(u,w)),add(u,multiply(v,w))),
    file('BOO012-2.p',unknown),
    [] ).

cnf(6,axiom,
    equal(add(multiply(u,v),multiply(w,v)),multiply(add(u,w),v)),
    file('BOO012-2.p',unknown),
    [] ).

cnf(7,axiom,
    equal(add(multiply(u,v),multiply(u,w)),multiply(u,add(v,w))),
    file('BOO012-2.p',unknown),
    [] ).

cnf(8,axiom,
    equal(add(u,inverse(u)),multiplicative_identity),
    file('BOO012-2.p',unknown),
    [] ).

cnf(10,axiom,
    equal(multiply(u,inverse(u)),additive_identity),
    file('BOO012-2.p',unknown),
    [] ).

cnf(12,axiom,
    equal(multiply(u,multiplicative_identity),u),
    file('BOO012-2.p',unknown),
    [] ).

cnf(13,axiom,
    equal(multiply(multiplicative_identity,u),u),
    file('BOO012-2.p',unknown),
    [] ).

cnf(14,axiom,
    equal(add(u,additive_identity),u),
    file('BOO012-2.p',unknown),
    [] ).

cnf(15,axiom,
    equal(add(additive_identity,u),u),
    file('BOO012-2.p',unknown),
    [] ).

cnf(53,plain,
    equal(add(multiply(u,v),v),multiply(add(u,multiplicative_identity),v)),
    inference(spr,[status(thm),theory(equality)],[13,6]),
    [iquote('0:SpR:13.0,6.0')] ).

cnf(63,plain,
    equal(add(u,multiply(v,u)),multiply(add(v,multiplicative_identity),u)),
    inference(rew,[status(thm),theory(equality)],[2,53]),
    [iquote('0:Rew:2.0,53.0')] ).

cnf(74,plain,
    equal(add(u,multiply(u,v)),multiply(add(v,multiplicative_identity),u)),
    inference(spr,[status(thm),theory(equality)],[3,63]),
    [iquote('0:SpR:3.0,63.0')] ).

cnf(99,plain,
    equal(multiply(add(u,v),v),add(multiply(u,additive_identity),v)),
    inference(spr,[status(thm),theory(equality)],[15,4]),
    [iquote('0:SpR:15.0,4.0')] ).

cnf(113,plain,
    equal(multiply(u,add(v,u)),add(multiply(v,additive_identity),u)),
    inference(rew,[status(thm),theory(equality)],[3,99]),
    [iquote('0:Rew:3.0,99.0')] ).

cnf(204,plain,
    equal(multiply(u,add(v,inverse(u))),add(multiply(u,v),additive_identity)),
    inference(spr,[status(thm),theory(equality)],[10,7]),
    [iquote('0:SpR:10.0,7.0')] ).

cnf(215,plain,
    equal(multiply(u,add(inverse(u),v)),add(additive_identity,multiply(u,v))),
    inference(spr,[status(thm),theory(equality)],[10,7]),
    [iquote('0:SpR:10.0,7.0')] ).

cnf(229,plain,
    equal(multiply(u,add(v,inverse(u))),multiply(u,v)),
    inference(rew,[status(thm),theory(equality)],[15,204,2]),
    [iquote('0:Rew:15.0,204.0,2.0,204.0')] ).

cnf(230,plain,
    equal(multiply(u,add(inverse(u),v)),multiply(u,v)),
    inference(rew,[status(thm),theory(equality)],[15,215]),
    [iquote('0:Rew:15.0,215.0')] ).

cnf(256,plain,
    equal(multiply(u,inverse(u)),multiply(u,additive_identity)),
    inference(spr,[status(thm),theory(equality)],[15,229]),
    [iquote('0:SpR:15.0,229.0')] ).

cnf(258,plain,
    equal(multiply(u,multiplicative_identity),multiply(u,u)),
    inference(spr,[status(thm),theory(equality)],[8,229]),
    [iquote('0:SpR:8.0,229.0')] ).

cnf(262,plain,
    equal(multiply(u,u),u),
    inference(rew,[status(thm),theory(equality)],[12,258]),
    [iquote('0:Rew:12.0,258.0')] ).

cnf(265,plain,
    equal(multiply(u,additive_identity),additive_identity),
    inference(rew,[status(thm),theory(equality)],[10,256]),
    [iquote('0:Rew:10.0,256.0')] ).

cnf(268,plain,
    equal(multiply(u,add(v,u)),add(additive_identity,u)),
    inference(rew,[status(thm),theory(equality)],[265,113]),
    [iquote('0:Rew:265.0,113.0')] ).

cnf(280,plain,
    equal(multiply(u,add(v,u)),u),
    inference(rew,[status(thm),theory(equality)],[15,268]),
    [iquote('0:Rew:15.0,268.0')] ).

cnf(330,plain,
    equal(add(multiply(u,v),u),multiply(u,add(v,u))),
    inference(spr,[status(thm),theory(equality)],[262,7]),
    [iquote('0:SpR:262.0,7.0')] ).

cnf(339,plain,
    equal(add(u,multiply(u,v)),multiply(u,add(v,u))),
    inference(rew,[status(thm),theory(equality)],[2,330]),
    [iquote('0:Rew:2.0,330.0')] ).

cnf(340,plain,
    equal(multiply(add(u,multiplicative_identity),v),v),
    inference(rew,[status(thm),theory(equality)],[74,339,280]),
    [iquote('0:Rew:74.0,339.0,280.0,339.0')] ).

cnf(342,plain,
    equal(add(u,multiply(v,u)),u),
    inference(rew,[status(thm),theory(equality)],[340,63]),
    [iquote('0:Rew:340.0,63.0')] ).

cnf(429,plain,
    equal(add(u,multiply(inverse(u),v)),multiply(multiplicative_identity,add(u,v))),
    inference(spr,[status(thm),theory(equality)],[8,5]),
    [iquote('0:SpR:8.0,5.0')] ).

cnf(440,plain,
    equal(add(u,multiply(inverse(u),v)),add(u,v)),
    inference(rew,[status(thm),theory(equality)],[13,429]),
    [iquote('0:Rew:13.0,429.0')] ).

cnf(709,plain,
    equal(multiply(u,inverse(inverse(u))),multiply(u,multiplicative_identity)),
    inference(spr,[status(thm),theory(equality)],[8,230]),
    [iquote('0:SpR:8.0,230.0')] ).

cnf(719,plain,
    equal(multiply(u,inverse(inverse(u))),u),
    inference(rew,[status(thm),theory(equality)],[12,709]),
    [iquote('0:Rew:12.0,709.0')] ).

cnf(729,plain,
    equal(add(inverse(inverse(u)),u),inverse(inverse(u))),
    inference(spr,[status(thm),theory(equality)],[719,342]),
    [iquote('0:SpR:719.0,342.0')] ).

cnf(741,plain,
    equal(add(u,inverse(inverse(u))),inverse(inverse(u))),
    inference(rew,[status(thm),theory(equality)],[2,729]),
    [iquote('0:Rew:2.0,729.0')] ).

cnf(989,plain,
    equal(add(u,inverse(inverse(u))),add(u,additive_identity)),
    inference(spr,[status(thm),theory(equality)],[10,440]),
    [iquote('0:SpR:10.0,440.0')] ).

cnf(1009,plain,
    equal(inverse(inverse(u)),u),
    inference(rew,[status(thm),theory(equality)],[741,989,14]),
    [iquote('0:Rew:741.0,989.0,14.0,989.0')] ).

cnf(1010,plain,
    $false,
    inference(unc,[status(thm)],[1009,1]),
    [iquote('0:UnC:1009.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : BOO012-2 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n023.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Wed Jun  1 16:01:11 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.21/0.50  
% 0.21/0.50  SPASS V 3.9 
% 0.21/0.50  SPASS beiseite: Proof found.
% 0.21/0.50  % SZS status Theorem
% 0.21/0.50  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.21/0.50  SPASS derived 706 clauses, backtracked 0 clauses, performed 0 splits and kept 220 clauses.
% 0.21/0.50  SPASS allocated 64031 KBytes.
% 0.21/0.50  SPASS spent	0:00:00.14 on the problem.
% 0.21/0.50  		0:00:00.03 for the input.
% 0.21/0.50  		0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.50  		0:00:00.01 for inferences.
% 0.21/0.50  		0:00:00.00 for the backtracking.
% 0.21/0.50  		0:00:00.08 for the reduction.
% 0.21/0.50  
% 0.21/0.50  
% 0.21/0.50  Here is a proof with depth 3, length 41 :
% 0.21/0.50  % SZS output start Refutation
% See solution above
% 0.21/0.50  Formulae used in the proof : prove_inverse_is_an_involution commutativity_of_add commutativity_of_multiply distributivity1 distributivity2 distributivity3 distributivity4 additive_inverse1 multiplicative_inverse1 multiplicative_id1 multiplicative_id2 additive_id1 additive_id2
% 0.21/0.50  
%------------------------------------------------------------------------------