TSTP Solution File: NUN059+2 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUN059+2 : TPTP v8.1.0. Bugfixed v7.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n018.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 : Mon Jul 18 16:38:43 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    r1(skf22(u)),
    file('NUN059+2.p',unknown),
    [] ).

cnf(2,axiom,
    r1(skf24(u)),
    file('NUN059+2.p',unknown),
    [] ).

cnf(3,axiom,
    r1(skf23(u)),
    file('NUN059+2.p',unknown),
    [] ).

cnf(7,axiom,
    r3(u,skf22(u),u),
    file('NUN059+2.p',unknown),
    [] ).

cnf(8,axiom,
    ( equal(u,skc1)
    | skP0(skc1,u) ),
    file('NUN059+2.p',unknown),
    [] ).

cnf(11,axiom,
    r4(u,skf24(u),skf23(u)),
    file('NUN059+2.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ r1(u)
    | ~ skP0(v,u) ),
    file('NUN059+2.p',unknown),
    [] ).

cnf(33,axiom,
    ( ~ r4(u,u,v)
    | ~ r3(w,v,x)
    | ~ r4(y,y,w)
    | ~ r4(z,z,x) ),
    file('NUN059+2.p',unknown),
    [] ).

cnf(36,plain,
    ( ~ r4(u,u,v)
    | ~ r4(w,w,v)
    | ~ r4(x,x,skf22(v)) ),
    inference(res,[status(thm),theory(equality)],[7,33]),
    [iquote('0:Res:7.0,33.2')] ).

cnf(41,plain,
    ( ~ r4(u,u,v)
    | ~ r4(w,w,skf22(v)) ),
    inference(con,[status(thm)],[36]),
    [iquote('0:Con:36.1')] ).

cnf(42,plain,
    ( ~ r1(u)
    | equal(u,skc1) ),
    inference(res,[status(thm),theory(equality)],[8,13]),
    [iquote('0:Res:8.1,13.1')] ).

cnf(44,plain,
    equal(skf22(u),skc1),
    inference(ems,[status(thm)],[42,1]),
    [iquote('0:EmS:42.0,1.0')] ).

cnf(45,plain,
    equal(skf24(u),skc1),
    inference(ems,[status(thm)],[42,2]),
    [iquote('0:EmS:42.0,2.0')] ).

cnf(46,plain,
    equal(skf23(u),skc1),
    inference(ems,[status(thm)],[42,3]),
    [iquote('0:EmS:42.0,3.0')] ).

cnf(49,plain,
    ( ~ r4(u,u,v)
    | ~ r4(w,w,skc1) ),
    inference(rew,[status(thm),theory(equality)],[44,41]),
    [iquote('0:Rew:44.0,41.1')] ).

cnf(51,plain,
    r4(u,skc1,skf23(u)),
    inference(rew,[status(thm),theory(equality)],[45,11]),
    [iquote('0:Rew:45.0,11.0')] ).

cnf(53,plain,
    r4(u,skc1,skc1),
    inference(rew,[status(thm),theory(equality)],[46,51]),
    [iquote('0:Rew:46.0,51.0')] ).

cnf(54,plain,
    ~ r4(u,u,skc1),
    inference(con,[status(thm)],[49]),
    [iquote('0:Con:49.0')] ).

cnf(55,plain,
    $false,
    inference(unc,[status(thm)],[54,53]),
    [iquote('0:UnC:54.0,53.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : NUN059+2 : TPTP v8.1.0. Bugfixed v7.4.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n018.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Thu Jun  2 07:55:00 EDT 2022
% 0.19/0.34  % CPUTime  : 
% 0.19/0.44  
% 0.19/0.44  SPASS V 3.9 
% 0.19/0.44  SPASS beiseite: Proof found.
% 0.19/0.44  % SZS status Theorem
% 0.19/0.44  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.44  SPASS derived 18 clauses, backtracked 0 clauses, performed 0 splits and kept 48 clauses.
% 0.19/0.44  SPASS allocated 97697 KBytes.
% 0.19/0.44  SPASS spent	0:00:00.09 on the problem.
% 0.19/0.44  		0:00:00.03 for the input.
% 0.19/0.44  		0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44  		0:00:00.00 for inferences.
% 0.19/0.44  		0:00:00.00 for the backtracking.
% 0.19/0.44  		0:00:00.00 for the reduction.
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  Here is a proof with depth 2, length 19 :
% 0.19/0.44  % SZS output start Refutation
% See solution above
% 0.19/0.44  Formulae used in the proof : axiom_4a axiom_5a axiom_1 fermattothepoweroftwo
% 0.19/0.44  
%------------------------------------------------------------------------------