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

View Problem - Process Solution

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

% Computer : n003.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:48:44 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    equal(ld(u,mult(u,v)),v),
    file('GRP657-10.p',unknown),
    [] ).

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

cnf(4,axiom,
    equal(rd(mult(u,v),v),u),
    file('GRP657-10.p',unknown),
    [] ).

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

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

cnf(17,plain,
    equal(rd(mult(u,mult(mult(v,w),u)),mult(w,u)),mult(u,v)),
    inference(spr,[status(thm),theory(equality)],[5,4]),
    [iquote('0:SpR:5.0,4.0')] ).

cnf(40,plain,
    equal(rd(mult(u,mult(v,u)),mult(w,u)),mult(u,rd(v,w))),
    inference(spr,[status(thm),theory(equality)],[3,17]),
    [iquote('0:SpR:3.0,17.0')] ).

cnf(101,plain,
    equal(mult(u,rd(v,v)),u),
    inference(spr,[status(thm),theory(equality)],[40,4]),
    [iquote('0:SpR:40.0,4.0')] ).

cnf(133,plain,
    equal(ld(u,u),rd(v,v)),
    inference(spr,[status(thm),theory(equality)],[101,2]),
    [iquote('0:SpR:101.0,2.0')] ).

cnf(138,plain,
    ~ equal(tuple(mult(rd(u,u),x1__dfg(rd(u,u))),x1_2(rd(u,u))),tuple(x1__dfg(rd(u,u)),x1_2(rd(u,u)))),
    inference(spl,[status(thm),theory(equality)],[101,6]),
    [iquote('0:SpL:101.0,6.0')] ).

cnf(166,plain,
    equal(rd(u,u),rd(v,v)),
    inference(spr,[status(thm),theory(equality)],[133]),
    [iquote('0:SpR:133.0,133.0')] ).

cnf(174,plain,
    equal(mult(rd(u,u),v),v),
    inference(spr,[status(thm),theory(equality)],[166,3]),
    [iquote('0:SpR:166.0,3.0')] ).

cnf(190,plain,
    ~ equal(tuple(x1__dfg(rd(u,u)),x1_2(rd(u,u))),tuple(x1__dfg(rd(u,u)),x1_2(rd(u,u)))),
    inference(rew,[status(thm),theory(equality)],[174,138]),
    [iquote('0:Rew:174.0,138.0')] ).

cnf(194,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[190]),
    [iquote('0:Obv:190.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP657-10 : TPTP v8.1.0. Released v8.1.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n003.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jun 14 12:13:40 EDT 2022
% 0.19/0.34  % CPUTime  : 
% 0.19/0.43  
% 0.19/0.43  SPASS V 3.9 
% 0.19/0.43  SPASS beiseite: Proof found.
% 0.19/0.43  % SZS status Theorem
% 0.19/0.43  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.43  SPASS derived 146 clauses, backtracked 0 clauses, performed 0 splits and kept 60 clauses.
% 0.19/0.43  SPASS allocated 63429 KBytes.
% 0.19/0.43  SPASS spent	0:00:00.07 on the problem.
% 0.19/0.43  		0:00:00.03 for the input.
% 0.19/0.43  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.43  		0:00:00.00 for inferences.
% 0.19/0.43  		0:00:00.00 for the backtracking.
% 0.19/0.43  		0:00:00.02 for the reduction.
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  Here is a proof with depth 6, length 14 :
% 0.19/0.43  % SZS output start Refutation
% See solution above
% 0.19/0.43  Formulae used in the proof : f02 f03 f04 f05 goal
% 0.19/0.43  
%------------------------------------------------------------------------------