↑ Up

SPASS---3.9.UNS-Ref.s

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

% Computer : n013.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:41 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(15,axiom,
    p22(u,u),
    file('SYN691-1.p',unknown),
    [] ).

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

cnf(43,axiom,
    ~ p39(f5(c40,f10(f13(f15(c42,c43),c44),c45)),c46),
    file('SYN691-1.p',unknown),
    [] ).

cnf(44,axiom,
    ( ~ p39(f17(f19(f21(c47,u),v),w),x)
    | p39(u,x) ),
    file('SYN691-1.p',unknown),
    [] ).

cnf(45,axiom,
    ( ~ p22(u,v)
    | ~ p4(w,x)
    | ~ p39(w,u)
    | p39(x,v) ),
    file('SYN691-1.p',unknown),
    [] ).

cnf(46,axiom,
    p39(f5(c40,f7(c41,f10(f13(f15(c42,c43),c44),c45))),c46),
    file('SYN691-1.p',unknown),
    [] ).

cnf(50,axiom,
    ( ~ p3(u,v)
    | ~ p2(w,x)
    | p4(f5(w,u),f5(x,v)) ),
    file('SYN691-1.p',unknown),
    [] ).

cnf(63,axiom,
    ( ~ p39(f5(c40,f10(f13(f15(c42,u),v),w)),x)
    | p39(u,x) ),
    file('SYN691-1.p',unknown),
    [] ).

cnf(64,axiom,
    ( ~ p39(u,v)
    | p39(f5(c40,f10(f13(f15(c42,u),w),x)),v) ),
    file('SYN691-1.p',unknown),
    [] ).

cnf(67,axiom,
    p3(f7(c41,f10(f13(f15(c42,u),v),w)),f10(f13(f15(c42,f17(f19(f21(c47,u),v),w)),f26(f28(f30(c48,u),v),w)),f34(f36(f38(c49,u),v),w))),
    file('SYN691-1.p',unknown),
    [] ).

cnf(109,plain,
    ~ p39(c43,c46),
    inference(res,[status(thm),theory(equality)],[64,43]),
    [iquote('0:Res:64.1,43.0')] ).

cnf(142,plain,
    ( ~ p4(u,v)
    | ~ p39(u,w)
    | p39(v,w) ),
    inference(res,[status(thm),theory(equality)],[15,45]),
    [iquote('0:Res:15.0,45.0')] ).

cnf(144,plain,
    ( ~ p3(u,v)
    | ~ p2(w,x)
    | ~ p39(f5(w,u),y)
    | p39(f5(x,v),y) ),
    inference(res,[status(thm),theory(equality)],[50,142]),
    [iquote('0:Res:50.2,142.0')] ).

cnf(236,plain,
    ( ~ p3(f7(c41,f10(f13(f15(c42,c43),c44),c45)),u)
    | ~ p2(c40,v)
    | p39(f5(v,u),c46) ),
    inference(res,[status(thm),theory(equality)],[46,144]),
    [iquote('0:Res:46.0,144.2')] ).

cnf(320,plain,
    ( ~ p2(c40,u)
    | p39(f5(u,f10(f13(f15(c42,f17(f19(f21(c47,c43),c44),c45)),f26(f28(f30(c48,c43),c44),c45)),f34(f36(f38(c49,c43),c44),c45))),c46) ),
    inference(res,[status(thm),theory(equality)],[67,236]),
    [iquote('0:Res:67.0,236.0')] ).

cnf(7972,plain,
    ( ~ p2(c40,c40)
    | p39(f17(f19(f21(c47,c43),c44),c45),c46) ),
    inference(res,[status(thm),theory(equality)],[320,63]),
    [iquote('0:Res:320.1,63.0')] ).

cnf(7981,plain,
    p39(f17(f19(f21(c47,c43),c44),c45),c46),
    inference(mrr,[status(thm)],[7972,17]),
    [iquote('0:MRR:7972.0,17.0')] ).

cnf(7988,plain,
    p39(c43,c46),
    inference(res,[status(thm),theory(equality)],[7981,44]),
    [iquote('0:Res:7981.0,44.0')] ).

cnf(8005,plain,
    $false,
    inference(mrr,[status(thm)],[7988,109]),
    [iquote('0:MRR:7988.0,109.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN691-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n013.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 : Mon Jul 11 13:19:14 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 10.84/11.01  
% 10.84/11.01  SPASS V 3.9 
% 10.84/11.01  SPASS beiseite: Proof found.
% 10.84/11.01  % SZS status Theorem
% 10.84/11.01  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 10.84/11.01  SPASS derived 7911 clauses, backtracked 0 clauses, performed 0 splits and kept 6211 clauses.
% 10.84/11.01  SPASS allocated 76393 KBytes.
% 10.84/11.01  SPASS spent	0:0:10.53 on the problem.
% 10.84/11.01  		0:00:00.04 for the input.
% 10.84/11.01  		0:00:00.00 for the FLOTTER CNF translation.
% 10.84/11.01  		0:00:00.21 for inferences.
% 10.84/11.01  		0:00:00.00 for the backtracking.
% 10.84/11.01  		0:0:10.12 for the reduction.
% 10.84/11.01  
% 10.84/11.01  
% 10.84/11.01  Here is a proof with depth 6, length 19 :
% 10.84/11.01  % SZS output start Refutation
% See solution above
% 10.84/11.01  Formulae used in the proof : p22_15 p2_17 not_p39_43 p39_44 p39_45 p39_46 p4_50 p39_63 p39_64 p3_67
% 10.84/11.01  
%------------------------------------------------------------------------------