↑ Up

SPASS---3.9.THM-Ref.s

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

% Computer : n010.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 14:36:06 EDT 2022

% Result   : Theorem 73.51s 73.68s
% Output   : Refutation 73.51s
% 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    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    one_sorted_str(skc29),
    file('SEU306+2.p',unknown),
    [] ).

cnf(216,axiom,
    ~ equal(cast_as_carrier_subset(skc29),the_carrier(skc29)),
    file('SEU306+2.p',unknown),
    [] ).

cnf(328,axiom,
    ( ~ one_sorted_str(u)
    | equal(cast_as_carrier_subset(u),the_carrier(u)) ),
    file('SEU306+2.p',unknown),
    [] ).

cnf(1289,plain,
    ~ one_sorted_str(skc29),
    inference(res,[status(thm),theory(equality)],[328,216]),
    [iquote('0:Res:328.1,216.0')] ).

cnf(1337,plain,
    $false,
    inference(mrr,[status(thm)],[1289,1]),
    [iquote('0:MRR:1289.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SEU306+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14  % Command  : run_spass %d %s
% 0.13/0.35  % Computer : n010.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun Jun 19 21:12:52 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 73.51/73.68  
% 73.51/73.68  SPASS V 3.9 
% 73.51/73.68  SPASS beiseite: Proof found.
% 73.51/73.68  % SZS status Theorem
% 73.51/73.68  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 73.51/73.68  SPASS derived 29 clauses, backtracked 0 clauses, performed 0 splits and kept 1075 clauses.
% 73.51/73.68  SPASS allocated 159856 KBytes.
% 73.51/73.68  SPASS spent	0:1:13.29 on the problem.
% 73.51/73.68  		0:00:00.04 for the input.
% 73.51/73.68  		0:1:12.77 for the FLOTTER CNF translation.
% 73.51/73.68  		0:00:00.00 for inferences.
% 73.51/73.68  		0:00:00.00 for the backtracking.
% 73.51/73.68  		0:00:00.31 for the reduction.
% 73.51/73.68  
% 73.51/73.68  
% 73.51/73.68  Here is a proof with depth 1, length 5 :
% 73.51/73.68  % SZS output start Refutation
% See solution above
% 73.51/73.68  Formulae used in the proof : t12_pre_topc d3_pre_topc
% 73.51/73.68  
%------------------------------------------------------------------------------