↑ Up

Prover9---2026-6A.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : MGT053+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n018.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 : Sun Sep 27 08:02:59 AM UTC 2026

% Result   : Theorem 0.12s 0.37s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   25
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   44 (   5 unt;   0 def)
%            Number of atoms       :  120 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  110 (  34   ~;  69   |;   3   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   50 (   6 sgn   9   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(definition_2,axiom,
    ! [X,T0,T] :
      ( dissimilar(X,T0,T)
    <=> ( ~ ( is_aligned(X,T0)
          <=> is_aligned(X,T) )
        & organization(X) ) ),
    file('theBenchmark.p',definition_2) ).

fof(lemma_7,conjecture,
    ! [X,T1,T2] :
      ( dissimilar(X,T1,T2)
    <=> dissimilar(X,T2,T1) ),
    file('theBenchmark.p',lemma_7) ).

fof(lemma_7_neg,negated_conjecture,
    ~ ! [X,T1,T2] :
        ( dissimilar(X,T1,T2)
      <=> dissimilar(X,T2,T1) ),
    inference(assume_negation,[status(cth)],[lemma_7]) ).

cnf(c_18,plain,
    ( organization(A)
    | ~ dissimilar(A,B,C) ),
    inference(clausify,[status(thm)],[definition_2]) ).

cnf(c_19,plain,
    ( is_aligned(A,C)
    | ~ is_aligned(A,B)
    | ~ organization(A)
    | dissimilar(A,B,C) ),
    inference(clausify,[status(thm)],[definition_2]) ).

cnf(c_20,plain,
    ( ~ is_aligned(A,C)
    | is_aligned(A,B)
    | ~ organization(A)
    | dissimilar(A,B,C) ),
    inference(clausify,[status(thm)],[definition_2]) ).

cnf(c_21,plain,
    ( ~ is_aligned(A,E)
    | is_aligned(A,D)
    | dissimilar(A,D,E)
    | ~ dissimilar(A,B,C) ),
    inference(resolve,[status(thm)],[c_18,c_20]) ).

cnf(c_22,plain,
    ( is_aligned(A,E)
    | ~ is_aligned(A,D)
    | dissimilar(A,D,E)
    | ~ dissimilar(A,B,C) ),
    inference(resolve,[status(thm)],[c_18,c_19]) ).

cnf(c_26,plain,
    ( is_aligned(A,C)
    | is_aligned(A,B)
    | ~ dissimilar(A,B,C) ),
    inference(clausify,[status(thm)],[definition_2]) ).

cnf(c_27,plain,
    ( ~ is_aligned(A,C)
    | ~ is_aligned(A,B)
    | ~ dissimilar(A,B,C) ),
    inference(clausify,[status(thm)],[definition_2]) ).

fof(nnf_8,plain,
    ? [X,T1,T2] :
      ( ( ~ dissimilar(X,T2,T1)
        | ~ dissimilar(X,T1,T2) )
      & ( dissimilar(X,T2,T1)
        | dissimilar(X,T1,T2) ) ),
    inference(fof_nnf,[status(thm)],[lemma_7_neg]) ).

fof(sk_lemma_7_neg,plain,
    ( ( ~ dissimilar(sK0,sK2,sK1)
      | ~ dissimilar(sK0,sK1,sK2) )
    & ( dissimilar(sK0,sK2,sK1)
      | dissimilar(sK0,sK1,sK2) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X,sK0),skolemize(T1,sK1),skolemize(T2,sK2)],[nnf_8]) ).

cnf(c_28,negated_conjecture,
    ( dissimilar(sK0,sK2,sK1)
    | dissimilar(sK0,sK1,sK2) ),
    inference(split_conjunct,[status(thm)],[sk_lemma_7_neg]) ).

cnf(c_29,negated_conjecture,
    ( ~ dissimilar(sK0,sK2,sK1)
    | ~ dissimilar(sK0,sK1,sK2) ),
    inference(split_conjunct,[status(thm)],[sk_lemma_7_neg]) ).

cnf(c_41,plain,
    ( ~ is_aligned(sK0,sK1)
    | ~ is_aligned(sK0,sK2)
    | dissimilar(sK0,sK1,sK2) ),
    inference(resolve,[status(thm)],[c_28,c_27]) ).

cnf(c_42,plain,
    ( is_aligned(sK0,sK1)
    | is_aligned(sK0,sK2)
    | dissimilar(sK0,sK1,sK2) ),
    inference(resolve,[status(thm)],[c_28,c_26]) ).

cnf(c_43,plain,
    ( is_aligned(sK0,B)
    | ~ is_aligned(sK0,A)
    | dissimilar(sK0,A,B)
    | dissimilar(sK0,sK1,sK2) ),
    inference(resolve,[status(thm)],[c_28,c_22]) ).

cnf(c_45,plain,
    ( is_aligned(sK0,sK2)
    | ~ is_aligned(sK0,sK1)
    | dissimilar(sK0,sK1,sK2) ),
    inference(factor,[status(thm)],[c_43]) ).

cnf(c_78,plain,
    ( is_aligned(sK0,sK2)
    | is_aligned(sK0,sK1)
    | is_aligned(sK0,sK1)
    | is_aligned(sK0,sK2) ),
    inference(resolve,[status(thm)],[c_42,c_26]) ).

cnf(c_79,plain,
    ( is_aligned(sK0,sK2)
    | is_aligned(sK0,sK1)
    | is_aligned(sK0,sK2) ),
    inference(copy,[status(thm)],[c_78]) ).

cnf(c_47,plain,
    ( is_aligned(sK0,sK1)
    | is_aligned(sK0,sK2) ),
    inference(copy,[status(thm)],[c_79]) ).

cnf(c_80,negated_conjecture,
    ( dissimilar(sK0,sK1,sK2)
    | ~ is_aligned(sK0,B)
    | is_aligned(sK0,A)
    | dissimilar(sK0,A,B) ),
    inference(resolve,[status(thm)],[c_21,c_28]) ).

cnf(c_49,negated_conjecture,
    ( is_aligned(sK0,sK1)
    | dissimilar(sK0,sK1,sK2)
    | is_aligned(sK0,A)
    | dissimilar(sK0,A,sK2) ),
    inference(resolve,[status(thm)],[c_80,c_47]) ).

cnf(c_81,plain,
    ( is_aligned(sK0,sK1)
    | is_aligned(sK0,sK1)
    | dissimilar(sK0,sK1,sK2) ),
    inference(factor,[status(thm)],[c_49]) ).

cnf(c_50,plain,
    ( is_aligned(sK0,sK1)
    | dissimilar(sK0,sK1,sK2) ),
    inference(copy,[status(thm)],[c_81]) ).

cnf(c_82,plain,
    ( is_aligned(sK0,sK1)
    | is_aligned(sK0,B)
    | ~ is_aligned(sK0,A)
    | dissimilar(sK0,A,B) ),
    inference(resolve,[status(thm)],[c_22,c_50]) ).

cnf(c_83,plain,
    ( is_aligned(sK0,sK1)
    | is_aligned(sK0,sK1)
    | is_aligned(sK0,A)
    | dissimilar(sK0,sK2,A) ),
    inference(resolve,[status(thm)],[c_82,c_47]) ).

cnf(c_53,plain,
    ( is_aligned(sK0,sK1)
    | is_aligned(sK0,A)
    | dissimilar(sK0,sK2,A) ),
    inference(copy,[status(thm)],[c_83]) ).

cnf(c_57,plain,
    ( is_aligned(sK0,sK1)
    | dissimilar(sK0,sK2,sK1) ),
    inference(factor,[status(thm)],[c_53]) ).

cnf(c_84,negated_conjecture,
    ( is_aligned(sK0,sK1)
    | ~ dissimilar(sK0,sK2,sK1) ),
    inference(resolve,[status(thm)],[c_29,c_50]) ).

cnf(c_85,negated_conjecture,
    ( is_aligned(sK0,sK1)
    | is_aligned(sK0,sK1) ),
    inference(resolve,[status(thm)],[c_84,c_57]) ).

cnf(c_59,negated_conjecture,
    is_aligned(sK0,sK1),
    inference(copy,[status(thm)],[c_85]) ).

cnf(c_60,plain,
    ( is_aligned(sK0,sK2)
    | dissimilar(sK0,sK1,sK2) ),
    inference(resolve,[status(thm)],[c_59,c_45]) ).

cnf(c_61,plain,
    ( ~ is_aligned(sK0,sK2)
    | dissimilar(sK0,sK1,sK2) ),
    inference(resolve,[status(thm)],[c_59,c_41]) ).

cnf(c_86,plain,
    ( is_aligned(sK0,sK2)
    | ~ is_aligned(sK0,B)
    | is_aligned(sK0,A)
    | dissimilar(sK0,A,B) ),
    inference(resolve,[status(thm)],[c_21,c_60]) ).

cnf(c_68,plain,
    ( is_aligned(sK0,sK2)
    | is_aligned(sK0,A)
    | dissimilar(sK0,A,sK1) ),
    inference(resolve,[status(thm)],[c_86,c_59]) ).

cnf(c_71,plain,
    ( is_aligned(sK0,sK2)
    | dissimilar(sK0,sK2,sK1) ),
    inference(factor,[status(thm)],[c_68]) ).

cnf(c_87,negated_conjecture,
    ( is_aligned(sK0,sK2)
    | ~ dissimilar(sK0,sK2,sK1) ),
    inference(resolve,[status(thm)],[c_29,c_60]) ).

cnf(c_88,negated_conjecture,
    ( is_aligned(sK0,sK2)
    | is_aligned(sK0,sK2) ),
    inference(resolve,[status(thm)],[c_87,c_71]) ).

cnf(c_73,negated_conjecture,
    is_aligned(sK0,sK2),
    inference(copy,[status(thm)],[c_88]) ).

cnf(c_74,plain,
    dissimilar(sK0,sK1,sK2),
    inference(resolve,[status(thm)],[c_73,c_61]) ).

cnf(c_89,plain,
    ( ~ is_aligned(sK0,A)
    | ~ dissimilar(sK0,sK1,A) ),
    inference(resolve,[status(thm)],[c_27,c_59]) ).

cnf(c_90,plain,
    ~ dissimilar(sK0,sK1,sK2),
    inference(resolve,[status(thm)],[c_89,c_73]) ).

cnf(c_77,plain,
    $false,
    inference(resolve,[status(thm)],[c_74,c_90]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT053+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n018.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sat Sep 26 00:12:05 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.35  % Process 3182928 was started by sandbox on n018,
% 0.09/0.35  % Sat Sep 26 00:12:05 2026
% 0.09/0.35  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.36  
% 0.09/0.36  % From the command line: assign(max_seconds, 300).
% 0.12/0.37  
% 0.12/0.37  % SZS status Theorem for theBenchmark
% 0.12/0.37  
% 0.12/0.37  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.12/0.37  % Length of proof is 28.
% 0.12/0.37  % Level of proof is 14.
% 0.12/0.37  % Maximum clause weight is 19.000.
% 0.12/0.37  % Given clauses 25.
% 0.12/0.37  
% 0.12/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------