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

View Problem - Process Solution

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

% Computer : n029.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:43 EDT 2022

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

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

cnf(12,axiom,
    p2(u,u),
    file('SYN695-1.p',unknown),
    [] ).

cnf(18,axiom,
    p2(c44,c45),
    file('SYN695-1.p',unknown),
    [] ).

cnf(30,axiom,
    ( ~ p2(u,v)
    | p3(f4(u),f4(v)) ),
    file('SYN695-1.p',unknown),
    [] ).

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

cnf(54,axiom,
    p2(f11(f4(f23(c44,f9(f20(c37)))),c43),f11(f4(c44),c43)),
    file('SYN695-1.p',unknown),
    [] ).

cnf(55,axiom,
    ~ p2(f11(f4(c45),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)),
    file('SYN695-1.p',unknown),
    [] ).

cnf(61,axiom,
    ( ~ p3(u,v)
    | ~ p10(w,x)
    | p2(f11(u,w),f11(v,x)) ),
    file('SYN695-1.p',unknown),
    [] ).

cnf(172,plain,
    ( ~ p2(u,v)
    | p2(v,u) ),
    inference(res,[status(thm),theory(equality)],[12,41]),
    [iquote('0:Res:12.0,41.0')] ).

cnf(189,plain,
    p2(f11(f4(c44),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)),
    inference(res,[status(thm),theory(equality)],[54,172]),
    [iquote('0:Res:54.0,172.0')] ).

cnf(437,plain,
    ( ~ p2(f11(f4(c44),c43),u)
    | p2(u,f11(f4(f23(c44,f9(f20(c37)))),c43)) ),
    inference(res,[status(thm),theory(equality)],[189,41]),
    [iquote('0:Res:189.0,41.0')] ).

cnf(17239,plain,
    ~ p2(f11(f4(c44),c43),f11(f4(c45),c43)),
    inference(res,[status(thm),theory(equality)],[437,55]),
    [iquote('0:Res:437.1,55.0')] ).

cnf(17271,plain,
    ( ~ p3(f4(c44),f4(c45))
    | ~ p10(c43,c43) ),
    inference(res,[status(thm),theory(equality)],[61,17239]),
    [iquote('0:Res:61.2,17239.0')] ).

cnf(17276,plain,
    ~ p3(f4(c44),f4(c45)),
    inference(mrr,[status(thm)],[17271,7]),
    [iquote('0:MRR:17271.1,7.0')] ).

cnf(17329,plain,
    ~ p2(c44,c45),
    inference(res,[status(thm),theory(equality)],[30,17276]),
    [iquote('0:Res:30.1,17276.0')] ).

cnf(17335,plain,
    $false,
    inference(mrr,[status(thm)],[17329,18]),
    [iquote('0:MRR:17329.0,18.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SYN695-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n029.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 03:36:17 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 32.35/32.58  
% 32.35/32.58  SPASS V 3.9 
% 32.35/32.58  SPASS beiseite: Proof found.
% 32.35/32.58  % SZS status Theorem
% 32.35/32.58  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 32.35/32.58  SPASS derived 17067 clauses, backtracked 0 clauses, performed 0 splits and kept 10241 clauses.
% 32.35/32.58  SPASS allocated 87553 KBytes.
% 32.35/32.58  SPASS spent	0:0:32.07 on the problem.
% 32.35/32.58  		0:00:00.04 for the input.
% 32.35/32.58  		0:00:00.00 for the FLOTTER CNF translation.
% 32.35/32.58  		0:00:00.20 for inferences.
% 32.35/32.58  		0:00:00.00 for the backtracking.
% 32.35/32.58  		0:0:31.61 for the reduction.
% 32.35/32.58  
% 32.35/32.58  
% 32.35/32.58  Here is a proof with depth 6, length 16 :
% 32.35/32.58  % SZS output start Refutation
% See solution above
% 32.35/32.58  Formulae used in the proof : p10_7 p2_12 p2_18 p3_30 p2_41 p2_54 not_p2_55 p2_61
% 32.35/32.58  
%------------------------------------------------------------------------------