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

View Problem - Process Solution

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

% Computer : n008.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 6.95s 7.13s
% Output   : Refutation 6.95s
% 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('SYN643-1.p',unknown),
    [] ).

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

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

cnf(10,axiom,
    p4(f5(f3(c18)),f5(c18)),
    file('SYN643-1.p',unknown),
    [] ).

cnf(11,axiom,
    p4(f5(f3(c19)),f5(c19)),
    file('SYN643-1.p',unknown),
    [] ).

cnf(24,axiom,
    ( ~ p4(u,v)
    | ~ p4(u,w)
    | p4(w,v) ),
    file('SYN643-1.p',unknown),
    [] ).

cnf(28,axiom,
    ~ p4(f5(f10(f3(c19),f3(c18))),f9(f5(c19),f5(c18))),
    file('SYN643-1.p',unknown),
    [] ).

cnf(35,axiom,
    ( ~ p4(u,v)
    | ~ p4(w,x)
    | p4(f9(u,w),f9(v,x)) ),
    file('SYN643-1.p',unknown),
    [] ).

cnf(37,axiom,
    ( ~ p15(u)
    | ~ p15(v)
    | p4(f5(f10(v,u)),f9(f5(v),f5(u))) ),
    file('SYN643-1.p',unknown),
    [] ).

cnf(69,plain,
    ( ~ p4(u,v)
    | p4(v,u) ),
    inference(res,[status(thm),theory(equality)],[5,24]),
    [iquote('0:Res:5.0,24.0')] ).

cnf(189,plain,
    ( ~ p4(u,v)
    | ~ p4(w,x)
    | ~ p4(f9(u,w),y)
    | p4(y,f9(v,x)) ),
    inference(res,[status(thm),theory(equality)],[35,24]),
    [iquote('0:Res:35.2,24.0')] ).

cnf(242,plain,
    ( ~ p15(u)
    | ~ p15(v)
    | p4(f9(f5(v),f5(u)),f5(f10(v,u))) ),
    inference(res,[status(thm),theory(equality)],[37,69]),
    [iquote('0:Res:37.2,69.0')] ).

cnf(879,plain,
    ( ~ p15(u)
    | ~ p15(v)
    | ~ p4(f5(v),w)
    | ~ p4(f5(u),x)
    | p4(f5(f10(v,u)),f9(w,x)) ),
    inference(res,[status(thm),theory(equality)],[242,189]),
    [iquote('0:Res:242.2,189.2')] ).

cnf(11635,plain,
    ( ~ p15(f3(c18))
    | ~ p15(f3(c19))
    | ~ p4(f5(f3(c19)),f5(c19))
    | ~ p4(f5(f3(c18)),f5(c18)) ),
    inference(res,[status(thm),theory(equality)],[879,28]),
    [iquote('0:Res:879.4,28.0')] ).

cnf(11644,plain,
    ( ~ p4(f5(f3(c19)),f5(c19))
    | ~ p4(f5(f3(c18)),f5(c18)) ),
    inference(ssi,[status(thm)],[11635,1,2]),
    [iquote('0:SSi:11635.1,11635.0,1.0,2.0')] ).

cnf(11645,plain,
    $false,
    inference(mrr,[status(thm)],[11644,11,10]),
    [iquote('0:MRR:11644.0,11644.1,11.0,10.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN643-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n008.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jul 12 01:52:08 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 6.95/7.13  
% 6.95/7.13  SPASS V 3.9 
% 6.95/7.13  SPASS beiseite: Proof found.
% 6.95/7.13  % SZS status Theorem
% 6.95/7.13  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 6.95/7.13  SPASS derived 11307 clauses, backtracked 0 clauses, performed 0 splits and kept 5779 clauses.
% 6.95/7.13  SPASS allocated 83255 KBytes.
% 6.95/7.13  SPASS spent	0:00:06.71 on the problem.
% 6.95/7.13  		0:00:00.04 for the input.
% 6.95/7.13  		0:00:00.00 for the FLOTTER CNF translation.
% 6.95/7.13  		0:00:00.12 for inferences.
% 6.95/7.13  		0:00:00.00 for the backtracking.
% 6.95/7.13  		0:00:06.45 for the reduction.
% 6.95/7.13  
% 6.95/7.13  
% 6.95/7.13  Here is a proof with depth 4, length 16 :
% 6.95/7.13  % SZS output start Refutation
% See solution above
% 6.95/7.13  Formulae used in the proof : f3_is_p15_1 f3_is_p15_2 p4_5 p4_10 p4_11 p4_24 not_p4_28 p4_35 p4_37
% 6.95/7.13  
%------------------------------------------------------------------------------