TSTP Solution File: GRP007-1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : GRP007-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n006.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:44:43 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    product(c,u,u),
    file('GRP007-1.p',unknown),
    [] ).

cnf(3,axiom,
    ~ equal(identity,c),
    file('GRP007-1.p',unknown),
    [] ).

cnf(5,axiom,
    product(u,identity,u),
    file('GRP007-1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ product(u,v,w)
    | ~ product(u,v,x)
    | equal(x,w) ),
    file('GRP007-1.p',unknown),
    [] ).

cnf(12,plain,
    ( ~ product(u,v,c)
    | ~ product(u,v,identity) ),
    inference(res,[status(thm),theory(equality)],[9,3]),
    [iquote('0:Res:9.2,3.0')] ).

cnf(15,plain,
    ~ product(c,identity,c),
    inference(res,[status(thm),theory(equality)],[1,12]),
    [iquote('0:Res:1.0,12.1')] ).

cnf(20,plain,
    $false,
    inference(mrr,[status(thm)],[15,5]),
    [iquote('0:MRR:15.0,5.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GRP007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n006.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 : Mon Jun 13 22:58:41 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.41  
% 0.20/0.41  SPASS V 3.9 
% 0.20/0.41  SPASS beiseite: Proof found.
% 0.20/0.41  % SZS status Theorem
% 0.20/0.41  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.41  SPASS derived 8 clauses, backtracked 0 clauses, performed 0 splits and kept 17 clauses.
% 0.20/0.41  SPASS allocated 63091 KBytes.
% 0.20/0.41  SPASS spent	0:00:00.06 on the problem.
% 0.20/0.41  		0:00:00.03 for the input.
% 0.20/0.41  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.41  		0:00:00.00 for inferences.
% 0.20/0.41  		0:00:00.00 for the backtracking.
% 0.20/0.41  		0:00:00.00 for the reduction.
% 0.20/0.41  
% 0.20/0.41  
% 0.20/0.41  Here is a proof with depth 2, length 7 :
% 0.20/0.41  % SZS output start Refutation
% See solution above
% 0.20/0.41  Formulae used in the proof : another_left_identity prove_identity_equals_c right_identity total_function2
% 0.20/0.41  
%------------------------------------------------------------------------------