TSTP Solution File: FLD034-1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : FLD034-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 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 : Sat Jul 16 02:28:24 EDT 2022

% Result   : Unsatisfiable 0.19s 0.43s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : FLD034-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.12/0.13  % 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 : Mon Jun  6 16:20:00 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.43  
% 0.19/0.43  SPASS V 3.9 
% 0.19/0.43  SPASS beiseite: Proof found.
% 0.19/0.43  % SZS status Theorem
% 0.19/0.43  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.43  SPASS derived 133 clauses, backtracked 0 clauses, performed 0 splits and kept 102 clauses.
% 0.19/0.43  SPASS allocated 75791 KBytes.
% 0.19/0.43  SPASS spent	0:00:00.08 on the problem.
% 0.19/0.43  		0:00:00.03 for the input.
% 0.19/0.43  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.43  		0:00:00.00 for inferences.
% 0.19/0.43  		0:00:00.00 for the backtracking.
% 0.19/0.43  		0:00:00.02 for the reduction.
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  Here is a proof with depth 3, length 11 :
% 0.19/0.43  % SZS output start Refutation
% 0.19/0.43  1[0:Inp] ||  -> defined(a)*.
% 0.19/0.43  3[0:Inp] ||  -> equalish(m,multiplicative_identity)*l.
% 0.19/0.43  4[0:Inp] || equalish(multiply(m,a),a)*l -> .
% 0.19/0.43  10[0:Inp] defined(u) ||  -> equalish(multiply(multiplicative_identity,u),u)*l.
% 0.19/0.43  27[0:Inp] || equalish(u,v)* equalish(v,w)* -> equalish(u,w)*.
% 0.19/0.43  29[0:Inp] defined(u) || equalish(v,w) -> equalish(multiply(v,u),multiply(w,u))*.
% 0.19/0.43  33[0:Res:3.0,29.1] defined(u) ||  -> equalish(multiply(m,u),multiply(multiplicative_identity,u))*l.
% 0.19/0.43  196[0:NCh:27.2,27.0,33.1,4.0] defined(a) || equalish(multiply(multiplicative_identity,a),a)*l -> .
% 0.19/0.43  198[0:SSi:196.0,1.0] || equalish(multiply(multiplicative_identity,a),a)*l -> .
% 0.19/0.43  219[0:Res:10.1,198.0] defined(a) ||  -> .
% 0.19/0.43  221[0:SSi:219.0,1.0] ||  -> .
% 0.19/0.43  % SZS output end Refutation
% 0.19/0.43  Formulae used in the proof : a_is_defined m_equals_multiplicative_identity_3 multiply_not_equal_to_a_4 existence_of_identity_multiplication transitivity_of_equality compatibility_of_equality_and_multiplication
% 0.19/0.43  
%------------------------------------------------------------------------------