TSTP Solution File: KLE022+4 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : KLE022+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n019.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 : Sun Jul 17 02:28:05 EDT 2022

% Result   : Theorem 0.61s 0.78s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   27 (   9 unt;   0 nHn;  27 RR)
%            Number of literals    :   57 (   0 equ;  33 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    test__dfg(skc3),
    file('KLE022+4.p',unknown),
    [] ).

cnf(3,axiom,
    equal(addition(u,u),u),
    file('KLE022+4.p',unknown),
    [] ).

cnf(4,axiom,
    equal(multiplication(u,one),u),
    file('KLE022+4.p',unknown),
    [] ).

cnf(10,axiom,
    equal(addition(u,v),addition(v,u)),
    file('KLE022+4.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ equal(addition(u,v),v)
    | leq(u,v) ),
    file('KLE022+4.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ complement(u,v)
    | equal(multiplication(v,u),zero) ),
    file('KLE022+4.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ complement(u,v)
    | equal(multiplication(u,v),zero) ),
    file('KLE022+4.p',unknown),
    [] ).

cnf(16,axiom,
    ( ~ complement(u,v)
    | equal(addition(v,u),one) ),
    file('KLE022+4.p',unknown),
    [] ).

cnf(19,axiom,
    ( ~ test__dfg(u)
    | ~ equal(c(u),v)
    | complement(u,v) ),
    file('KLE022+4.p',unknown),
    [] ).

cnf(21,axiom,
    equal(multiplication(u,addition(v,w)),addition(multiplication(u,v),multiplication(u,w))),
    file('KLE022+4.p',unknown),
    [] ).

cnf(25,axiom,
    ( ~ equal(addition(u,v),one)
    | ~ equal(multiplication(v,u),zero)
    | ~ equal(multiplication(u,v),zero)
    | complement(v,u) ),
    file('KLE022+4.p',unknown),
    [] ).

cnf(26,axiom,
    ( ~ leq(skc4,addition(multiplication(skc4,skc3),multiplication(skc4,c(skc3))))
    | ~ leq(addition(multiplication(skc5,skc3),multiplication(skc5,c(skc3))),skc5) ),
    file('KLE022+4.p',unknown),
    [] ).

cnf(29,plain,
    ( ~ equal(c(skc3),u)
    | complement(skc3,u) ),
    inference(res,[status(thm),theory(equality)],[1,19]),
    [iquote('0:Res:1.0,19.0')] ).

cnf(73,plain,
    ( ~ complement(u,v)
    | equal(addition(u,v),one) ),
    inference(spr,[status(thm),theory(equality)],[16,10]),
    [iquote('0:SpR:16.1,10.0')] ).

cnf(172,plain,
    ( ~ equal(u,u)
    | leq(u,u) ),
    inference(spl,[status(thm),theory(equality)],[3,13]),
    [iquote('0:SpL:3.0,13.0')] ).

cnf(178,plain,
    leq(u,u),
    inference(obv,[status(thm),theory(equality)],[172]),
    [iquote('0:Obv:172.0')] ).

cnf(336,plain,
    ( ~ complement(u,v)
    | equal(multiplication(w,one),addition(multiplication(w,v),multiplication(w,u))) ),
    inference(spr,[status(thm),theory(equality)],[16,21]),
    [iquote('0:SpR:16.1,21.0')] ).

cnf(346,plain,
    ( ~ complement(u,v)
    | equal(addition(multiplication(w,v),multiplication(w,u)),w) ),
    inference(rew,[status(thm),theory(equality)],[4,336]),
    [iquote('0:Rew:4.0,336.1')] ).

cnf(352,plain,
    complement(skc3,c(skc3)),
    inference(eqr,[status(thm),theory(equality)],[29]),
    [iquote('0:EqR:29.0')] ).

cnf(519,plain,
    ( ~ complement(u,v)
    | ~ equal(one,one)
    | ~ equal(multiplication(v,u),zero)
    | ~ equal(multiplication(u,v),zero)
    | complement(v,u) ),
    inference(spl,[status(thm),theory(equality)],[73,25]),
    [iquote('0:SpL:73.1,25.0')] ).

cnf(533,plain,
    ( ~ complement(u,v)
    | ~ equal(multiplication(v,u),zero)
    | ~ equal(multiplication(u,v),zero)
    | complement(v,u) ),
    inference(obv,[status(thm),theory(equality)],[519]),
    [iquote('0:Obv:519.1')] ).

cnf(534,plain,
    ( ~ complement(u,v)
    | ~ equal(zero,zero)
    | ~ equal(zero,zero)
    | complement(v,u) ),
    inference(rew,[status(thm),theory(equality)],[15,533,14]),
    [iquote('0:Rew:15.1,533.2,14.1,533.1')] ).

cnf(535,plain,
    ( ~ complement(u,v)
    | complement(v,u) ),
    inference(obv,[status(thm),theory(equality)],[534]),
    [iquote('0:Obv:534.2')] ).

cnf(964,plain,
    complement(c(skc3),skc3),
    inference(res,[status(thm),theory(equality)],[352,535]),
    [iquote('0:Res:352.0,535.0')] ).

cnf(3339,plain,
    ( ~ complement(c(skc3),skc3)
    | ~ leq(skc4,addition(multiplication(skc4,skc3),multiplication(skc4,c(skc3))))
    | ~ leq(skc5,skc5) ),
    inference(spl,[status(thm),theory(equality)],[346,26]),
    [iquote('0:SpL:346.1,26.1')] ).

cnf(3375,plain,
    ( ~ complement(c(skc3),skc3)
    | ~ leq(skc4,skc4)
    | ~ leq(skc5,skc5) ),
    inference(rew,[status(thm),theory(equality)],[346,3339]),
    [iquote('0:Rew:346.1,3339.1')] ).

cnf(3376,plain,
    $false,
    inference(mrr,[status(thm)],[3375,964,178]),
    [iquote('0:MRR:3375.0,3375.1,3375.2,964.0,178.0,178.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KLE022+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n019.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 16 13:06:54 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.61/0.78  
% 0.61/0.78  SPASS V 3.9 
% 0.61/0.78  SPASS beiseite: Proof found.
% 0.61/0.78  % SZS status Theorem
% 0.61/0.78  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.61/0.78  SPASS derived 2628 clauses, backtracked 17 clauses, performed 1 splits and kept 973 clauses.
% 0.61/0.78  SPASS allocated 100150 KBytes.
% 0.61/0.78  SPASS spent	0:00:00.43 on the problem.
% 0.61/0.78  		0:00:00.04 for the input.
% 0.61/0.78  		0:00:00.03 for the FLOTTER CNF translation.
% 0.61/0.78  		0:00:00.02 for inferences.
% 0.61/0.78  		0:00:00.01 for the backtracking.
% 0.61/0.78  		0:00:00.31 for the reduction.
% 0.61/0.78  
% 0.61/0.78  
% 0.61/0.78  Here is a proof with depth 3, length 27 :
% 0.61/0.78  % SZS output start Refutation
% See solution above
% 0.61/0.78  Formulae used in the proof : goals additive_idempotence multiplicative_right_identity additive_commutativity order test_2 test_3 right_distributivity
% 0.61/0.78  
%------------------------------------------------------------------------------