↑ Up

SPASS---3.9.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN602-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n027.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:09 EDT 2022

% Result   : Unsatisfiable 86.15s 86.36s
% Output   : Refutation 86.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   15 (   8 unt;   0 nHn;  15 RR)
%            Number of literals    :   30 (   0 equ;  18 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;  11 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    p2(u,u),
    file('SYN602-1.p',unknown),
    [] ).

cnf(3,axiom,
    p15(c22,c21),
    file('SYN602-1.p',unknown),
    [] ).

cnf(4,axiom,
    p2(f3(c18),c19),
    file('SYN602-1.p',unknown),
    [] ).

cnf(5,axiom,
    p2(c22,f9(c20,c23)),
    file('SYN602-1.p',unknown),
    [] ).

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

cnf(16,axiom,
    p2(f7(f8(c21,c22),c20),f6(f5(c18),f3(c18))),
    file('SYN602-1.p',unknown),
    [] ).

cnf(21,axiom,
    ( ~ p2(u,v)
    | ~ p2(w,x)
    | p2(f6(w,u),f6(x,v)) ),
    file('SYN602-1.p',unknown),
    [] ).

cnf(26,axiom,
    ( ~ p15(u,c21)
    | ~ p2(u,f9(c20,v))
    | ~ p2(f7(f8(c21,u),c20),f6(f5(c18),c19)) ),
    file('SYN602-1.p',unknown),
    [] ).

cnf(43,plain,
    ( ~ p2(u,v)
    | p2(v,u) ),
    inference(res,[status(thm),theory(equality)],[2,14]),
    [iquote('0:Res:2.0,14.0')] ).

cnf(62,plain,
    p2(f6(f5(c18),f3(c18)),f7(f8(c21,c22),c20)),
    inference(res,[status(thm),theory(equality)],[16,43]),
    [iquote('0:Res:16.0,43.0')] ).

cnf(115,plain,
    ( ~ p2(u,v)
    | ~ p2(w,x)
    | ~ p2(f6(w,u),y)
    | p2(y,f6(x,v)) ),
    inference(res,[status(thm),theory(equality)],[21,14]),
    [iquote('0:Res:21.2,14.0')] ).

cnf(914,plain,
    ( ~ p2(f3(c18),u)
    | ~ p2(f5(c18),v)
    | p2(f7(f8(c21,c22),c20),f6(v,u)) ),
    inference(res,[status(thm),theory(equality)],[62,115]),
    [iquote('0:Res:62.0,115.2')] ).

cnf(26653,plain,
    ( ~ p2(f3(c18),c19)
    | ~ p2(f5(c18),f5(c18))
    | ~ p15(c22,c21)
    | ~ p2(c22,f9(c20,u)) ),
    inference(res,[status(thm),theory(equality)],[914,26]),
    [iquote('0:Res:914.2,26.2')] ).

cnf(26660,plain,
    ~ p2(c22,f9(c20,u)),
    inference(mrr,[status(thm)],[26653,4,2,3]),
    [iquote('0:MRR:26653.0,26653.1,26653.2,4.0,2.0,3.0')] ).

cnf(26661,plain,
    $false,
    inference(unc,[status(thm)],[26660,5]),
    [iquote('0:UnC:26660.0,5.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN602-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n027.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 : Mon Jul 11 23:16:34 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 86.15/86.36  
% 86.15/86.36  SPASS V 3.9 
% 86.15/86.36  SPASS beiseite: Proof found.
% 86.15/86.36  % SZS status Theorem
% 86.15/86.36  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 86.15/86.36  SPASS derived 26440 clauses, backtracked 0 clauses, performed 0 splits and kept 19965 clauses.
% 86.15/86.36  SPASS allocated 93357 KBytes.
% 86.15/86.36  SPASS spent	0:1:25.74 on the problem.
% 86.15/86.36  		0:00:00.03 for the input.
% 86.15/86.36  		0:00:00.00 for the FLOTTER CNF translation.
% 86.15/86.36  		0:00:00.26 for inferences.
% 86.15/86.36  		0:00:00.00 for the backtracking.
% 86.15/86.36  		0:1:25.20 for the reduction.
% 86.15/86.36  
% 86.15/86.36  
% 86.15/86.36  Here is a proof with depth 4, length 15 :
% 86.15/86.36  % SZS output start Refutation
% See solution above
% 86.15/86.36  Formulae used in the proof : p2_2 p15_3 p2_4 p2_5 p2_14 p2_16 p2_21 not_p15_26
% 86.15/86.36  
%------------------------------------------------------------------------------