TSTP Solution File: ALG025+1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : ALG025+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n028.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 18:02:00 EDT 2022

% Result   : Theorem 0.45s 0.63s
% Output   : Refutation 0.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   22
% Syntax   : Number of clauses     :   25 (  22 unt;   0 nHn;  25 RR)
%            Number of literals    :   73 (   0 equ;  51 neg)
%            Maximal clause size   :   21 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    equal(e0,unit),
    file('ALG025+1.p',unknown),
    [] ).

cnf(20,axiom,
    equal(op(unit,e1),e1),
    file('ALG025+1.p',unknown),
    [] ).

cnf(21,axiom,
    equal(op(e1,unit),e1),
    file('ALG025+1.p',unknown),
    [] ).

cnf(22,axiom,
    equal(op(unit,e2),e2),
    file('ALG025+1.p',unknown),
    [] ).

cnf(23,axiom,
    equal(op(e2,unit),e2),
    file('ALG025+1.p',unknown),
    [] ).

cnf(24,axiom,
    equal(op(unit,e3),e3),
    file('ALG025+1.p',unknown),
    [] ).

cnf(25,axiom,
    equal(op(e3,unit),e3),
    file('ALG025+1.p',unknown),
    [] ).

cnf(26,axiom,
    equal(op(unit,e4),e4),
    file('ALG025+1.p',unknown),
    [] ).

cnf(27,axiom,
    equal(op(e4,unit),e4),
    file('ALG025+1.p',unknown),
    [] ).

cnf(28,axiom,
    equal(op(unit,e5),e5),
    file('ALG025+1.p',unknown),
    [] ).

cnf(29,axiom,
    equal(op(e5,unit),e5),
    file('ALG025+1.p',unknown),
    [] ).

cnf(70,axiom,
    equal(op(e2,e1),op(e1,e2)),
    file('ALG025+1.p',unknown),
    [] ).

cnf(71,axiom,
    equal(op(e3,e1),op(e1,e3)),
    file('ALG025+1.p',unknown),
    [] ).

cnf(72,axiom,
    equal(op(e4,e1),op(e1,e4)),
    file('ALG025+1.p',unknown),
    [] ).

cnf(73,axiom,
    equal(op(e5,e1),op(e1,e5)),
    file('ALG025+1.p',unknown),
    [] ).

cnf(75,axiom,
    equal(op(e3,e2),op(e2,e3)),
    file('ALG025+1.p',unknown),
    [] ).

cnf(76,axiom,
    equal(op(e4,e2),op(e2,e4)),
    file('ALG025+1.p',unknown),
    [] ).

cnf(77,axiom,
    equal(op(e5,e2),op(e2,e5)),
    file('ALG025+1.p',unknown),
    [] ).

cnf(79,axiom,
    equal(op(e4,e3),op(e3,e4)),
    file('ALG025+1.p',unknown),
    [] ).

cnf(80,axiom,
    equal(op(e5,e3),op(e3,e5)),
    file('ALG025+1.p',unknown),
    [] ).

cnf(82,axiom,
    equal(op(e5,e4),op(e4,e5)),
    file('ALG025+1.p',unknown),
    [] ).

cnf(553,axiom,
    ( ~ equal(op(e0,e0),op(e0,e0))
    | ~ equal(op(e1,e0),op(e0,e1))
    | ~ equal(op(e2,e0),op(e0,e2))
    | ~ equal(op(e3,e0),op(e0,e3))
    | ~ equal(op(e4,e0),op(e0,e4))
    | ~ equal(op(e5,e0),op(e0,e5))
    | ~ equal(op(e1,e1),op(e1,e1))
    | ~ equal(op(e2,e1),op(e1,e2))
    | ~ equal(op(e3,e1),op(e1,e3))
    | ~ equal(op(e4,e1),op(e1,e4))
    | ~ equal(op(e5,e1),op(e1,e5))
    | ~ equal(op(e2,e2),op(e2,e2))
    | ~ equal(op(e3,e2),op(e2,e3))
    | ~ equal(op(e4,e2),op(e2,e4))
    | ~ equal(op(e5,e2),op(e2,e5))
    | ~ equal(op(e3,e3),op(e3,e3))
    | ~ equal(op(e4,e3),op(e3,e4))
    | ~ equal(op(e5,e3),op(e3,e5))
    | ~ equal(op(e4,e4),op(e4,e4))
    | ~ equal(op(e5,e4),op(e4,e5))
    | ~ equal(op(e5,e5),op(e5,e5)) ),
    file('ALG025+1.p',unknown),
    [] ).

