↑ Up

SPASS---3.9.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : MGT041+2 : TPTP v9.3.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n009.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep  8 06:19:54 AM UTC 2026

% Result   : Theorem 0.22s 0.53s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   16 (   9 unt;   2 nHn;  16 RR)
%            Number of literals    :   30 (   0 equ;  17 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    organisation_at_time(skc2,skc3),
    file('MGT041+2.p',unknown),
    [] ).

cnf(2,axiom,
    founding_time(skc2,skc3),
    file('MGT041+2.p',unknown),
    [] ).

cnf(3,axiom,
    number_of_routines(skc2,skc3,high),
    file('MGT041+2.p',unknown),
    [] ).

cnf(4,axiom,
    ~ has_elaborated_routines(skc2,skc3),
    file('MGT041+2.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ organisation_at_time(u,v)
    | first_mover(u)
    | efficient_producer(u) ),
    file('MGT041+2.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ number_of_routines(u,v,high)
    | ~ number_of_routines(u,v,low) ),
    file('MGT041+2.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ efficient_producer(u)
    | ~ organisation_at_time(u,v)
    | ~ founding_time(u,v)
    | has_elaborated_routines(u,v) ),
    file('MGT041+2.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ first_mover(u)
    | ~ organisation_at_time(u,v)
    | ~ founding_time(u,v)
    | number_of_routines(u,v,low) ),
    file('MGT041+2.p',unknown),
    [] ).

cnf(9,plain,
    ( first_mover(skc2)
    | efficient_producer(skc2) ),
    inference(res,[status(thm),theory(equality)],[1,5]),
    [iquote('0:Res:1.0,5.0')] ).

cnf(15,plain,
    ~ number_of_routines(skc2,skc3,low),
    inference(res,[status(thm),theory(equality)],[3,6]),
    [iquote('0:Res:3.0,6.0')] ).

cnf(16,plain,
    ( ~ efficient_producer(skc2)
    | ~ founding_time(skc2,skc3)
    | has_elaborated_routines(skc2,skc3) ),
    inference(res,[status(thm),theory(equality)],[1,7]),
    [iquote('0:Res:1.0,7.1')] ).

cnf(17,plain,
    ~ efficient_producer(skc2),
    inference(mrr,[status(thm)],[16,2,4]),
    [iquote('0:MRR:16.1,16.2,2.0,4.0')] ).

cnf(18,plain,
    first_mover(skc2),
    inference(mrr,[status(thm)],[9,17]),
    [iquote('0:MRR:9.1,17.0')] ).

cnf(19,plain,
    ( ~ first_mover(skc2)
    | ~ founding_time(skc2,skc3)
    | number_of_routines(skc2,skc3,low) ),
    inference(res,[status(thm),theory(equality)],[1,8]),
    [iquote('0:Res:1.0,8.1')] ).

cnf(20,plain,
    ~ first_mover(skc2),
    inference(mrr,[status(thm)],[19,2,15]),
    [iquote('0:MRR:19.1,19.2,2.0,15.0')] ).

cnf(21,plain,
    $false,
    inference(mrr,[status(thm)],[20,18]),
    [iquote('0:MRR:20.0,18.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT041+2 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.04  % Command  : run_spass %d %s
% 0.13/0.39  % Computer : n009.cluster.edu
% 0.13/0.39  % Model    : x86_64 x86_64
% 0.13/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39  % Memory   : 8046.5625MB
% 0.13/0.39  % OS       : Linux 6.8.0-71-generic
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Mon Sep  7 13:02:07 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.22/0.53  
% 0.22/0.53  SPASS V 3.9 
% 0.22/0.53  SPASS beiseite: Proof found.
% 0.22/0.53  % SZS status Theorem
% 0.22/0.53  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.22/0.53  SPASS derived 6 clauses, backtracked 0 clauses, performed 0 splits and kept 13 clauses.
% 0.22/0.53  SPASS allocated 97591 KBytes.
% 0.22/0.53  SPASS spent	0:00:00.12 on the problem.
% 0.22/0.53  		0:00:00.05 for the input.
% 0.22/0.53  		0:00:00.03 for the FLOTTER CNF translation.
% 0.22/0.53  		0:00:00.00 for inferences.
% 0.22/0.53  		0:00:00.00 for the backtracking.
% 0.22/0.53  		0:00:00.00 for the reduction.
% 0.22/0.53  
% 0.22/0.53  
% 0.22/0.53  Here is a proof with depth 1, length 16 :
% 0.22/0.53  % SZS output start Refutation
% See solution above
% 0.22/0.53  Formulae used in the proof : a16 prove_t10 mp_not_high_and_low a14 a15
% 0.22/0.53  
%------------------------------------------------------------------------------