↑ Up

SPASS---3.9.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : KRS097+1 : TPTP v8.1.0. Released v3.1.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 : Sun Jul 17 03:30:32 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    cUnsatisfiable(i2003_11_14_17_20_21603),
    file('KRS097+1.p',unknown),
    [] ).

cnf(4,axiom,
    cc(skf7(u)),
    file('KRS097+1.p',unknown),
    [] ).

cnf(5,axiom,
    cd(skf6(u)),
    file('KRS097+1.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ cc(u)
    | ~ cd(u) ),
    file('KRS097+1.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ cUnsatisfiable(u)
    | rr(u,skf5(u)) ),
    file('KRS097+1.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ cUnsatisfiable(u)
    | rr(u,skf6(u)) ),
    file('KRS097+1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ cUnsatisfiable(u)
    | rr(u,skf7(u)) ),
    file('KRS097+1.p',unknown),
    [] ).

cnf(23,axiom,
    ( ~ cUnsatisfiable(u)
    | ~ rr(u,v)
    | ~ rr(u,w)
    | equal(v,w) ),
    file('KRS097+1.p',unknown),
    [] ).

cnf(28,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cUnsatisfiable(u)
    | ~ rr(u,v)
    | equal(skf7(u),v) ),
    inference(res,[status(thm),theory(equality)],[15,23]),
    [iquote('0:Res:15.1,23.1')] ).

cnf(34,plain,
    ( ~ cUnsatisfiable(u)
    | ~ rr(u,v)
    | equal(skf7(u),v) ),
    inference(obv,[status(thm),theory(equality)],[28]),
    [iquote('0:Obv:28.0')] ).

cnf(38,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cUnsatisfiable(u)
    | equal(skf7(u),skf6(u)) ),
    inference(res,[status(thm),theory(equality)],[14,34]),
    [iquote('0:Res:14.1,34.1')] ).

cnf(39,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cUnsatisfiable(u)
    | equal(skf7(u),skf5(u)) ),
    inference(res,[status(thm),theory(equality)],[13,34]),
    [iquote('0:Res:13.1,34.1')] ).

cnf(43,plain,
    ( ~ cUnsatisfiable(u)
    | equal(skf7(u),skf6(u)) ),
    inference(obv,[status(thm),theory(equality)],[38]),
    [iquote('0:Obv:38.0')] ).

cnf(46,plain,
    ( ~ cUnsatisfiable(u)
    | equal(skf7(u),skf5(u)) ),
    inference(obv,[status(thm),theory(equality)],[39]),
    [iquote('0:Obv:39.0')] ).

cnf(47,plain,
    ( ~ cUnsatisfiable(u)
    | equal(skf6(u),skf5(u)) ),
    inference(rew,[status(thm),theory(equality)],[43,46]),
    [iquote('0:Rew:43.1,46.1')] ).

cnf(50,plain,
    ( ~ cUnsatisfiable(u)
    | equal(skf7(u),skf5(u)) ),
    inference(rew,[status(thm),theory(equality)],[47,43]),
    [iquote('0:Rew:47.1,43.1')] ).

cnf(59,plain,
    ( ~ cUnsatisfiable(u)
    | cd(skf5(u)) ),
    inference(spr,[status(thm),theory(equality)],[47,5]),
    [iquote('0:SpR:47.1,5.0')] ).

cnf(61,plain,
    ( ~ cUnsatisfiable(u)
    | cc(skf5(u)) ),
    inference(spr,[status(thm),theory(equality)],[50,4]),
    [iquote('0:SpR:50.1,4.0')] ).

cnf(63,plain,
    ( ~ cUnsatisfiable(u)
    | ~ cUnsatisfiable(u) ),
    inference(ems,[status(thm)],[11,61,59]),
    [iquote('0:EmS:11.0,11.1,61.1,59.1')] ).

cnf(65,plain,
    ~ cUnsatisfiable(u),
    inference(obv,[status(thm),theory(equality)],[63]),
    [iquote('0:Obv:63.0')] ).

cnf(66,plain,
    $false,
    inference(unc,[status(thm)],[65,2]),
    [iquote('0:UnC:65.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : KRS097+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n018.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 : Tue Jun  7 20:48:51 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  
% 0.19/0.45  SPASS V 3.9 
% 0.19/0.45  SPASS beiseite: Proof found.
% 0.19/0.45  % SZS status Theorem
% 0.19/0.45  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.45  SPASS derived 28 clauses, backtracked 0 clauses, performed 0 splits and kept 44 clauses.
% 0.19/0.45  SPASS allocated 97935 KBytes.
% 0.19/0.45  SPASS spent	0:00:00.10 on the problem.
% 0.19/0.45  		0:00:00.04 for the input.
% 0.19/0.45  		0:00:00.04 for the FLOTTER CNF translation.
% 0.19/0.45  		0:00:00.00 for inferences.
% 0.19/0.45  		0:00:00.00 for the backtracking.
% 0.19/0.45  		0:00:00.00 for the reduction.
% 0.19/0.45  
% 0.19/0.45  
% 0.19/0.45  Here is a proof with depth 4, length 21 :
% 0.19/0.45  % SZS output start Refutation
% See solution above
% 0.19/0.45  Formulae used in the proof : axiom_4 axiom_2 axiom_6
% 0.19/0.45  
%------------------------------------------------------------------------------