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

View Problem - Process Solution

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

% Computer : n010.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:30 EDT 2022

% Result   : Unsatisfiable 2.54s 2.72s
% Output   : Refutation 2.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   15 (   7 unt;   0 nHn;  15 RR)
%            Number of literals    :   29 (   0 equ;  16 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;  10 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    p7(u,u),
    file('SYN659-1.p',unknown),
    [] ).

cnf(10,axiom,
    p12(u,u),
    file('SYN659-1.p',unknown),
    [] ).

cnf(27,axiom,
    p24(f15(c29,f13(c40,c41)),f13(c32,c33)),
    file('SYN659-1.p',unknown),
    [] ).

cnf(29,axiom,
    p12(f13(f16(c39),f17(c39)),f13(c40,c41)),
    file('SYN659-1.p',unknown),
    [] ).

cnf(38,axiom,
    ( ~ p12(u,v)
    | ~ p12(u,w)
    | p12(w,v) ),
    file('SYN659-1.p',unknown),
    [] ).

cnf(39,axiom,
    ~ p24(f15(c29,f13(f16(c39),f17(c39))),f13(c32,c33)),
    file('SYN659-1.p',unknown),
    [] ).

cnf(41,axiom,
    ( ~ p12(u,v)
    | ~ p24(w,u)
    | ~ p14(w,x)
    | p24(x,v) ),
    file('SYN659-1.p',unknown),
    [] ).

cnf(45,axiom,
    ( ~ p7(u,v)
    | ~ p12(w,x)
    | p14(f15(u,w),f15(v,x)) ),
    file('SYN659-1.p',unknown),
    [] ).

cnf(97,plain,
    ( ~ p12(u,v)
    | p12(v,u) ),
    inference(res,[status(thm),theory(equality)],[10,38]),
    [iquote('0:Res:10.0,38.0')] ).

cnf(100,plain,
    p12(f13(c40,c41),f13(f16(c39),f17(c39))),
    inference(res,[status(thm),theory(equality)],[29,97]),
    [iquote('0:Res:29.0,97.0')] ).

cnf(276,plain,
    ( ~ p24(u,v)
    | ~ p14(u,w)
    | p24(w,v) ),
    inference(res,[status(thm),theory(equality)],[10,41]),
    [iquote('0:Res:10.0,41.0')] ).

cnf(415,plain,
    ( ~ p14(f15(c29,f13(c40,c41)),u)
    | p24(u,f13(c32,c33)) ),
    inference(res,[status(thm),theory(equality)],[27,276]),
    [iquote('0:Res:27.0,276.0')] ).

cnf(1515,plain,
    ( ~ p7(c29,u)
    | ~ p12(f13(c40,c41),v)
    | p24(f15(u,v),f13(c32,c33)) ),
    inference(res,[status(thm),theory(equality)],[45,415]),
    [iquote('0:Res:45.2,415.0')] ).

cnf(8372,plain,
    ( ~ p7(c29,c29)
    | ~ p12(f13(c40,c41),f13(f16(c39),f17(c39))) ),
    inference(res,[status(thm),theory(equality)],[1515,39]),
    [iquote('0:Res:1515.2,39.0')] ).

cnf(8381,plain,
    $false,
    inference(mrr,[status(thm)],[8372,3,100]),
    [iquote('0:MRR:8372.0,8372.1,3.0,100.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN659-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n010.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 02:10:45 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 2.54/2.72  
% 2.54/2.72  SPASS V 3.9 
% 2.54/2.72  SPASS beiseite: Proof found.
% 2.54/2.72  % SZS status Theorem
% 2.54/2.72  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 2.54/2.72  SPASS derived 8088 clauses, backtracked 0 clauses, performed 3 splits and kept 4630 clauses.
% 2.54/2.72  SPASS allocated 80548 KBytes.
% 2.54/2.72  SPASS spent	0:00:02.34 on the problem.
% 2.54/2.72  		0:00:00.03 for the input.
% 2.54/2.72  		0:00:00.00 for the FLOTTER CNF translation.
% 2.54/2.72  		0:00:00.07 for inferences.
% 2.54/2.72  		0:00:00.01 for the backtracking.
% 2.54/2.72  		0:00:02.18 for the reduction.
% 2.54/2.72  
% 2.54/2.72  
% 2.54/2.72  Here is a proof with depth 4, length 15 :
% 2.54/2.72  % SZS output start Refutation
% See solution above
% 2.54/2.72  Formulae used in the proof : p7_3 p12_10 p24_27 p12_29 p12_38 not_p24_39 p24_41 p14_45
% 2.54/2.72  
%------------------------------------------------------------------------------