TSTP Solution File: GRP710-10 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : GRP710-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n028.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:49:07 EDT 2022

% Result   : Unsatisfiable 0.20s 0.44s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   21 (  21 unt;   0 nHn;  21 RR)
%            Number of literals    :   21 (   0 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    equal(mult(u,unit),u),
    file('GRP710-10.p',unknown),
    [] ).

cnf(2,axiom,
    equal(mult(unit,u),u),
    file('GRP710-10.p',unknown),
    [] ).

cnf(3,axiom,
    equal(mult(mult(mult(u,v),v),w),mult(u,mult(v,mult(v,w)))),
    file('GRP710-10.p',unknown),
    [] ).

cnf(5,axiom,
    equal(mult(i(u),u),unit),
    file('GRP710-10.p',unknown),
    [] ).

cnf(6,axiom,
    ~ equal(mult(x0__dfg,u),x1__dfg),
    file('GRP710-10.p',unknown),
    [] ).

cnf(19,plain,
    equal(mult(u,mult(v,mult(v,unit))),mult(mult(u,v),v)),
    inference(spr,[status(thm),theory(equality)],[3,1]),
    [iquote('0:SpR:3.0,1.0')] ).

cnf(24,plain,
    equal(mult(unit,mult(u,mult(u,v))),mult(mult(u,u),v)),
    inference(spr,[status(thm),theory(equality)],[2,3]),
    [iquote('0:SpR:2.0,3.0')] ).

cnf(25,plain,
    equal(mult(i(u),mult(u,mult(u,v))),mult(mult(unit,u),v)),
    inference(spr,[status(thm),theory(equality)],[5,3]),
    [iquote('0:SpR:5.0,3.0')] ).

cnf(29,plain,
    equal(mult(mult(u,v),v),mult(u,mult(v,v))),
    inference(rew,[status(thm),theory(equality)],[1,19]),
    [iquote('0:Rew:1.0,19.0')] ).

cnf(30,plain,
    equal(mult(mult(u,mult(v,v)),w),mult(u,mult(v,mult(v,w)))),
    inference(rew,[status(thm),theory(equality)],[29,3]),
    [iquote('0:Rew:29.0,3.0')] ).

cnf(31,plain,
    equal(mult(mult(u,u),v),mult(u,mult(u,v))),
    inference(rew,[status(thm),theory(equality)],[2,24]),
    [iquote('0:Rew:2.0,24.0')] ).

cnf(35,plain,
    equal(mult(i(u),mult(u,mult(u,v))),mult(u,v)),
    inference(rew,[status(thm),theory(equality)],[2,25]),
    [iquote('0:Rew:2.0,25.0')] ).

cnf(46,plain,
    equal(mult(i(mult(u,u)),mult(u,mult(u,v))),mult(unit,v)),
    inference(spr,[status(thm),theory(equality)],[5,30]),
    [iquote('0:SpR:5.0,30.0')] ).

cnf(51,plain,
    equal(mult(i(mult(u,u)),mult(u,mult(u,v))),v),
    inference(rew,[status(thm),theory(equality)],[2,46]),
    [iquote('0:Rew:2.0,46.0')] ).

cnf(60,plain,
    equal(mult(i(u),mult(u,u)),mult(unit,u)),
    inference(spr,[status(thm),theory(equality)],[5,29]),
    [iquote('0:SpR:5.0,29.0')] ).

cnf(66,plain,
    equal(mult(i(u),mult(u,u)),u),
    inference(rew,[status(thm),theory(equality)],[2,60]),
    [iquote('0:Rew:2.0,60.0')] ).

cnf(151,plain,
    equal(mult(i(i(u)),mult(i(u),u)),u),
    inference(spr,[status(thm),theory(equality)],[66,35]),
    [iquote('0:SpR:66.0,35.0')] ).

cnf(162,plain,
    equal(i(i(u)),u),
    inference(rew,[status(thm),theory(equality)],[1,151,5]),
    [iquote('0:Rew:1.0,151.0,5.0,151.0')] ).

cnf(203,plain,
    equal(mult(i(i(mult(u,u))),mult(i(mult(u,u)),v)),v),
    inference(spr,[status(thm),theory(equality)],[51,35]),
    [iquote('0:SpR:51.0,35.0')] ).

cnf(230,plain,
    equal(mult(u,mult(u,mult(i(mult(u,u)),v))),v),
    inference(rew,[status(thm),theory(equality)],[31,203,162]),
    [iquote('0:Rew:31.0,203.0,162.0,203.0')] ).

cnf(231,plain,
    $false,
    inference(unc,[status(thm)],[230,6]),
    [iquote('0:UnC:230.0,6.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP710-10 : TPTP v8.1.0. Released v8.1.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n028.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 : Tue Jun 14 13:03:24 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.44  
% 0.20/0.44  SPASS V 3.9 
% 0.20/0.44  SPASS beiseite: Proof found.
% 0.20/0.44  % SZS status Theorem
% 0.20/0.44  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.44  SPASS derived 153 clauses, backtracked 0 clauses, performed 0 splits and kept 54 clauses.
% 0.20/0.44  SPASS allocated 63443 KBytes.
% 0.20/0.44  SPASS spent	0:00:00.08 on the problem.
% 0.20/0.44  		0:00:00.03 for the input.
% 0.20/0.44  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.44  		0:00:00.00 for inferences.
% 0.20/0.44  		0:00:00.00 for the backtracking.
% 0.20/0.44  		0:00:00.02 for the reduction.
% 0.20/0.44  
% 0.20/0.44  
% 0.20/0.44  Here is a proof with depth 3, length 21 :
% 0.20/0.44  % SZS output start Refutation
% See solution above
% 0.20/0.44  Formulae used in the proof : f01 f02 f03 f05 goal
% 0.20/0.44  
%------------------------------------------------------------------------------