↑ Up

CSE---1.7.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : MGT003-1 : TPTP v9.3.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n012.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:04:14 AM UTC 2026

% Result   : Unsatisfiable 58.19s 58.40s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem    : MGT003-1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.01  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.02/0.29  % Computer : n012.cluster.edu
% 0.02/0.29  % Model    : x86_64 x86_64
% 0.02/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.29  % Memory   : 8046.5625MB
% 0.02/0.29  % OS       : Linux 6.8.0-71-generic
% 0.02/0.29  % CPULimit   : 300
% 0.02/0.29  % WCLimit    : 300
% 0.02/0.29  % DateTime   : Mon Sep  7 11:35:11 UTC 2026
% 0.02/0.29  % CPUTime    : 
% 0.08/0.38  start to proof:theBenchmark
% 58.07/58.39  %-------------------------------------------
% 58.07/58.39  % File        :CSE---1.7
% 58.07/58.39  % Problem     :theBenchmark
% 58.07/58.39  % Transform   :cnf
% 58.07/58.39  % Format      :tptp:raw
% 58.07/58.39  % Command     :java -jar mcs_scs.jar %d %s
% 58.07/58.39  
% 58.07/58.39  % Result      :Theorem 58.005470s
% 58.07/58.39  % Output      :CNFRefutation 58.005470s
% 58.07/58.39  %-------------------------------------------
% 58.07/58.40  %--------------------------------------------------------------------------
% 58.07/58.40  % File     : MGT003-1 : TPTP v9.3.0. Released v2.4.0.
% 58.07/58.40  % Domain   : Management (Organisation Theory)
% 58.07/58.40  % Problem  : Organizational death rates decrease with age.
% 58.07/58.40  % Version  : [PB+94] axioms.
% 58.19/58.40  % English  :
% 58.19/58.40  
% 58.19/58.40  % Refs     : [PB+92] Peli et al. (1992), A Logical Approach to Formalizing
% 58.19/58.40  %          : [PB+94] Peli et al. (1994), A Logical Approach to Formalizing
% 58.19/58.40  %          : [Kam94] Kamps (1994), Email to G. Sutcliffe
% 58.19/58.40  % Source   : [TPTP]
% 58.19/58.40  % Names    :
% 58.19/58.40  
% 58.19/58.40  % Status   : Unsatisfiable
% 58.19/58.40  % Rating   : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v2.4.0
% 58.19/58.40  % Syntax   : Number of clauses     :   12 (   7 unt;   0 nHn;  12 RR)
% 58.19/58.40  %            Number of literals    :   30 (   0 equ;  19 neg)
% 58.19/58.40  %            Maximal clause size   :   10 (   2 avg)
% 58.19/58.40  %            Maximal term depth    :    2 (   1 avg)
% 58.19/58.40  %            Number of predicates  :    5 (   5 usr;   0 prp; 2-3 aty)
% 58.19/58.40  %            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
% 58.19/58.40  %            Number of variables   :   21 (   2 sgn)
% 58.19/58.40  % SPC      : CNF_UNS_RFO_NEQ_HRN
% 58.19/58.40  
% 58.19/58.40  % Comments : Created with tptp2X -f tptp -t clausify:otter MGT003+1.p
% 58.19/58.40  %--------------------------------------------------------------------------
% 58.19/58.40  cnf(mp4_1,axiom,
% 58.19/58.40      ( ~ reorganization_free(A,B,C)
% 58.19/58.40      | reorganization_free(A,B,B) ) ).
% 58.19/58.40  
% 58.19/58.40  cnf(mp4_2,axiom,
% 58.19/58.40      ( ~ reorganization_free(A,B,C)
% 58.19/58.40      | reorganization_free(A,C,C) ) ).
% 58.19/58.40  
% 58.19/58.40  cnf(mp5_3,axiom,
% 58.19/58.40      ( ~ organization(A,B)
% 58.19/58.40      | inertia(A,sk1(B,A),B) ) ).
% 58.19/58.40  
% 58.19/58.40  cnf(t1_FOL_4,hypothesis,
% 58.19/58.40      ( ~ organization(A,B)
% 58.19/58.40      | ~ organization(C,D)
% 58.19/58.40      | ~ reorganization_free(A,B,B)
% 58.19/58.40      | ~ reorganization_free(C,D,D)
% 58.19/58.40      | ~ inertia(A,E,B)
% 58.19/58.40      | ~ inertia(C,F,D)
% 58.19/58.40      | ~ survival_chance(A,G,B)
% 58.19/58.40      | ~ survival_chance(C,H,D)
% 58.19/58.40      | ~ greater(F,E)
% 58.19/58.40      | greater(H,G) ) ).
% 58.19/58.40  
% 58.19/58.40  cnf(t2_FOL_5,hypothesis,
% 58.19/58.40      ( ~ organization(A,B)
% 58.19/58.40      | ~ organization(A,C)
% 58.19/58.40      | ~ reorganization_free(A,B,C)
% 58.19/58.40      | ~ inertia(A,D,B)
% 58.19/58.40      | ~ inertia(A,E,C)
% 58.19/58.40      | ~ greater(C,B)
% 58.19/58.40      | greater(E,D) ) ).
% 58.19/58.40  
% 58.19/58.40  cnf(t3_FOL_6,negated_conjecture,
% 58.19/58.40      organization(sk2,sk5) ).
% 58.19/58.40  
% 58.19/58.40  cnf(t3_FOL_7,negated_conjecture,
% 58.19/58.40      organization(sk2,sk6) ).
% 58.19/58.40  
% 58.19/58.40  cnf(t3_FOL_8,negated_conjecture,
% 58.19/58.40      reorganization_free(sk2,sk5,sk6) ).
% 58.19/58.40  
% 58.19/58.40  cnf(t3_FOL_9,negated_conjecture,
% 58.19/58.40      survival_chance(sk2,sk3,sk5) ).
% 58.19/58.40  
% 58.19/58.40  cnf(t3_FOL_10,negated_conjecture,
% 58.19/58.40      survival_chance(sk2,sk4,sk6) ).
% 58.19/58.40  
% 58.19/58.40  cnf(t3_FOL_11,negated_conjecture,
% 58.19/58.40      greater(sk6,sk5) ).
% 58.19/58.40  
% 58.19/58.40  cnf(t3_FOL_12,negated_conjecture,
% 58.19/58.40      ~ greater(sk4,sk3) ).
% 58.19/58.40  
% 58.19/58.40  %--------------------------------------------------------------------------
% 58.19/58.40  %-------------------------------------------
% 58.19/58.40  % Proof found
% 58.19/58.40  % SZS status Theorem for theBenchmark
% 58.19/58.40  % SZS output start Proof
% 58.19/58.40  %ClaNum:12(EqnAxiom:0)
% 58.19/58.40  %VarNum:61(SingletonVarNum:21)
% 58.19/58.40  %MaxLitNum:10
% 58.19/58.40  %MaxfuncDepth:1
% 58.19/58.40  %SharedTerms:12
% 58.19/58.40  %goalClause: 1 2 3 4 5 6 7
% 58.19/58.40  %singleGoalClaCount:7
% 58.19/58.40  [1]P1(a1,a3)
% 58.19/58.40  [2]P1(a1,a6)
% 58.19/58.40  [3]P2(a6,a3)
% 58.19/58.40  [4]P4(a1,a3,a6)
% 58.19/58.40  [5]P5(a1,a4,a3)
% 58.19/58.40  [6]P5(a1,a5,a6)
% 58.19/58.40  [7]~P2(a5,a4)
% 58.19/58.40  [8]~P1(x81,x82)+P3(x81,f2(x82,x81),x82)
% 58.19/58.40  [9]P4(x91,x92,x92)+~P4(x91,x93,x92)
% 58.19/58.40  [10]P4(x101,x102,x102)+~P4(x101,x102,x103)
% 58.19/58.40  [11]~P2(x114,x115)+~P4(x113,x115,x114)+~P3(x113,x111,x114)+~P3(x113,x112,x115)+P2(x111,x112)+~P1(x113,x114)+~P1(x113,x115)
% 58.19/58.40  [12]~P4(x123,x124,x124)+~P4(x125,x126,x126)+~P3(x123,x127,x124)+~P3(x125,x128,x126)+~P5(x123,x121,x124)+~P5(x125,x122,x126)+P2(x121,x122)+~P1(x123,x124)+~P1(x125,x126)+~P2(x127,x128)
% 58.19/58.40  %EqnAxiom
% 58.19/58.40  
% 58.19/58.40  %-------------------------------------------
% 58.29/58.53  cnf(313511,plain,
% 58.29/58.53     (P4(a1,a6,a6)),
% 58.29/58.53     inference(scs_inference,[],[4,9])).
% 58.29/58.53  cnf(313513,plain,
% 58.29/58.53     (P4(a1,a3,a3)),
% 58.29/58.53     inference(scs_inference,[],[4,9,10])).
% 58.29/58.53  cnf(313515,plain,
% 58.29/58.53     (P3(a1,f2(a3,a1),a3)),
% 58.29/58.53     inference(scs_inference,[],[1,4,9,10,8])).
% 58.29/58.53  cnf(313519,plain,
% 58.29/58.53     (P3(a1,f2(a6,a1),a6)),
% 58.29/58.53     inference(scs_inference,[],[2,8])).
% 58.29/58.53  cnf(313521,plain,
% 58.29/58.53     (P2(f2(a6,a1),f2(a3,a1))),
% 58.29/58.53     inference(scs_inference,[],[1,313515,4,2,3,8,11])).
% 58.29/58.53  cnf(313543,plain,
% 58.29/58.53     ($false),
% 58.29/58.53     inference(scs_inference,[],[1,313521,313511,313519,313513,313515,5,2,6,7,12]),
% 58.29/58.53     ['proof']).
% 58.41/58.60  % SZS output end Proof
% 58.41/58.60  % Total time :58.005470s
%------------------------------------------------------------------------------