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

View Problem - Process Solution

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

% Computer : n032.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 : Fri Jul 15 00:42:31 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    equal(apply(apply(apply(b,u),v),w),apply(u,apply(v,w))),
    file('COL060-1.p',unknown),
    [] ).

cnf(2,axiom,
    equal(apply(apply(t,u),v),apply(v,u)),
    file('COL060-1.p',unknown),
    [] ).

cnf(3,axiom,
    ~ equal(apply(apply(apply(u,f(u)),g(u)),h(u)),apply(g(u),apply(f(u),h(u)))),
    file('COL060-1.p',unknown),
    [] ).

cnf(7,plain,
    ~ equal(apply(apply(apply(u,apply(v,f(apply(apply(b,u),v)))),g(apply(apply(b,u),v))),h(apply(apply(b,u),v))),apply(g(apply(apply(b,u),v)),apply(f(apply(apply(b,u),v)),h(apply(apply(b,u),v))))),
    inference(spl,[status(thm),theory(equality)],[1,3]),
    [iquote('0:SpL:1.0,3.0')] ).

cnf(19,plain,
    ~ equal(apply(apply(apply(apply(u,f(apply(apply(b,apply(t,v)),u))),v),g(apply(apply(b,apply(t,v)),u))),h(apply(apply(b,apply(t,v)),u))),apply(g(apply(apply(b,apply(t,v)),u)),apply(f(apply(apply(b,apply(t,v)),u)),h(apply(apply(b,apply(t,v)),u))))),
    inference(spl,[status(thm),theory(equality)],[2,7]),
    [iquote('0:SpL:2.0,7.0')] ).

cnf(57,plain,
    ~ equal(apply(apply(apply(apply(u,apply(v,f(apply(apply(b,apply(t,w)),apply(apply(b,u),v))))),w),g(apply(apply(b,apply(t,w)),apply(apply(b,u),v)))),h(apply(apply(b,apply(t,w)),apply(apply(b,u),v)))),apply(g(apply(apply(b,apply(t,w)),apply(apply(b,u),v))),apply(f(apply(apply(b,apply(t,w)),apply(apply(b,u),v))),h(apply(apply(b,apply(t,w)),apply(apply(b,u),v)))))),
    inference(spl,[status(thm),theory(equality)],[1,19]),
    [iquote('0:SpL:1.0,19.0')] ).

cnf(260,plain,
    ~ equal(apply(apply(apply(u,f(apply(apply(b,apply(t,v)),apply(apply(b,b),u)))),apply(v,g(apply(apply(b,apply(t,v)),apply(apply(b,b),u))))),h(apply(apply(b,apply(t,v)),apply(apply(b,b),u)))),apply(g(apply(apply(b,apply(t,v)),apply(apply(b,b),u))),apply(f(apply(apply(b,apply(t,v)),apply(apply(b,b),u))),h(apply(apply(b,apply(t,v)),apply(apply(b,b),u)))))),
    inference(spl,[status(thm),theory(equality)],[1,57]),
    [iquote('0:SpL:1.0,57.0')] ).

cnf(510,plain,
    ~ equal(apply(apply(apply(u,g(apply(apply(b,apply(t,u)),apply(apply(b,b),t)))),f(apply(apply(b,apply(t,u)),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,u)),apply(apply(b,b),t)))),apply(g(apply(apply(b,apply(t,u)),apply(apply(b,b),t))),apply(f(apply(apply(b,apply(t,u)),apply(apply(b,b),t))),h(apply(apply(b,apply(t,u)),apply(apply(b,b),t)))))),
    inference(spl,[status(thm),theory(equality)],[2,260]),
    [iquote('0:SpL:2.0,260.0')] ).

cnf(513,plain,
    $false,
    inference(unc,[status(thm)],[510,1]),
    [iquote('0:UnC:510.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : COL060-1 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.10  % Command  : run_spass %d %s
% 0.09/0.28  % Computer : n032.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % WCLimit  : 600
% 0.09/0.28  % DateTime : Tue May 31 09:23:43 EDT 2022
% 0.09/0.28  % CPUTime  : 
% 0.90/1.14  
% 0.90/1.14  SPASS V 3.9 
% 0.90/1.14  SPASS beiseite: Proof found.
% 0.90/1.14  % SZS status Theorem
% 0.90/1.14  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.90/1.14  SPASS derived 509 clauses, backtracked 0 clauses, performed 0 splits and kept 407 clauses.
% 0.90/1.14  SPASS allocated 69888 KBytes.
% 0.90/1.14  SPASS spent	0:00:00.82 on the problem.
% 0.90/1.14  		0:00:00.03 for the input.
% 0.90/1.14  		0:00:00.00 for the FLOTTER CNF translation.
% 0.90/1.14  		0:00:00.19 for inferences.
% 0.90/1.14  		0:00:00.00 for the backtracking.
% 0.90/1.14  		0:00:00.57 for the reduction.
% 0.90/1.14  
% 0.90/1.14  
% 0.90/1.14  Here is a proof with depth 5, length 9 :
% 0.90/1.14  % SZS output start Refutation
% See solution above
% 0.90/1.14  Formulae used in the proof : b_definition t_definition prove_q_combinator
% 0.90/1.14  
%------------------------------------------------------------------------------