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

View Problem - Process Solution

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

% Computer : n011.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:04 EDT 2022

% Result   : Theorem 0.62s 0.82s
% Output   : Refutation 0.62s
% 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('KLE021+4.p',unknown),
    [] ).

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

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

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

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

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

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

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

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

cnf(22,axiom,
    equal(multiplication(addition(u,v),w),addition(multiplication(u,w),multiplication(v,w))),
    file('KLE021+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('KLE021+4.p',unknown),
    [] ).

cnf(26,axiom,
    ( ~ leq(skc4,addition(multiplication(skc3,skc4),multiplication(c(skc3),skc4)))
    | ~ leq(addition(multiplication(skc3,skc5),multiplication(c(skc3),skc5)),skc5) ),
    file('KLE021+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(292,plain,
    ( ~ complement(u,v)
    | equal(multiplication(one,w),addition(multiplication(v,w),multiplication(u,w))) ),
    inference(spr,[status(thm),theory(equality)],[16,22]),
    [iquote('0:SpR:16.1,22.0')] ).

cnf(302,plain,
    ( ~ complement(u,v)
    | equal(addition(multiplication(v,w),multiplication(u,w)),w) ),
    inference(rew,[status(thm),theory(equality)],[5,292]),
    [iquote('0:Rew:5.0,292.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(3184,plain,
    ( ~ complement(c(skc3),skc3)
    | ~ leq(skc4,addition(multiplication(skc3,skc4),multiplication(c(skc3),skc4)))
    | ~ leq(skc5,skc5) ),
    inference(spl,[status(thm),theory(equality)],[302,26]),
    [iquote('0:SpL:302.1,26.1')] ).

cnf(3211,plain,
    ( ~ complement(c(skc3),skc3)
    | ~ leq(skc4,skc4)
    | ~ leq(skc5,skc5) ),
    inference(rew,[status(thm),theory(equality)],[302,3184]),
    [iquote('0:Rew:302.1,3184.1')] ).

cnf(3212,plain,
    $false,
    inference(mrr,[status(thm)],[3211,964,178]),
    [iquote('0:MRR:3211.0,3211.1,3211.2,964.0,178.0,178.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12  % Problem  : KLE021+4 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n011.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Thu Jun 16 07:53:51 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.62/0.82  
% 0.62/0.82  SPASS V 3.9 
% 0.62/0.82  SPASS beiseite: Proof found.
% 0.62/0.82  % SZS status Theorem
% 0.62/0.82  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.62/0.82  SPASS derived 2515 clauses, backtracked 17 clauses, performed 1 splits and kept 918 clauses.
% 0.62/0.82  SPASS allocated 100000 KBytes.
% 0.62/0.82  SPASS spent	0:00:00.45 on the problem.
% 0.62/0.82  		0:00:00.04 for the input.
% 0.62/0.82  		0:00:00.03 for the FLOTTER CNF translation.
% 0.62/0.82  		0:00:00.02 for inferences.
% 0.62/0.82  		0:00:00.01 for the backtracking.
% 0.62/0.82  		0:00:00.32 for the reduction.
% 0.62/0.82  
% 0.62/0.82  
% 0.62/0.82  Here is a proof with depth 3, length 27 :
% 0.62/0.82  % SZS output start Refutation
% See solution above
% 0.62/0.82  Formulae used in the proof : goals additive_idempotence multiplicative_left_identity additive_commutativity order test_2 test_3 left_distributivity
% 0.62/0.82  
%------------------------------------------------------------------------------