↑ Up

SPASS---3.9.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : CSR034+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n017.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 : Fri Jul 15 23:24:25 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(221,axiom,
    individual(c_wanica_districtsuriname),
    file('CSR034+3.p',unknown),
    [] ).

cnf(2296,axiom,
    ~ isa(c_wanica_districtsuriname,u),
    file('CSR034+3.p',unknown),
    [] ).

cnf(6541,axiom,
    ( ~ individual(u)
    | isa(u,c_individual) ),
    file('CSR034+3.p',unknown),
    [] ).

cnf(8011,plain,
    ~ individual(c_wanica_districtsuriname),
    inference(res,[status(thm),theory(equality)],[6541,2296]),
    [iquote('0:Res:6541.1,2296.0')] ).

cnf(9167,plain,
    $false,
    inference(mrr,[status(thm)],[8011,221]),
    [iquote('0:MRR:8011.0,221.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : CSR034+3 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n017.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Thu Jun  9 16:48:19 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 32.93/33.12  
% 32.93/33.12  SPASS V 3.9 
% 32.93/33.12  SPASS beiseite: Proof found.
% 32.93/33.12  % SZS status Theorem
% 32.93/33.12  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 32.93/33.12  SPASS derived 1159 clauses, backtracked 0 clauses, performed 0 splits and kept 7253 clauses.
% 32.93/33.12  SPASS allocated 112789 KBytes.
% 32.93/33.12  SPASS spent	0:0:30.55 on the problem.
% 32.93/33.12  		0:00:00.10 for the input.
% 32.93/33.12  		0:00:07.30 for the FLOTTER CNF translation.
% 32.93/33.12  		0:00:00.00 for inferences.
% 32.93/33.12  		0:00:00.00 for the backtracking.
% 32.93/33.12  		0:00:07.85 for the reduction.
% 32.93/33.12  
% 32.93/33.12  
% 32.93/33.12  Here is a proof with depth 1, length 5 :
% 32.93/33.12  % SZS output start Refutation
% See solution above
% 32.93/33.12  Formulae used in the proof : ax2_3346 query134 ax2_7971
% 32.93/33.12  
%------------------------------------------------------------------------------