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

View Problem - Process Solution

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

% Computer : n010.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:23 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    p4(u,u),
    file('SYN640-1.p',unknown),
    [] ).

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

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

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

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

cnf(12,axiom,
    p19(f13(f11(c23)),f13(f11(c22))),
    file('SYN640-1.p',unknown),
    [] ).

cnf(17,axiom,
    ( ~ p4(u,v)
    | p2(f12(u),f12(v)) ),
    file('SYN640-1.p',unknown),
    [] ).

cnf(18,axiom,
    ( ~ p4(u,v)
    | p2(f13(u),f13(v)) ),
    file('SYN640-1.p',unknown),
    [] ).

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

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

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

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

cnf(35,axiom,
    ( ~ p2(f12(f11(u)),f7(c24))
    | ~ p2(f12(f11(v)),f7(c24))
    | ~ p19(f13(f11(u)),f13(f11(v)))
    | p20(f17(u),f17(v)) ),
    file('SYN640-1.p',unknown),
    [] ).

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

cnf(70,plain,
    ( ~ p2(f12(f11(c22)),u)
    | p2(u,f7(c24)) ),
    inference(res,[status(thm),theory(equality)],[10,26]),
    [iquote('0:Res:10.0,26.0')] ).

cnf(82,plain,
    ( ~ p4(u,v)
    | p2(f12(v),f12(u)) ),
    inference(res,[status(thm),theory(equality)],[17,68]),
    [iquote('0:Res:17.1,68.0')] ).

cnf(84,plain,
    ( ~ p4(u,v)
    | p2(f13(v),f13(u)) ),
    inference(res,[status(thm),theory(equality)],[18,68]),
    [iquote('0:Res:18.1,68.0')] ).

cnf(94,plain,
    p2(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),f13(f11(c25))),
    inference(res,[status(thm),theory(equality)],[34,68]),
    [iquote('0:Res:34.0,68.0')] ).

cnf(104,plain,
    p2(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),f13(f11(c23))),
    inference(res,[status(thm),theory(equality)],[33,68]),
    [iquote('0:Res:33.0,68.0')] ).

cnf(117,plain,
    ( ~ p4(u,f11(c22))
    | p2(f12(u),f7(c24)) ),
    inference(res,[status(thm),theory(equality)],[82,70]),
    [iquote('0:Res:82.1,70.0')] ).

cnf(209,plain,
    ( ~ p2(f13(f11(c22)),u)
    | ~ p2(f13(f11(c23)),v)
    | p19(v,u) ),
    inference(res,[status(thm),theory(equality)],[12,28]),
    [iquote('0:Res:12.0,28.0')] ).

cnf(510,plain,
    ( ~ p4(u,f11(c22))
    | ~ p2(f13(f11(c23)),v)
    | p19(v,f13(u)) ),
    inference(res,[status(thm),theory(equality)],[84,209]),
    [iquote('0:Res:84.1,209.0')] ).

cnf(2149,plain,
    ( ~ p2(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),u)
    | p2(u,f13(f11(c25))) ),
    inference(res,[status(thm),theory(equality)],[94,26]),
    [iquote('0:Res:94.0,26.0')] ).

cnf(21203,plain,
    p2(f13(f11(c23)),f13(f11(c25))),
    inference(res,[status(thm),theory(equality)],[104,2149]),
    [iquote('0:Res:104.0,2149.0')] ).

cnf(21238,plain,
    ( ~ p4(u,f11(c22))
    | p19(f13(f11(c25)),f13(u)) ),
    inference(res,[status(thm),theory(equality)],[21203,510]),
    [iquote('0:Res:21203.0,510.1')] ).

cnf(21378,plain,
    ( ~ p4(f11(u),f11(c22))
    | ~ p2(f12(f11(c25)),f7(c24))
    | ~ p2(f12(f11(u)),f7(c24))
    | p20(f17(c25),f17(u)) ),
    inference(res,[status(thm),theory(equality)],[21238,35]),
    [iquote('0:Res:21238.1,35.2')] ).

cnf(21380,plain,
    ( ~ p4(f11(u),f11(c22))
    | p20(f17(c25),f17(u)) ),
    inference(mrr,[status(thm)],[21378,9,117]),
    [iquote('0:MRR:21378.1,21378.2,9.0,117.1')] ).

cnf(21750,plain,
    ~ p4(f11(c22),f11(c22)),
    inference(res,[status(thm),theory(equality)],[21380,7]),
    [iquote('0:Res:21380.1,7.0')] ).

cnf(21754,plain,
    $false,
    inference(mrr,[status(thm)],[21750,3]),
    [iquote('0:MRR:21750.0,3.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN640-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n010.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 21:22:45 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 15.98/16.21  
% 15.98/16.21  SPASS V 3.9 
% 15.98/16.21  SPASS beiseite: Proof found.
% 15.98/16.21  % SZS status Theorem
% 15.98/16.21  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 15.98/16.21  SPASS derived 21526 clauses, backtracked 0 clauses, performed 0 splits and kept 12559 clauses.
% 15.98/16.21  SPASS allocated 88190 KBytes.
% 15.98/16.21  SPASS spent	0:0:15.78 on the problem.
% 15.98/16.21  		0:00:00.04 for the input.
% 15.98/16.21  		0:00:00.00 for the FLOTTER CNF translation.
% 15.98/16.21  		0:00:00.20 for inferences.
% 15.98/16.21  		0:00:00.00 for the backtracking.
% 15.98/16.21  		0:0:15.42 for the reduction.
% 15.98/16.21  
% 15.98/16.21  
% 15.98/16.21  Here is a proof with depth 7, length 29 :
% 15.98/16.21  % SZS output start Refutation
% See solution above
% 15.98/16.21  Formulae used in the proof : p4_3 p2_5 not_p20_7 p2_9 p2_10 p19_12 p2_17 p2_18 p2_26 p19_28 p2_33 p2_34 p20_35
% 15.98/16.21  
%------------------------------------------------------------------------------