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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN647-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:25 EDT 2022

% Result   : Unsatisfiable 17.32s 17.53s
% Output   : Refutation 17.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   20 (  14 unt;   0 nHn;  20 RR)
%            Number of literals    :   32 (   0 equ;  14 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :   10 (   3 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   7 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

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

cnf(7,axiom,
    ~ p21(f17(c25),f17(c22)),
    file('SYN647-1.p',unknown),
    [] ).

cnf(9,axiom,
    p2(f12(f11(c22)),f7(c24)),
    file('SYN647-1.p',unknown),
    [] ).

cnf(10,axiom,
    p2(f12(f11(c25)),f7(c24)),
    file('SYN647-1.p',unknown),
    [] ).

cnf(12,axiom,
    p20(f14(f11(c25)),f14(f11(c22))),
    file('SYN647-1.p',unknown),
    [] ).

cnf(14,axiom,
    p2(f13(f11(c23)),f13(f11(c22))),
    file('SYN647-1.p',unknown),
    [] ).

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

cnf(35,axiom,
    p2(f13(f11(c23)),f7(f8(f9(f8(f9(f9(f9(f9(f8(c24)))))))))),
    file('SYN647-1.p',unknown),
    [] ).

cnf(36,axiom,
    p2(f13(f11(c25)),f7(f8(f9(f8(f9(f9(f9(f9(f8(c24)))))))))),
    file('SYN647-1.p',unknown),
    [] ).

cnf(40,axiom,
    ( ~ p2(f12(f11(u)),f7(c24))
    | ~ p2(f12(f11(v)),f7(c24))
    | ~ p20(f14(f11(v)),f14(f11(u)))
    | ~ p2(f13(f11(v)),f13(f11(u)))
    | p21(f17(v),f17(u)) ),
    file('SYN647-1.p',unknown),
    [] ).

cnf(70,plain,
    ( ~ p2(u,v)
    | p2(v,u) ),
    inference(res,[status(thm),theory(equality)],[5,28]),
    [iquote('0:Res:5.0,28.0')] ).

cnf(75,plain,
    ( ~ p2(f13(f11(c23)),u)
    | p2(u,f13(f11(c22))) ),
    inference(res,[status(thm),theory(equality)],[14,28]),
    [iquote('0:Res:14.0,28.0')] ).

cnf(92,plain,
    p2(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),f13(f11(c25))),
    inference(res,[status(thm),theory(equality)],[36,70]),
    [iquote('0:Res:36.0,70.0')] ).

cnf(102,plain,
    p2(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),f13(f11(c23))),
    inference(res,[status(thm),theory(equality)],[35,70]),
    [iquote('0:Res:35.0,70.0')] ).

cnf(296,plain,
    ( ~ p2(f12(f11(c22)),f7(c24))
    | ~ p2(f12(f11(c25)),f7(c24))
    | ~ p2(f13(f11(c25)),f13(f11(c22)))
    | p21(f17(c25),f17(c22)) ),
    inference(res,[status(thm),theory(equality)],[12,40]),
    [iquote('0:Res:12.0,40.2')] ).

cnf(297,plain,
    ~ p2(f13(f11(c25)),f13(f11(c22))),
    inference(mrr,[status(thm)],[296,9,10,7]),
    [iquote('0:MRR:296.0,296.1,296.3,9.0,10.0,7.0')] ).

cnf(2069,plain,
    ( ~ p2(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),u)
    | p2(u,f13(f11(c25))) ),
    inference(res,[status(thm),theory(equality)],[92,28]),
    [iquote('0:Res:92.0,28.0')] ).

cnf(22424,plain,
    p2(f13(f11(c23)),f13(f11(c25))),
    inference(res,[status(thm),theory(equality)],[102,2069]),
    [iquote('0:Res:102.0,2069.0')] ).

cnf(22457,plain,
    p2(f13(f11(c25)),f13(f11(c22))),
    inference(res,[status(thm),theory(equality)],[22424,75]),
    [iquote('0:Res:22424.0,75.0')] ).

cnf(22466,plain,
    $false,
    inference(mrr,[status(thm)],[22457,297]),
    [iquote('0:MRR:22457.0,297.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN647-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n028.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 21:11:59 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 17.32/17.53  
% 17.32/17.53  SPASS V 3.9 
% 17.32/17.53  SPASS beiseite: Proof found.
% 17.32/17.53  % SZS status Theorem
% 17.32/17.53  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 17.32/17.53  SPASS derived 22231 clauses, backtracked 0 clauses, performed 0 splits and kept 12934 clauses.
% 17.32/17.53  SPASS allocated 88568 KBytes.
% 17.32/17.53  SPASS spent	0:0:17.09 on the problem.
% 17.32/17.53  		0:00:00.04 for the input.
% 17.32/17.53  		0:00:00.00 for the FLOTTER CNF translation.
% 17.32/17.53  		0:00:00.21 for inferences.
% 17.32/17.53  		0:00:00.00 for the backtracking.
% 17.32/17.53  		0:0:16.69 for the reduction.
% 17.32/17.53  
% 17.32/17.53  
% 17.32/17.53  Here is a proof with depth 5, length 20 :
% 17.32/17.53  % SZS output start Refutation
% See solution above
% 17.32/17.53  Formulae used in the proof : p2_5 not_p21_7 p2_9 p2_10 p20_12 p2_14 p2_28 p2_35 p2_36 p21_40
% 17.32/17.53  
%------------------------------------------------------------------------------