TSTP Solution File: SYN352+1 by SPASS---3.9

View Problem - Process Solution

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

% Computer : n004.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:20:40 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    big(skc3,skc2),
    file('SYN352+1.p',unknown),
    [] ).

cnf(2,axiom,
    ( big(u,v)
    | big(skf1(v,u),skf1(v,u)) ),
    file('SYN352+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ big(u,v)
    | big(v,skf1(v,u))
    | big(skc2,skf1(v,u)) ),
    file('SYN352+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ big(u,v)
    | big(v,skf1(v,u))
    | big(u,skf1(v,u)) ),
    file('SYN352+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ big(u,v)
    | ~ big(v,skf1(v,u))
    | ~ big(u,skf1(v,u)) ),
    file('SYN352+1.p',unknown),
    [] ).

cnf(8,plain,
    ( big(skc2,skf1(skc2,skc3))
    | big(skc2,skf1(skc2,skc3)) ),
    inference(res,[status(thm),theory(equality)],[1,3]),
    [iquote('0:Res:1.0,3.0')] ).

cnf(10,plain,
    big(skc2,skf1(skc2,skc3)),
    inference(obv,[status(thm),theory(equality)],[8]),
    [iquote('0:Obv:8.0')] ).

cnf(13,plain,
    ( big(u,v)
    | big(skf1(v,u),skf1(skf1(v,u),skf1(v,u)))
    | big(skf1(v,u),skf1(skf1(v,u),skf1(v,u))) ),
    inference(res,[status(thm),theory(equality)],[2,4]),
    [iquote('0:Res:2.1,4.0')] ).

cnf(15,plain,
    ( big(u,v)
    | big(skf1(v,u),skf1(skf1(v,u),skf1(v,u))) ),
    inference(obv,[status(thm),theory(equality)],[13]),
    [iquote('0:Obv:13.1')] ).

cnf(20,plain,
    ( ~ big(skc3,skc2)
    | ~ big(skc3,skf1(skc2,skc3)) ),
    inference(res,[status(thm),theory(equality)],[10,5]),
    [iquote('0:Res:10.0,5.1')] ).

cnf(21,plain,
    ( ~ big(skf1(u,v),skf1(u,v))
    | ~ big(skf1(u,v),skf1(skf1(u,v),skf1(u,v)))
    | big(v,u) ),
    inference(res,[status(thm),theory(equality)],[15,5]),
    [iquote('0:Res:15.1,5.1')] ).

cnf(23,plain,
    ~ big(skc3,skf1(skc2,skc3)),
    inference(mrr,[status(thm)],[20,1]),
    [iquote('0:MRR:20.0,1.0')] ).

cnf(24,plain,
    big(u,v),
    inference(mrr,[status(thm)],[21,2,15]),
    [iquote('0:MRR:21.0,21.1,2.1,15.1')] ).

cnf(25,plain,
    $false,
    inference(unc,[status(thm)],[24,23]),
    [iquote('0:UnC:24.0,23.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SYN352+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n004.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 16:44:37 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.42  
% 0.18/0.42  SPASS V 3.9 
% 0.18/0.42  SPASS beiseite: Proof found.
% 0.18/0.42  % SZS status Theorem
% 0.18/0.42  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.42  SPASS derived 13 clauses, backtracked 0 clauses, performed 0 splits and kept 17 clauses.
% 0.18/0.42  SPASS allocated 85077 KBytes.
% 0.18/0.42  SPASS spent	0:00:00.08 on the problem.
% 0.18/0.42  		0:00:00.03 for the input.
% 0.18/0.42  		0:00:00.02 for the FLOTTER CNF translation.
% 0.18/0.42  		0:00:00.00 for inferences.
% 0.18/0.42  		0:00:00.00 for the backtracking.
% 0.18/0.42  		0:00:00.00 for the reduction.
% 0.18/0.42  
% 0.18/0.42  
% 0.18/0.42  Here is a proof with depth 2, length 14 :
% 0.18/0.42  % SZS output start Refutation
% See solution above
% 0.18/0.42  Formulae used in the proof : church_46_18_4
% 0.18/0.42  
%------------------------------------------------------------------------------