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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN070+1 : TPTP v8.1.0. Released v2.0.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:18:18 EDT 2022

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

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

cnf(3,axiom,
    ~ big_g(skc2),
    file('SYN070+1.p',unknown),
    [] ).

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

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

cnf(6,axiom,
    ( ~ big_g(u)
    | ~ big(v)
    | big_g(v) ),
    file('SYN070+1.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ big(u)
    | big_g(u)
    | big_j(skc3,u) ),
    file('SYN070+1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ big(u)
    | ~ big(v)
    | ~ big_j(v,u)
    | ~ big_h(u,v) ),
    file('SYN070+1.p',unknown),
    [] ).

cnf(14,plain,
    ( big(u)
    | big_g(skc2) ),
    inference(res,[status(thm),theory(equality)],[1,4]),
    [iquote('0:Res:1.0,4.0')] ).

cnf(16,plain,
    ( ~ big_g(u)
    | big_g(skc2) ),
    inference(res,[status(thm),theory(equality)],[1,6]),
    [iquote('0:Res:1.0,6.1')] ).

cnf(22,plain,
    big(u),
    inference(mrr,[status(thm)],[14,3]),
    [iquote('0:MRR:14.1,3.0')] ).

cnf(23,plain,
    ( big_g(u)
    | big_j(skc3,u) ),
    inference(mrr,[status(thm)],[8,22]),
    [iquote('0:MRR:8.0,22.0')] ).

cnf(25,plain,
    ( big_h(u,v)
    | big_g(v) ),
    inference(mrr,[status(thm)],[5,22]),
    [iquote('0:MRR:5.0,22.0')] ).

cnf(26,plain,
    ( ~ big_j(u,v)
    | ~ big_h(v,u) ),
    inference(mrr,[status(thm)],[9,22]),
    [iquote('0:MRR:9.1,9.0,22.0')] ).

cnf(31,plain,
    ~ big_g(u),
    inference(mrr,[status(thm)],[16,3]),
    [iquote('0:MRR:16.1,3.0')] ).

cnf(32,plain,
    big_j(skc3,u),
    inference(mrr,[status(thm)],[23,31]),
    [iquote('0:MRR:23.0,31.0')] ).

cnf(33,plain,
    big_h(u,v),
    inference(mrr,[status(thm)],[25,31]),
    [iquote('0:MRR:25.1,31.0')] ).

cnf(34,plain,
    ~ big_j(u,v),
    inference(mrr,[status(thm)],[26,33]),
    [iquote('0:MRR:26.1,33.0')] ).

cnf(35,plain,
    $false,
    inference(unc,[status(thm)],[34,32]),
    [iquote('0:UnC:34.0,32.0')] ).

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