↑ Up

SPASS---3.9.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : BOO018-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n026.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 : Thu Jul 14 23:49:28 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ equal(inverse(multiplicative_identity),additive_identity),
    file('BOO018-4.p',unknown),
    [] ).

cnf(3,axiom,
    equal(multiply(u,v),multiply(v,u)),
    file('BOO018-4.p',unknown),
    [] ).

cnf(7,axiom,
    equal(multiply(u,multiplicative_identity),u),
    file('BOO018-4.p',unknown),
    [] ).

cnf(9,axiom,
    equal(multiply(u,inverse(u)),additive_identity),
    file('BOO018-4.p',unknown),
    [] ).

cnf(14,plain,
    equal(multiply(multiplicative_identity,u),u),
    inference(spr,[status(thm),theory(equality)],[3,7]),
    [iquote('0:SpR:3.0,7.0')] ).

cnf(21,plain,
    equal(inverse(multiplicative_identity),additive_identity),
    inference(spr,[status(thm),theory(equality)],[14,9]),
    [iquote('0:SpR:14.0,9.0')] ).

cnf(25,plain,
    $false,
    inference(mrr,[status(thm)],[21,1]),
    [iquote('0:MRR:21.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : BOO018-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n026.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 : Wed Jun  1 21:50:42 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.41  
% 0.19/0.41  SPASS V 3.9 
% 0.19/0.41  SPASS beiseite: Proof found.
% 0.19/0.41  % SZS status Theorem
% 0.19/0.41  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.41  SPASS derived 15 clauses, backtracked 0 clauses, performed 0 splits and kept 11 clauses.
% 0.19/0.41  SPASS allocated 63096 KBytes.
% 0.19/0.41  SPASS spent	0:00:00.06 on the problem.
% 0.19/0.41  		0:00:00.04 for the input.
% 0.19/0.41  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.41  		0:00:00.00 for inferences.
% 0.19/0.41  		0:00:00.00 for the backtracking.
% 0.19/0.41  		0:00:00.00 for the reduction.
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  Here is a proof with depth 2, length 7 :
% 0.19/0.41  % SZS output start Refutation
% See solution above
% 0.19/0.41  Formulae used in the proof : prove_inverse_of_1_is_0 commutativity_of_multiply multiplicative_id1 multiplicative_inverse1
% 0.19/0.41  
%------------------------------------------------------------------------------