TSTP Solution File: REL049+1 by SPASS---3.9

View Problem - Process Solution

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

% Computer : n007.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 : Mon Jul 18 20:02:31 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    equal(join(skc5,skc3),skc3),
    file('REL049+1.p',unknown),
    [] ).

cnf(2,axiom,
    equal(join(skc4,skc3),skc3),
    file('REL049+1.p',unknown),
    [] ).

cnf(7,axiom,
    equal(join(u,v),join(v,u)),
    file('REL049+1.p',unknown),
    [] ).

cnf(8,axiom,
    ~ equal(join(join(skc5,skc4),skc3),skc3),
    file('REL049+1.p',unknown),
    [] ).

cnf(12,axiom,
    equal(join(join(u,v),w),join(u,join(v,w))),
    file('REL049+1.p',unknown),
    [] ).

cnf(17,plain,
    equal(join(skc3,skc5),skc3),
    inference(rew,[status(thm),theory(equality)],[7,1]),
    [iquote('0:Rew:7.0,1.0')] ).

cnf(18,plain,
    equal(join(skc3,skc4),skc3),
    inference(rew,[status(thm),theory(equality)],[7,2]),
    [iquote('0:Rew:7.0,2.0')] ).

cnf(19,plain,
    ~ equal(join(skc3,join(skc4,skc5)),skc3),
    inference(rew,[status(thm),theory(equality)],[7,8]),
    [iquote('0:Rew:7.0,8.0,7.0,8.0')] ).

cnf(191,plain,
    equal(join(skc3,join(skc4,u)),join(skc3,u)),
    inference(spr,[status(thm),theory(equality)],[18,12]),
    [iquote('0:SpR:18.0,12.0')] ).

cnf(199,plain,
    ~ equal(join(skc3,skc5),skc3),
    inference(rew,[status(thm),theory(equality)],[191,19]),
    [iquote('0:Rew:191.0,19.0')] ).

cnf(200,plain,
    ~ equal(skc3,skc3),
    inference(rew,[status(thm),theory(equality)],[17,199]),
    [iquote('0:Rew:17.0,199.0')] ).

cnf(201,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[200]),
    [iquote('0:Obv:200.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem  : REL049+1 : TPTP v8.1.0. Released v4.0.0.
% 0.14/0.14  % Command  : run_spass %d %s
% 0.15/0.36  % Computer : n007.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Fri Jul  8 15:23:15 EDT 2022
% 0.22/0.36  % CPUTime  : 
% 0.23/0.47  
% 0.23/0.47  SPASS V 3.9 
% 0.23/0.47  SPASS beiseite: Proof found.
% 0.23/0.47  % SZS status Theorem
% 0.23/0.47  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.23/0.47  SPASS derived 134 clauses, backtracked 0 clauses, performed 0 splits and kept 73 clauses.
% 0.23/0.47  SPASS allocated 85339 KBytes.
% 0.23/0.47  SPASS spent	0:00:00.10 on the problem.
% 0.23/0.47  		0:00:00.03 for the input.
% 0.23/0.47  		0:00:00.02 for the FLOTTER CNF translation.
% 0.23/0.47  		0:00:00.00 for inferences.
% 0.23/0.47  		0:00:00.00 for the backtracking.
% 0.23/0.47  		0:00:00.01 for the reduction.
% 0.23/0.47  
% 0.23/0.47  
% 0.23/0.47  Here is a proof with depth 1, length 12 :
% 0.23/0.47  % SZS output start Refutation
% See solution above
% 0.23/0.47  Formulae used in the proof : goals maddux1_join_commutativity maddux2_join_associativity
% 0.23/0.47  
%------------------------------------------------------------------------------