cnf(1077,plain,
    ( ~ equal(op(e1,e0),op(e0,e1))
    | ~ equal(op(e2,e0),op(e0,e2))
    | ~ equal(op(e3,e0),op(e0,e3))
    | ~ equal(op(e4,e0),op(e0,e4))
    | ~ equal(op(e5,e0),op(e0,e5))
    | ~ equal(op(e2,e1),op(e1,e2))
    | ~ equal(op(e3,e1),op(e1,e3))
    | ~ equal(op(e4,e1),op(e1,e4))
    | ~ equal(op(e5,e1),op(e1,e5))
    | ~ equal(op(e3,e2),op(e2,e3))
    | ~ equal(op(e4,e2),op(e2,e4))
    | ~ equal(op(e5,e2),op(e2,e5))
    | ~ equal(op(e4,e3),op(e3,e4))
    | ~ equal(op(e5,e3),op(e3,e5))
    | ~ equal(op(e5,e4),op(e4,e5)) ),
    inference(obv,[status(thm),theory(equality)],[553]),
    [iquote('0:Obv:553.20')] ).

cnf(1078,plain,
    ( ~ equal(e1,e1)
    | ~ equal(e2,e2)
    | ~ equal(e3,e3)
    | ~ equal(e4,e4)
    | ~ equal(e5,e5)
    | ~ equal(op(e1,e2),op(e1,e2))
    | ~ equal(op(e1,e3),op(e1,e3))
    | ~ equal(op(e1,e4),op(e1,e4))
    | ~ equal(op(e1,e5),op(e1,e5))
    | ~ equal(op(e2,e3),op(e2,e3))
    | ~ equal(op(e2,e4),op(e2,e4))
    | ~ equal(op(e2,e5),op(e2,e5))
    | ~ equal(op(e3,e4),op(e3,e4))
    | ~ equal(op(e3,e5),op(e3,e5))
    | ~ equal(op(e4,e5),op(e4,e5)) ),
    inference(rew,[status(thm),theory(equality)],[82,1077,80,79,77,76,75,73,72,71,70,29,28,1,27,26,25,24,23,22,21,20]),
    [iquote('0:Rew:82.0,1077.14,80.0,1077.13,79.0,1077.12,77.0,1077.11,76.0,1077.10,75.0,1077.9,73.0,1077.8,72.0,1077.7,71.0,1077.6,70.0,1077.5,29.0,1077.4,28.0,1077.4,1.0,1077.4,27.0,1077.3,26.0,1077.3,1.0,1077.3,25.0,1077.2,24.0,1077.2,1.0,1077.2,23.0,1077.1,22.0,1077.1,1.0,1077.1,21.0,1077.0,20.0,1077.0,1.0,1077.0')] ).

cnf(1079,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[1078]),
    [iquote('0:Obv:1078.14')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : ALG025+1 : TPTP v8.1.0. Released v2.7.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jun  9 00:16:17 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.45/0.63  
% 0.45/0.63  SPASS V 3.9 
% 0.45/0.63  SPASS beiseite: Proof found.
% 0.45/0.63  % SZS status Theorem
% 0.45/0.63  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.45/0.63  SPASS derived 70 clauses, backtracked 0 clauses, performed 0 splits and kept 399 clauses.
% 0.45/0.63  SPASS allocated 86989 KBytes.
% 0.45/0.63  SPASS spent	0:00:00.28 on the problem.
% 0.45/0.63  		0:00:00.04 for the input.
% 0.45/0.63  		0:00:00.15 for the FLOTTER CNF translation.
% 0.45/0.63  		0:00:00.00 for inferences.
% 0.45/0.63  		0:00:00.00 for the backtracking.
% 0.45/0.63  		0:00:00.05 for the reduction.
% 0.45/0.63  
% 0.45/0.63  
% 0.45/0.63  Here is a proof with depth 0, length 25 :
% 0.45/0.63  % SZS output start Refutation
% See solution above
% 0.45/0.63  Formulae used in the proof : ax5 ax3 co1
% 0.45/0.63  
%------------------------------------------------------------------------------