↑ Up

SPASS---3.9.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SET056-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n016.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 : Tue Jul 19 05:23:14 EDT 2022

% Result   : Unsatisfiable 0.21s 0.44s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    5
% Syntax   : Number of clauses     :    9 (   6 unt;   1 nHn;   9 RR)
%            Number of literals    :   13 (   0 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 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,
    ~ equal(y__dfg,x__dfg),
    file('SET056-6.p',unknown),
    [] ).

cnf(2,axiom,
    ~ member(not_subclass_element(x__dfg,y__dfg),x__dfg),
    file('SET056-6.p',unknown),
    [] ).

cnf(3,axiom,
    ~ member(not_subclass_element(y__dfg,x__dfg),y__dfg),
    file('SET056-6.p',unknown),
    [] ).

cnf(5,axiom,
    ( subclass(u,v)
    | member(not_subclass_element(u,v),u) ),
    file('SET056-6.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ subclass(u,v)
    | ~ subclass(v,u)
    | equal(v,u) ),
    file('SET056-6.p',unknown),
    [] ).

cnf(98,plain,
    ( ~ subclass(y__dfg,x__dfg)
    | ~ subclass(x__dfg,y__dfg) ),
    inference(res,[status(thm),theory(equality)],[10,1]),
    [iquote('0:Res:10.2,1.0')] ).

cnf(103,plain,
    subclass(y__dfg,x__dfg),
    inference(res,[status(thm),theory(equality)],[5,3]),
    [iquote('0:Res:5.0,3.0')] ).

cnf(111,plain,
    subclass(x__dfg,y__dfg),
    inference(res,[status(thm),theory(equality)],[5,2]),
    [iquote('0:Res:5.0,2.0')] ).

cnf(119,plain,
    $false,
    inference(mrr,[status(thm)],[98,103,111]),
    [iquote('0:MRR:98.0,98.1,103.0,111.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SET056-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.14/0.35  % Computer : n016.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Sun Jul 10 21:17:42 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.44  
% 0.21/0.44  SPASS V 3.9 
% 0.21/0.44  SPASS beiseite: Proof found.
% 0.21/0.44  % SZS status Theorem
% 0.21/0.44  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.21/0.44  SPASS derived 16 clauses, backtracked 0 clauses, performed 0 splits and kept 96 clauses.
% 0.21/0.44  SPASS allocated 75748 KBytes.
% 0.21/0.44  SPASS spent	0:00:00.07 on the problem.
% 0.21/0.44  		0:00:00.04 for the input.
% 0.21/0.44  		0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.44  		0:00:00.00 for inferences.
% 0.21/0.44  		0:00:00.00 for the backtracking.
% 0.21/0.44  		0:00:00.01 for the reduction.
% 0.21/0.44  
% 0.21/0.44  
% 0.21/0.44  Here is a proof with depth 1, length 9 :
% 0.21/0.44  % SZS output start Refutation
% See solution above
% 0.21/0.44  Formulae used in the proof : prove_equality1_1 prove_equality1_2 prove_equality1_3 not_subclass_members1 subclass_implies_equal
% 0.21/0.44  
%------------------------------------------------------------------------------