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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN569-1 : TPTP v8.1.0. Released v2.5.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 : Thu Jul 21 12:22:56 EDT 2022

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

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

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

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

cnf(6,axiom,
    p9(c13,c15,c14),
    file('SYN569-1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ p8(u,v)
    | p10(u,v) ),
    file('SYN569-1.p',unknown),
    [] ).

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

cnf(11,axiom,
    ( ~ p9(u,v,w)
    | ~ p9(u,x,w)
    | p2(x,v) ),
    file('SYN569-1.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ p10(u,c12)
    | ~ p10(c11,u)
    | p9(c13,f3(u),u) ),
    file('SYN569-1.p',unknown),
    [] ).

cnf(15,axiom,
    p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),c15)),
    file('SYN569-1.p',unknown),
    [] ).

cnf(16,axiom,
    ( ~ p2(u,v)
    | ~ p2(w,x)
    | p2(f4(w,u),f4(x,v)) ),
    file('SYN569-1.p',unknown),
    [] ).

cnf(20,axiom,
    ( ~ p8(u,c12)
    | ~ p8(c11,u)
    | ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(u))) ),
    file('SYN569-1.p',unknown),
    [] ).

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

cnf(29,plain,
    p2(f4(f5(c12,c11),c15),f5(f7(c13,c12),f7(c13,c11))),
    inference(res,[status(thm),theory(equality)],[15,22]),
    [iquote('0:Res:15.0,22.0')] ).

cnf(44,plain,
    ( ~ p9(c13,u,c14)
    | p2(u,c15) ),
    inference(res,[status(thm),theory(equality)],[6,11]),
    [iquote('0:Res:6.0,11.0')] ).

cnf(47,plain,
    ( ~ p10(c14,c12)
    | ~ p10(c11,c14)
    | p2(f3(c14),c15) ),
    inference(res,[status(thm),theory(equality)],[12,44]),
    [iquote('0:Res:12.2,44.0')] ).

cnf(49,plain,
    ( ~ p10(c14,c12)
    | ~ p10(c11,c14)
    | p2(c15,f3(c14)) ),
    inference(res,[status(thm),theory(equality)],[47,22]),
    [iquote('0:Res:47.2,22.0')] ).

cnf(134,plain,
    ( ~ p2(u,v)
    | ~ p2(w,x)
    | ~ p2(f4(w,u),y)
    | p2(y,f4(x,v)) ),
    inference(res,[status(thm),theory(equality)],[16,10]),
    [iquote('0:Res:16.2,10.0')] ).

cnf(671,plain,
    ( ~ p2(c15,u)
    | ~ p2(f5(c12,c11),v)
    | p2(f5(f7(c13,c12),f7(c13,c11)),f4(v,u)) ),
    inference(res,[status(thm),theory(equality)],[29,134]),
    [iquote('0:Res:29.0,134.2')] ).

cnf(4201,plain,
    ( ~ p2(c15,f3(u))
    | ~ p2(f5(c12,c11),f5(c12,c11))
    | ~ p8(u,c12)
    | ~ p8(c11,u) ),
    inference(res,[status(thm),theory(equality)],[671,20]),
    [iquote('0:Res:671.2,20.2')] ).

cnf(4207,plain,
    ( ~ p2(c15,f3(u))
    | ~ p8(u,c12)
    | ~ p8(c11,u) ),
    inference(mrr,[status(thm)],[4201,1]),
    [iquote('0:MRR:4201.1,1.0')] ).

cnf(4211,plain,
    ( ~ p10(c14,c12)
    | ~ p10(c11,c14)
    | ~ p8(c14,c12)
    | ~ p8(c11,c14) ),
    inference(res,[status(thm),theory(equality)],[49,4207]),
    [iquote('0:Res:49.2,4207.0')] ).

cnf(4217,plain,
    $false,
    inference(mrr,[status(thm)],[4211,7,3,5]),
    [iquote('0:MRR:4211.0,4211.1,4211.2,4211.3,7.1,7.1,3.0,5.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SYN569-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n007.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 : Mon Jul 11 20:57:48 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 2.87/3.09  
% 2.87/3.09  SPASS V 3.9 
% 2.87/3.09  SPASS beiseite: Proof found.
% 2.87/3.09  % SZS status Theorem
% 2.87/3.09  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 2.87/3.09  SPASS derived 4143 clauses, backtracked 0 clauses, performed 0 splits and kept 2107 clauses.
% 2.87/3.09  SPASS allocated 66562 KBytes.
% 2.87/3.09  SPASS spent	0:00:02.71 on the problem.
% 2.87/3.09  		0:00:00.03 for the input.
% 2.87/3.09  		0:00:00.00 for the FLOTTER CNF translation.
% 2.87/3.09  		0:00:00.06 for inferences.
% 2.87/3.09  		0:00:00.00 for the backtracking.
% 2.87/3.09  		0:00:02.59 for the reduction.
% 2.87/3.09  
% 2.87/3.09  
% 2.87/3.09  Here is a proof with depth 5, length 22 :
% 2.87/3.09  % SZS output start Refutation
% See solution above
% 2.87/3.09  Formulae used in the proof : p2_1 p8_3 p8_5 p9_6 p10_7 p2_10 p2_11 p9_12 p2_15 p2_16 not_p8_20
% 2.87/3.09  
%------------------------------------------------------------------------------