↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : MGT045-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n015.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 : Fri Sep 25 02:11:49 PM UTC 2026

% Result   : Unsatisfiable 6.66s 1.45s
% Output   : Proof 6.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   48 (  36 unt;   0 def)
%            Number of atoms       :   68 (  25 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   50 (  30   ~;  20   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-4 aty)
%            Number of variables   :   50 (   2 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f11,axiom,
    ( greater(position(A,B),position(A,C))
    | ~ greater(external_ties(A,B),external_ties(A,C))
    | ~ organization(A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_6_30) ).

fof(f11_nnf,plain,
    ! [A,B,C] :
      ( greater(position(A,B),position(A,C))
      | ~ greater(external_ties(A,B),external_ties(A,C))
      | ~ organization(A) ),
    inference(nnf_transformation,[status(thm)],[f11]) ).

fof(f11_sk,plain,
    ! [A,B,C] :
      ( greater(position(A,B),position(A,C))
      | ~ greater(external_ties(A,B),external_ties(A,C))
      | ~ organization(A) ),
    inference(skolemisation,[status(esa)],[f11_nnf]) ).

cnf(c11,plain,
    ( greater(position(X0,X1),position(X0,X2))
    | ~ greater(external_ties(X0,X1),external_ties(X0,X2))
    | ~ organization(X0) ),
    inference(cnf_transformation,[status(esa)],[f11_sk]) ).

cnf(t28,plain,
    ifeq(organization(X1),true,ifeq(greater(external_ties(X1,X2),external_ties(X1,X3)),true,greater(position(X1,X2),position(X1,X3)),true),true) = true,
    inference(equality_encoding,[status(esa)],[c11]) ).

cnf(t45,plain,
    ifeq(organization(X1),true,ifeq(greater(external_ties(X1,X2),external_ties(X1,X3)),true,greater(position(X1,X2),position(X1,X3)),true),true) = true,
    inference(orient,[status(thm)],[t28]) ).

cnf(f13,axiom,
    ( greater(external_ties(A,B),external_ties(A,C))
    | ~ greater(age(A,B),age(A,C))
    | ~ organization(A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_8_32) ).

fof(f13_nnf,plain,
    ! [A,B,C] :
      ( greater(external_ties(A,B),external_ties(A,C))
      | ~ greater(age(A,B),age(A,C))
      | ~ organization(A) ),
    inference(nnf_transformation,[status(thm)],[f13]) ).

fof(f13_sk,plain,
    ! [A,B,C] :
      ( greater(external_ties(A,B),external_ties(A,C))
      | ~ greater(age(A,B),age(A,C))
      | ~ organization(A) ),
    inference(skolemisation,[status(esa)],[f13_nnf]) ).

cnf(c13,plain,
    ( greater(external_ties(X0,X1),external_ties(X0,X2))
    | ~ greater(age(X0,X1),age(X0,X2))
    | ~ organization(X0) ),
    inference(cnf_transformation,[status(esa)],[f13_sk]) ).

cnf(t27,plain,
    ifeq(organization(X1),true,ifeq(greater(age(X1,X2),age(X1,X3)),true,greater(external_ties(X1,X2),external_ties(X1,X3)),true),true) = true,
    inference(equality_encoding,[status(esa)],[c13]) ).

cnf(t46,plain,
    ifeq(organization(X1),true,ifeq(greater(age(X1,X2),age(X1,X3)),true,greater(external_ties(X1,X2),external_ties(X1,X3)),true),true) = true,
    inference(orient,[status(thm)],[t27]) ).

cnf(f15,negated_conjecture,
    greater(age(sk1,sk3),age(sk1,sk2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_4_34) ).

fof(f15_nnf,plain,
    greater(age(sk1,sk3),age(sk1,sk2)),
    inference(nnf_transformation,[status(thm)],[f15]) ).

cnf(c15,plain,
    greater(age(sk1,sk3),age(sk1,sk2)),
    inference(cnf_transformation,[status(esa)],[f15_nnf]) ).

cnf(t10,plain,
    greater(age(sk1,sk3),age(sk1,sk2)) = true,
    inference(equality_encoding,[status(esa)],[c15]) ).

cnf(t49,plain,
    greater(age(sk1,sk3),age(sk1,sk2)) = true,
    inference(orient,[status(thm)],[t10]) ).

cnf(t59,plain,
    true = ifeq(organization(sk1),true,ifeq(true,true,greater(external_ties(sk1,sk3),external_ties(sk1,sk2)),true),true),
    inference(cp,[status(thm)],[t46,t49]) ).

cnf(f14,negated_conjecture,
    organization(sk1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_4_33) ).

fof(f14_nnf,plain,
    organization(sk1),
    inference(nnf_transformation,[status(thm)],[f14]) ).

cnf(c14,plain,
    organization(sk1),
    inference(cnf_transformation,[status(esa)],[f14_nnf]) ).

cnf(t2,plain,
    organization(sk1) = true,
    inference(equality_encoding,[status(esa)],[c14]) ).

cnf(t70,plain,
    organization(sk1) = true,
    inference(orient,[status(thm)],[t2]) ).

cnf(t181,plain,
    true = ifeq(true,true,ifeq(true,true,greater(external_ties(sk1,sk3),external_ties(sk1,sk2)),true),true),
    inference(step,[status(thm)],[t59,t70]) ).

cnf(t8,plain,
    ifeq(X1,X1,X2,X3) = X2,
    introduced(definition) ).

cnf(t29,plain,
    ifeq(X1,X1,X2,X3) = X2,
    inference(orient,[status(thm)],[t8]) ).

cnf(t182,plain,
    true = ifeq(true,true,greater(external_ties(sk1,sk3),external_ties(sk1,sk2)),true),
    inference(step,[status(thm)],[t181,t29]) ).

cnf(t183,plain,
    true = greater(external_ties(sk1,sk3),external_ties(sk1,sk2)),
    inference(step,[status(thm)],[t182,t29]) ).

cnf(t135,plain,
    greater(external_ties(sk1,sk3),external_ties(sk1,sk2)) = true,
    inference(orient,[status(thm)],[t183]) ).

cnf(t147,plain,
    true = ifeq(organization(sk1),true,ifeq(true,true,greater(position(sk1,sk3),position(sk1,sk2)),true),true),
    inference(cp,[status(thm)],[t45,t135]) ).

cnf(t186,plain,
    true = ifeq(true,true,ifeq(true,true,greater(position(sk1,sk3),position(sk1,sk2)),true),true),
    inference(step,[status(thm)],[t147,t70]) ).

cnf(t187,plain,
    true = ifeq(true,true,greater(position(sk1,sk3),position(sk1,sk2)),true),
    inference(step,[status(thm)],[t186,t29]) ).

cnf(t188,plain,
    true = greater(position(sk1,sk3),position(sk1,sk2)),
    inference(step,[status(thm)],[t187,t29]) ).

cnf(f16,negated_conjecture,
    ~ greater(position(sk1,sk3),position(sk1,sk2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_4_35) ).

fof(f16_nnf,plain,
    ~ greater(position(sk1,sk3),position(sk1,sk2)),
    inference(nnf_transformation,[status(thm)],[f16]) ).

fof(f16_sk,plain,
    ~ greater(position(sk1,sk3),position(sk1,sk2)),
    inference(skolemisation,[status(esa)],[f16_nnf]) ).

cnf(c16,plain,
    ~ greater(position(sk1,sk3),position(sk1,sk2)),
    inference(cnf_transformation,[status(esa)],[f16_sk]) ).

cnf(t11,plain,
    greater(position(sk1,sk3),position(sk1,sk2)) = false,
    inference(equality_encoding,[status(esa)],[c16]) ).

cnf(t77,plain,
    greater(position(sk1,sk3),position(sk1,sk2)) = false,
    inference(orient,[status(thm)],[t11]) ).

cnf(t189,plain,
    true = false,
    inference(step,[status(thm)],[t188,t77]) ).

cnf(t149,plain,
    false = true,
    inference(orient,[status(thm)],[t189]) ).

cnf(f8,axiom,
    ( ~ greater(B,A)
    | ~ greater(A,B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',meaning_postulate_greater_strict_9) ).

fof(f8_nnf,plain,
    ! [A,B] :
      ( ~ greater(B,A)
      | ~ greater(A,B) ),
    inference(nnf_transformation,[status(thm)],[f8]) ).

fof(f8_sk,plain,
    ! [A,B] :
      ( ~ greater(B,A)
      | ~ greater(A,B) ),
    inference(skolemisation,[status(esa)],[f8_nnf]) ).

cnf(c8,plain,
    ( ~ greater(X1,X0)
    | ~ greater(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c8,c16]) ).

cnf(g0_0,plain,
    true != true,
    inference(rw,[status(thm)],[goal_0,t149]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT045-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.38  % Computer : n015.cluster.edu
% 0.09/0.38  % Model    : x86_64 x86_64
% 0.09/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38  % Memory   : 8046.5625MB
% 0.09/0.38  % OS       : Linux 6.8.0-71-generic
% 0.09/0.38  % CPULimit : 300
% 0.09/0.38  % WCLimit  : 300
% 0.09/0.38  % DateTime : Thu Sep 24 01:15:11 UTC 2026
% 0.09/0.39  % CPUTime  : 
% 0.09/0.39  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.66/1.45  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.66/1.45  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------