↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : MGT044-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n008.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 : Thu Sep 24 08:50:43 AM UTC 2026

% Result   : Unsatisfiable 0.11s 0.43s
% Output   : Proof 0.11s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(definition_smaller_or_equal_1,axiom,
    ( A = B
    | smaller(A,B)
    | ~ smaller_or_equal(A,B) ),
    file('MGT001-0.ax',definition_smaller_or_equal_1) ).

cnf(definition_smaller_or_equal_2,axiom,
    ( smaller_or_equal(A,B)
    | ~ smaller(A,B) ),
    file('MGT001-0.ax',definition_smaller_or_equal_2) ).

cnf(definition_smaller_or_equal_3,axiom,
    ( smaller_or_equal(A,B)
    | A != B ),
    file('MGT001-0.ax',definition_smaller_or_equal_3) ).

cnf(definition_greater_or_equal_4,axiom,
    ( A = B
    | greater(A,B)
    | ~ greater_or_equal(A,B) ),
    file('MGT001-0.ax',definition_greater_or_equal_4) ).

cnf(definition_greater_or_equal_5,axiom,
    ( greater_or_equal(A,B)
    | ~ greater(A,B) ),
    file('MGT001-0.ax',definition_greater_or_equal_5) ).

cnf(definition_greater_or_equal_6,axiom,
    ( greater_or_equal(A,B)
    | A != B ),
    file('MGT001-0.ax',definition_greater_or_equal_6) ).

cnf(definition_smaller_7,axiom,
    ( greater(B,A)
    | ~ smaller(A,B) ),
    file('MGT001-0.ax',definition_smaller_7) ).

cnf(definition_smaller_8,axiom,
    ( smaller(B,A)
    | ~ greater(A,B) ),
    file('MGT001-0.ax',definition_smaller_8) ).

cnf(meaning_postulate_greater_strict_9,axiom,
    ( ~ greater(B,A)
    | ~ greater(A,B) ),
    file('MGT001-0.ax',meaning_postulate_greater_strict_9) ).

cnf(meaning_postulate_greater_transitive_10,axiom,
    ( greater(A,C)
    | ~ greater(B,C)
    | ~ greater(A,B) ),
    file('MGT001-0.ax',meaning_postulate_greater_transitive_10) ).

cnf(meaning_postulate_greater_comparable_11,axiom,
    ( greater(A,B)
    | A = B
    | smaller(A,B) ),
    file('MGT001-0.ax',meaning_postulate_greater_comparable_11) ).

cnf(assumption_5_32,axiom,
    ( greater(capability(A,B),capability(A,C))
    | ~ smaller_or_equal(internal_friction(A,B),internal_friction(A,C))
    | ~ greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C))
    | ~ organization(A) ),
    file('theBenchmark.p',assumption_5_32) ).

cnf(assumption_5_33,axiom,
    ( smaller(capability(A,B),capability(A,C))
    | ~ greater(internal_friction(A,B),internal_friction(A,C))
    | ~ smaller_or_equal(stock_of_knowledge(A,B),stock_of_knowledge(A,C))
    | ~ organization(A) ),
    file('theBenchmark.p',assumption_5_33) ).

cnf(assumption_5_34,axiom,
    ( capability(A,B) = capability(A,C)
    | internal_friction(A,B) != internal_friction(A,C)
    | stock_of_knowledge(A,B) != stock_of_knowledge(A,C)
    | ~ organization(A) ),
    file('theBenchmark.p',assumption_5_34) ).

cnf(assumption_7_35,axiom,
    ( greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C))
    | ~ greater(age(A,B),age(A,C))
    | ~ organization(A) ),
    file('theBenchmark.p',assumption_7_35) ).

cnf(assumption_9_36,axiom,
    ( internal_friction(A,B) = internal_friction(A,C)
    | ~ organization(A) ),
    file('theBenchmark.p',assumption_9_36) ).

cnf(lemma_3_37,negated_conjecture,
    organization(sk1),
    file('theBenchmark.p',lemma_3_37) ).

cnf(lemma_3_38,negated_conjecture,
    greater(age(sk1,sk3),age(sk1,sk2)),
    file('theBenchmark.p',lemma_3_38) ).

cnf(lemma_3_39,negated_conjecture,
    ~ greater(capability(sk1,sk3),capability(sk1,sk2)),
    file('theBenchmark.p',lemma_3_39) ).

cnf(equality_1,axiom,
    Eq_x_0 = Eq_x_0,
    theory(equality,[reflexivity]) ).

cnf(equality_2,axiom,
    ( Eq_x_1 = Eq_x_0
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[symmetry]) ).

cnf(equality_3,axiom,
    ( Eq_x_0 = Eq_x_2
    | Eq_x_1 != Eq_x_2
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[transitivity]) ).

cnf(equality_4,axiom,
    ( stock_of_knowledge(Eq_x_0,Eq_x_1) = stock_of_knowledge(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_5,axiom,
    ( internal_friction(Eq_x_0,Eq_x_1) = internal_friction(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_6,axiom,
    ( capability(Eq_x_0,Eq_x_1) = capability(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_7,axiom,
    ( age(Eq_x_0,Eq_x_1) = age(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_8,axiom,
    ( smaller_or_equal(Eq_y_0,Eq_y_1)
    | ~ smaller_or_equal(Eq_x_0,Eq_x_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(equality_9,axiom,
    ( smaller(Eq_y_0,Eq_y_1)
    | ~ smaller(Eq_x_0,Eq_x_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(equality_10,axiom,
    ( greater_or_equal(Eq_y_0,Eq_y_1)
    | ~ greater_or_equal(Eq_x_0,Eq_x_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(equality_11,axiom,
    ( greater(Eq_y_0,Eq_y_1)
    | ~ greater(Eq_x_0,Eq_x_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(equality_12,axiom,
    ( organization(Eq_y_0)
    | ~ organization(Eq_x_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(sat_proved,plain,
    $false,
    inference(cadical,[status(thm)],[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT044-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03  This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.04  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36  % Computer : n008.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Sat Sep 19 16:16:23 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.43  % SZS status Unsatisfiable for theBenchmark
% 0.11/0.43  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------