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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN561-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n004.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 : Thu Jul 21 12:22:53 EDT 2022

% Result   : Unsatisfiable 60.36s 60.57s
% Output   : Refutation 60.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   17 (   9 unt;   0 nHn;  17 RR)
%            Number of literals    :   31 (   0 equ;  18 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;  10 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    p2(u,u),
    file('SYN561-1.p',unknown),
    [] ).

cnf(2,axiom,
    p9(c14,c10),
    file('SYN561-1.p',unknown),
    [] ).

cnf(3,axiom,
    p8(c11,c14),
    file('SYN561-1.p',unknown),
    [] ).

cnf(4,axiom,
    p2(f7(c10,c14),c15),
    file('SYN561-1.p',unknown),
    [] ).

cnf(5,axiom,
    p2(f6(c15,c11),c16),
    file('SYN561-1.p',unknown),
    [] ).

cnf(6,axiom,
    p2(f3(f4(f5(c12)),c13),c16),
    file('SYN561-1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ p2(u,v)
    | ~ p2(u,w)
    | p2(w,v) ),
    file('SYN561-1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ p9(u,c10)
    | ~ p8(c11,u)
    | ~ p2(f6(v,c11),f3(f4(f5(c12)),c13))
    | ~ p2(f7(c10,u),v) ),
    file('SYN561-1.p',unknown),
    [] ).

cnf(16,plain,
    ( ~ p2(u,v)
    | p2(v,u) ),
    inference(res,[status(thm),theory(equality)],[1,9]),
    [iquote('0:Res:1.0,9.0')] ).

cnf(24,plain,
    p2(c16,f6(c15,c11)),
    inference(res,[status(thm),theory(equality)],[5,16]),
    [iquote('0:Res:5.0,16.0')] ).

cnf(25,plain,
    p2(c16,f3(f4(f5(c12)),c13)),
    inference(res,[status(thm),theory(equality)],[6,16]),
    [iquote('0:Res:6.0,16.0')] ).

cnf(31,plain,
    ( ~ p2(c16,u)
    | p2(u,f6(c15,c11)) ),
    inference(res,[status(thm),theory(equality)],[24,9]),
    [iquote('0:Res:24.0,9.0')] ).

cnf(44,plain,
    ( ~ p2(c16,u)
    | p2(f6(c15,c11),u) ),
    inference(res,[status(thm),theory(equality)],[31,16]),
    [iquote('0:Res:31.1,16.0')] ).

cnf(126,plain,
    ( ~ p2(c16,f3(f4(f5(c12)),c13))
    | ~ p9(u,c10)
    | ~ p8(c11,u)
    | ~ p2(f7(c10,u),c15) ),
    inference(res,[status(thm),theory(equality)],[44,15]),
    [iquote('0:Res:44.1,15.2')] ).

cnf(127,plain,
    ( ~ p9(u,c10)
    | ~ p8(c11,u)
    | ~ p2(f7(c10,u),c15) ),
    inference(mrr,[status(thm)],[126,25]),
    [iquote('0:MRR:126.0,25.0')] ).

cnf(17288,plain,
    ( ~ p9(c14,c10)
    | ~ p8(c11,c14) ),
    inference(res,[status(thm),theory(equality)],[4,127]),
    [iquote('0:Res:4.0,127.2')] ).

cnf(17293,plain,
    $false,
    inference(mrr,[status(thm)],[17288,2,3]),
    [iquote('0:MRR:17288.0,17288.1,2.0,3.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SYN561-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.11/0.33  % Computer : n004.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Mon Jul 11 12:58:37 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 60.36/60.57  
% 60.36/60.57  SPASS V 3.9 
% 60.36/60.57  SPASS beiseite: Proof found.
% 60.36/60.57  % SZS status Theorem
% 60.36/60.57  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 60.36/60.57  SPASS derived 17255 clauses, backtracked 0 clauses, performed 0 splits and kept 13614 clauses.
% 60.36/60.57  SPASS allocated 75461 KBytes.
% 60.36/60.57  SPASS spent	0:01:00.06 on the problem.
% 60.36/60.57  		0:00:00.04 for the input.
% 60.36/60.57  		0:00:00.00 for the FLOTTER CNF translation.
% 60.36/60.57  		0:00:00.18 for inferences.
% 60.36/60.57  		0:00:00.00 for the backtracking.
% 60.36/60.57  		0:0:59.76 for the reduction.
% 60.36/60.57  
% 60.36/60.57  
% 60.36/60.57  Here is a proof with depth 6, length 17 :
% 60.36/60.57  % SZS output start Refutation
% See solution above
% 60.36/60.57  Formulae used in the proof : p2_1 p9_2 p8_3 p2_4 p2_5 p2_6 p2_9 not_p9_15
% 60.36/60.57  
%------------------------------------------------------------------------------