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

View Problem - Process Solution

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

% Computer : n028.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:24 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    p15(f3(c19)),
    file('SYN642-1.p',unknown),
    [] ).

cnf(2,axiom,
    p15(f3(c18)),
    file('SYN642-1.p',unknown),
    [] ).

cnf(4,axiom,
    p6(u,u),
    file('SYN642-1.p',unknown),
    [] ).

cnf(9,axiom,
    p6(f8(f3(c19)),f8(c19)),
    file('SYN642-1.p',unknown),
    [] ).

cnf(14,axiom,
    p6(f8(f3(c18)),f8(c18)),
    file('SYN642-1.p',unknown),
    [] ).

cnf(23,axiom,
    ( ~ p6(u,v)
    | ~ p6(u,w)
    | p6(w,v) ),
    file('SYN642-1.p',unknown),
    [] ).

cnf(28,axiom,
    ~ p6(f8(f10(f3(c19),f3(c18))),f9(f8(c19),f8(c18))),
    file('SYN642-1.p',unknown),
    [] ).

cnf(33,axiom,
    ( ~ p6(u,v)
    | ~ p6(w,x)
    | p6(f9(u,w),f9(v,x)) ),
    file('SYN642-1.p',unknown),
    [] ).

cnf(36,axiom,
    ( ~ p15(u)
    | ~ p15(v)
    | p6(f8(f10(v,u)),f9(f8(v),f8(u))) ),
    file('SYN642-1.p',unknown),
    [] ).

cnf(104,plain,
    ( ~ p6(u,v)
    | p6(v,u) ),
    inference(res,[status(thm),theory(equality)],[4,23]),
    [iquote('0:Res:4.0,23.0')] ).

cnf(238,plain,
    ( ~ p6(u,v)
    | ~ p6(w,x)
    | ~ p6(f9(u,w),y)
    | p6(y,f9(v,x)) ),
    inference(res,[status(thm),theory(equality)],[33,23]),
    [iquote('0:Res:33.2,23.0')] ).

cnf(275,plain,
    ( ~ p15(u)
    | ~ p15(v)
    | p6(f9(f8(v),f8(u)),f8(f10(v,u))) ),
    inference(res,[status(thm),theory(equality)],[36,104]),
    [iquote('0:Res:36.2,104.0')] ).

cnf(938,plain,
    ( ~ p15(u)
    | ~ p15(v)
    | ~ p6(f8(v),w)
    | ~ p6(f8(u),x)
    | p6(f8(f10(v,u)),f9(w,x)) ),
    inference(res,[status(thm),theory(equality)],[275,238]),
    [iquote('0:Res:275.2,238.2')] ).

cnf(11986,plain,
    ( ~ p15(f3(c18))
    | ~ p15(f3(c19))
    | ~ p6(f8(f3(c19)),f8(c19))
    | ~ p6(f8(f3(c18)),f8(c18)) ),
    inference(res,[status(thm),theory(equality)],[938,28]),
    [iquote('0:Res:938.4,28.0')] ).

cnf(11995,plain,
    ( ~ p6(f8(f3(c19)),f8(c19))
    | ~ p6(f8(f3(c18)),f8(c18)) ),
    inference(ssi,[status(thm)],[11986,1,2]),
    [iquote('0:SSi:11986.1,11986.0,1.0,2.0')] ).

cnf(11996,plain,
    $false,
    inference(mrr,[status(thm)],[11995,9,14]),
    [iquote('0:MRR:11995.0,11995.1,9.0,14.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SYN642-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.11/0.32  % Computer : n028.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Mon Jul 11 21:55:14 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 7.56/7.79  
% 7.56/7.79  SPASS V 3.9 
% 7.56/7.79  SPASS beiseite: Proof found.
% 7.56/7.79  % SZS status Theorem
% 7.56/7.79  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 7.56/7.79  SPASS derived 11642 clauses, backtracked 0 clauses, performed 0 splits and kept 5950 clauses.
% 7.56/7.79  SPASS allocated 83419 KBytes.
% 7.56/7.79  SPASS spent	0:00:07.39 on the problem.
% 7.56/7.79  		0:00:00.03 for the input.
% 7.56/7.79  		0:00:00.00 for the FLOTTER CNF translation.
% 7.56/7.79  		0:00:00.13 for inferences.
% 7.56/7.79  		0:00:00.00 for the backtracking.
% 7.56/7.79  		0:00:07.13 for the reduction.
% 7.56/7.79  
% 7.56/7.79  
% 7.56/7.79  Here is a proof with depth 4, length 16 :
% 7.56/7.79  % SZS output start Refutation
% See solution above
% 7.56/7.79  Formulae used in the proof : f3_is_p15_1 f3_is_p15_2 p6_4 p6_9 p6_14 p6_23 not_p6_28 p6_33 p6_36
% 7.56/7.79  
%------------------------------------------------------------------------------