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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV379+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n020.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 : Wed Jul 20 21:42:35 EDT 2022

% Result   : Theorem 0.48s 0.66s
% Output   : Refutation 0.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   24 (  10 unt;  10 nHn;  24 RR)
%            Number of literals    :   51 (   0 equ;  18 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   8 con; 0-3 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(10,axiom,
    ~ ok(triple(skc3,skc4,skc5)),
    file('SWV379+1.p',unknown),
    [] ).

cnf(11,axiom,
    ok(findmin_cpq_eff(triple(skc3,skc4,skc5))),
    file('SWV379+1.p',unknown),
    [] ).

cnf(12,axiom,
    ( less_than(u,v)
    | less_than(v,u) ),
    file('SWV379+1.p',unknown),
    [] ).

cnf(14,axiom,
    ~ ok(triple(u,v,bad)),
    file('SWV379+1.p',unknown),
    [] ).

cnf(20,axiom,
    ( ok(triple(u,v,w))
    | equal(w,bad) ),
    file('SWV379+1.p',unknown),
    [] ).

cnf(26,axiom,
    ( ~ less_than(u,v)
    | less_than(v,u)
    | strictly_less_than(u,v) ),
    file('SWV379+1.p',unknown),
    [] ).

cnf(29,axiom,
    equal(findmin_cpq_eff(triple(u,create_slb,v)),triple(u,create_slb,bad)),
    file('SWV379+1.p',unknown),
    [] ).

cnf(47,axiom,
    ( equal(u,create_slb)
    | contains_slb(u,findmin_pqp_res(v))
    | equal(findmin_cpq_eff(triple(v,u,w)),triple(v,update_slb(u,findmin_pqp_res(v)),bad)) ),
    file('SWV379+1.p',unknown),
    [] ).

cnf(51,axiom,
    ( ~ contains_slb(u,findmin_pqp_res(v))
    | ~ less_than(lookup_slb(u,findmin_pqp_res(v)),findmin_pqp_res(v))
    | equal(u,create_slb)
    | equal(triple(v,update_slb(u,findmin_pqp_res(v)),w),findmin_cpq_eff(triple(v,u,w))) ),
    file('SWV379+1.p',unknown),
    [] ).

cnf(52,axiom,
    ( ~ strictly_less_than(findmin_pqp_res(u),lookup_slb(v,findmin_pqp_res(u)))
    | ~ contains_slb(v,findmin_pqp_res(u))
    | equal(findmin_cpq_eff(triple(u,v,w)),triple(u,update_slb(v,findmin_pqp_res(u)),bad))
    | equal(v,create_slb) ),
    file('SWV379+1.p',unknown),
    [] ).

cnf(56,plain,
    ( strictly_less_than(u,v)
    | less_than(v,u) ),
    inference(mrr,[status(thm)],[26,12]),
    [iquote('0:MRR:26.0,12.0')] ).

cnf(57,plain,
    ( ~ strictly_less_than(findmin_pqp_res(u),lookup_slb(v,findmin_pqp_res(u)))
    | equal(v,create_slb)
    | equal(findmin_cpq_eff(triple(u,v,w)),triple(u,update_slb(v,findmin_pqp_res(u)),bad)) ),
    inference(mrr,[status(thm)],[52,47]),
    [iquote('0:MRR:52.1,47.1')] ).

cnf(58,plain,
    equal(skc5,bad),
    inference(res,[status(thm),theory(equality)],[20,10]),
    [iquote('0:Res:20.0,10.0')] ).

cnf(59,plain,
    ok(findmin_cpq_eff(triple(skc3,skc4,bad))),
    inference(rew,[status(thm),theory(equality)],[58,11]),
    [iquote('0:Rew:58.0,11.0')] ).

cnf(260,plain,
    ( ~ ok(findmin_cpq_eff(triple(u,v,w)))
    | equal(v,create_slb)
    | contains_slb(v,findmin_pqp_res(u)) ),
    inference(spl,[status(thm),theory(equality)],[47,14]),
    [iquote('0:SpL:47.2,14.0')] ).

cnf(343,plain,
    ( ~ strictly_less_than(findmin_pqp_res(u),lookup_slb(v,findmin_pqp_res(u)))
    | ~ ok(findmin_cpq_eff(triple(u,v,w)))
    | equal(v,create_slb) ),
    inference(spl,[status(thm),theory(equality)],[57,14]),
    [iquote('0:SpL:57.2,14.0')] ).

cnf(385,plain,
    ( ~ ok(findmin_cpq_eff(triple(u,v,w)))
    | less_than(lookup_slb(v,findmin_pqp_res(u)),findmin_pqp_res(u))
    | equal(v,create_slb) ),
    inference(res,[status(thm),theory(equality)],[56,343]),
    [iquote('0:Res:56.0,343.0')] ).

cnf(766,plain,
    ( ~ contains_slb(u,findmin_pqp_res(v))
    | ~ less_than(lookup_slb(u,findmin_pqp_res(v)),findmin_pqp_res(v))
    | ~ ok(findmin_cpq_eff(triple(v,u,bad)))
    | equal(u,create_slb) ),
    inference(spl,[status(thm),theory(equality)],[51,14]),
    [iquote('0:SpL:51.3,14.0')] ).

cnf(776,plain,
    ( ~ less_than(lookup_slb(u,findmin_pqp_res(v)),findmin_pqp_res(v))
    | ~ ok(findmin_cpq_eff(triple(v,u,bad)))
    | equal(u,create_slb) ),
    inference(mrr,[status(thm)],[766,260]),
    [iquote('0:MRR:766.0,260.2')] ).

cnf(777,plain,
    ( ~ ok(findmin_cpq_eff(triple(u,v,bad)))
    | equal(v,create_slb) ),
    inference(mrr,[status(thm)],[776,385]),
    [iquote('0:MRR:776.0,385.1')] ).

cnf(813,plain,
    equal(skc4,create_slb),
    inference(res,[status(thm),theory(equality)],[59,777]),
    [iquote('0:Res:59.0,777.0')] ).

cnf(814,plain,
    ok(findmin_cpq_eff(triple(skc3,create_slb,bad))),
    inference(rew,[status(thm),theory(equality)],[813,59]),
    [iquote('0:Rew:813.0,59.0')] ).

cnf(815,plain,
    ok(triple(skc3,create_slb,bad)),
    inference(rew,[status(thm),theory(equality)],[29,814]),
    [iquote('0:Rew:29.0,814.0')] ).

cnf(816,plain,
    $false,
    inference(mrr,[status(thm)],[815,14]),
    [iquote('0:MRR:815.0,14.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SWV379+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n020.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 : Wed Jun 15 03:43:49 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.48/0.66  
% 0.48/0.66  SPASS V 3.9 
% 0.48/0.66  SPASS beiseite: Proof found.
% 0.48/0.66  % SZS status Theorem
% 0.48/0.66  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.48/0.66  SPASS derived 624 clauses, backtracked 0 clauses, performed 0 splits and kept 421 clauses.
% 0.48/0.66  SPASS allocated 86334 KBytes.
% 0.48/0.66  SPASS spent	0:00:00.31 on the problem.
% 0.48/0.66  		0:00:00.03 for the input.
% 0.48/0.66  		0:00:00.04 for the FLOTTER CNF translation.
% 0.48/0.66  		0:00:00.02 for inferences.
% 0.48/0.66  		0:00:00.00 for the backtracking.
% 0.48/0.66  		0:00:00.20 for the reduction.
% 0.48/0.66  
% 0.48/0.66  
% 0.48/0.66  Here is a proof with depth 2, length 24 :
% 0.48/0.66  % SZS output start Refutation
% See solution above
% 0.48/0.66  Formulae used in the proof : l15_co totality ax40 ax41 stricly_smaller_definition ax46 ax47 ax49 ax48
% 0.48/0.66  
%------------------------------------------------------------------------------