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

View Problem - Process Solution

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

% Computer : n018.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:23:15 EDT 2022

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

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

cnf(5,axiom,
    p11(u,u),
    file('SYN620-1.p',unknown),
    [] ).

cnf(18,axiom,
    ( ~ p10(u,v)
    | p11(f12(u),f12(v)) ),
    file('SYN620-1.p',unknown),
    [] ).

cnf(19,axiom,
    ( ~ p10(u,v)
    | ~ p10(u,w)
    | p10(w,v) ),
    file('SYN620-1.p',unknown),
    [] ).

cnf(24,axiom,
    p10(f13(f6(c22),u),f13(f6(c24),f16(c26,u))),
    file('SYN620-1.p',unknown),
    [] ).

cnf(28,axiom,
    ( ~ p11(u,v)
    | ~ p20(u,w)
    | ~ p11(w,x)
    | p20(v,x) ),
    file('SYN620-1.p',unknown),
    [] ).

cnf(32,axiom,
    p20(f12(f13(f6(c22),f14(f15(f7(c25))))),f12(f13(f6(c24),u))),
    file('SYN620-1.p',unknown),
    [] ).

cnf(33,axiom,
    ~ p20(f12(f13(f6(c22),f14(f15(f7(c25))))),f12(f13(f6(c22),c27))),
    file('SYN620-1.p',unknown),
    [] ).

cnf(58,plain,
    ( ~ p10(u,v)
    | p10(v,u) ),
    inference(res,[status(thm),theory(equality)],[1,19]),
    [iquote('0:Res:1.0,19.0')] ).

cnf(63,plain,
    p10(f13(f6(c24),f16(c26,u)),f13(f6(c22),u)),
    inference(res,[status(thm),theory(equality)],[24,58]),
    [iquote('0:Res:24.0,58.0')] ).

cnf(218,plain,
    ( ~ p20(u,v)
    | ~ p11(v,w)
    | p20(u,w) ),
    inference(res,[status(thm),theory(equality)],[5,28]),
    [iquote('0:Res:5.0,28.0')] ).

cnf(223,plain,
    ( ~ p11(f12(f13(f6(c24),u)),v)
    | p20(f12(f13(f6(c22),f14(f15(f7(c25))))),v) ),
    inference(res,[status(thm),theory(equality)],[32,218]),
    [iquote('0:Res:32.0,218.0')] ).

cnf(1186,plain,
    ( ~ p10(f13(f6(c24),u),v)
    | p20(f12(f13(f6(c22),f14(f15(f7(c25))))),f12(v)) ),
    inference(res,[status(thm),theory(equality)],[18,223]),
    [iquote('0:Res:18.1,223.0')] ).

cnf(7180,plain,
    p20(f12(f13(f6(c22),f14(f15(f7(c25))))),f12(f13(f6(c22),u))),
    inference(res,[status(thm),theory(equality)],[63,1186]),
    [iquote('0:Res:63.0,1186.0')] ).

cnf(7188,plain,
    $false,
    inference(unc,[status(thm)],[7180,33]),
    [iquote('0:UnC:7180.0,33.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SYN620-1 : TPTP v8.1.0. Released v2.5.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n018.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 Jul 12 01:42:44 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 3.35/3.54  
% 3.35/3.54  SPASS V 3.9 
% 3.35/3.54  SPASS beiseite: Proof found.
% 3.35/3.54  % SZS status Theorem
% 3.35/3.54  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 3.35/3.54  SPASS derived 7104 clauses, backtracked 0 clauses, performed 0 splits and kept 4945 clauses.
% 3.35/3.54  SPASS allocated 80293 KBytes.
% 3.35/3.54  SPASS spent	0:00:03.18 on the problem.
% 3.35/3.54  		0:00:00.04 for the input.
% 3.35/3.54  		0:00:00.00 for the FLOTTER CNF translation.
% 3.35/3.54  		0:00:00.07 for inferences.
% 3.35/3.54  		0:00:00.00 for the backtracking.
% 3.35/3.54  		0:00:03.01 for the reduction.
% 3.35/3.54  
% 3.35/3.54  
% 3.35/3.54  Here is a proof with depth 4, length 15 :
% 3.35/3.54  % SZS output start Refutation
% See solution above
% 3.35/3.54  Formulae used in the proof : p10_1 p11_5 p11_18 p10_19 p10_24 p20_28 p20_32 not_p20_33
% 3.35/3.54  
%------------------------------------------------------------------------------