↑ Up

SPASS---3.9.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : COL052-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n020.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:29 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    equal(response(compose(u,v),w),response(u,response(v,w))),
    file('COL052-2.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ agreeable(u)
    | equal(response(u,common_bird(v)),response(v,common_bird(v))) ),
    file('COL052-2.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ equal(response(compatible(u),v),response(u,v))
    | agreeable(u) ),
    file('COL052-2.p',unknown),
    [] ).

cnf(4,axiom,
    agreeable(c),
    file('COL052-2.p',unknown),
    [] ).

cnf(5,axiom,
    equal(compose(a,b),c),
    file('COL052-2.p',unknown),
    [] ).

cnf(6,axiom,
    ~ agreeable(a),
    file('COL052-2.p',unknown),
    [] ).

cnf(7,plain,
    ~ equal(response(compatible(a),u),response(a,u)),
    inference(res,[status(thm),theory(equality)],[3,6]),
    [iquote('0:Res:3.1,6.0')] ).

cnf(10,plain,
    equal(response(a,response(b,u)),response(c,u)),
    inference(spr,[status(thm),theory(equality)],[5,1]),
    [iquote('0:SpR:5.0,1.0')] ).

cnf(17,plain,
    ( ~ agreeable(u)
    | equal(response(u,common_bird(compose(v,w))),response(v,response(w,common_bird(compose(v,w))))) ),
    inference(spr,[status(thm),theory(equality)],[2,1]),
    [iquote('0:SpR:2.1,1.0')] ).

cnf(109,plain,
    ( ~ agreeable(u)
    | ~ equal(response(u,common_bird(compose(compatible(a),v))),response(a,response(v,common_bird(compose(compatible(a),v))))) ),
    inference(spl,[status(thm),theory(equality)],[17,7]),
    [iquote('0:SpL:17.1,7.0')] ).

cnf(147,plain,
    ( ~ agreeable(u)
    | ~ equal(response(u,common_bird(compose(compatible(a),b))),response(c,common_bird(compose(compatible(a),b)))) ),
    inference(spl,[status(thm),theory(equality)],[10,109]),
    [iquote('0:SpL:10.0,109.1')] ).

cnf(155,plain,
    ~ agreeable(c),
    inference(eqr,[status(thm),theory(equality)],[147]),
    [iquote('0:EqR:147.1')] ).

cnf(164,plain,
    $false,
    inference(ssi,[status(thm)],[155,4]),
    [iquote('0:SSi:155.0,4.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : COL052-2 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n020.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue May 31 15:42:23 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.42  
% 0.19/0.42  SPASS V 3.9 
% 0.19/0.42  SPASS beiseite: Proof found.
% 0.19/0.42  % SZS status Theorem
% 0.19/0.42  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.42  SPASS derived 106 clauses, backtracked 0 clauses, performed 0 splits and kept 45 clauses.
% 0.19/0.42  SPASS allocated 75833 KBytes.
% 0.19/0.42  SPASS spent	0:00:00.08 on the problem.
% 0.19/0.42  		0:00:00.04 for the input.
% 0.19/0.42  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.42  		0:00:00.00 for inferences.
% 0.19/0.42  		0:00:00.00 for the backtracking.
% 0.19/0.42  		0:00:00.01 for the reduction.
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  Here is a proof with depth 4, length 13 :
% 0.19/0.42  % SZS output start Refutation
% See solution above
% 0.19/0.42  Formulae used in the proof : composer_exists agreeable1 agreeable2 c_is_agreeable c_composes_a_with_b prove_a_is_agreeable
% 0.19/0.42  
%------------------------------------------------------------------------------