↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : COM007+2 : TPTP v9.3.1. Released v3.2.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 : n006.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:14:43 AM UTC 2026

% Result   : Theorem 202.81s 203.21s
% Output   : Proof 204.00s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(assumption,axiom,
    ( reflexive_rewrite(a,c)
    & reflexive_rewrite(a,b) ),
    file('theBenchmark.p',assumption) ).

fof(goal_ax,axiom,
    ! [A] :
      ( ( reflexive_rewrite(c,A)
        & reflexive_rewrite(b,A) )
     => goal ),
    file('theBenchmark.p',goal_ax) ).

fof(equal_in_reflexive_rewrite,axiom,
    ! [A,B] :
      ( A = B
     => reflexive_rewrite(A,B) ),
    file('theBenchmark.p',equal_in_reflexive_rewrite) ).

fof(rewrite_in_reflexive_rewrite,axiom,
    ! [A,B] :
      ( rewrite(A,B)
     => reflexive_rewrite(A,B) ),
    file('theBenchmark.p',rewrite_in_reflexive_rewrite) ).

fof(equal_or_rewrite,axiom,
    ! [A,B] :
      ( reflexive_rewrite(A,B)
     => ( rewrite(A,B)
        | A = B ) ),
    file('theBenchmark.p',equal_or_rewrite) ).

fof(rewrite_diamond,axiom,
    ! [A,B,C] :
      ( ( rewrite(A,C)
        & rewrite(A,B) )
     => ? [D] :
          ( rewrite(C,D)
          & rewrite(B,D) ) ),
    file('theBenchmark.p',rewrite_diamond) ).

fof(goal_to_be_proved,conjecture,
    goal,
    file('theBenchmark.p',goal_to_be_proved) ).

fof(f_1_1,plain,
    ( reflexive_rewrite(a,c)
    & reflexive_rewrite(a,b) ),
    inference(fof_nnf,[status(thm)],[assumption]) ).

cnf(f_1_2,plain,
    reflexive_rewrite(a,b),
    inference(clausify,[status(thm)],[f_1_1]) ).

cnf(f_1_3,plain,
    reflexive_rewrite(a,c),
    inference(clausify,[status(thm)],[f_1_1]) ).

fof(f_2_1,plain,
    ! [A] :
      ( goal
      | ~ reflexive_rewrite(c,A)
      | ~ reflexive_rewrite(b,A) ),
    inference(fof_nnf,[status(thm)],[goal_ax]) ).

fof(f_2_2,plain,
    ! [U_0] :
      ( goal
      | ~ reflexive_rewrite(c,U_0)
      | ~ reflexive_rewrite(b,U_0) ),
    inference(variable_rename,[status(thm)],[f_2_1]) ).

fof(f_2_3,plain,
    ( ! [U_0] :
        ( ~ reflexive_rewrite(c,U_0)
        | ~ reflexive_rewrite(b,U_0) )
    | goal ),
    inference(miniscope,[status(thm)],[f_2_2]) ).

cnf(f_2_4,plain,
    ( ~ reflexive_rewrite(c,U_0)
    | ~ reflexive_rewrite(b,U_0)
    | goal ),
    inference(clausify,[status(thm)],[f_2_3]) ).

fof(f_3_1,plain,
    ! [A,B] :
      ( reflexive_rewrite(A,B)
      | A != B ),
    inference(fof_nnf,[status(thm)],[equal_in_reflexive_rewrite]) ).

fof(f_3_2,plain,
    ! [U_2,U_1] :
      ( reflexive_rewrite(U_2,U_1)
      | U_2 != U_1 ),
    inference(variable_rename,[status(thm)],[f_3_1]) ).

cnf(f_3_3,plain,
    ( reflexive_rewrite(U_2,U_1)
    | U_2 != U_1 ),
    inference(clausify,[status(thm)],[f_3_2]) ).

fof(f_4_1,plain,
    ! [A,B] :
      ( reflexive_rewrite(A,B)
      | ~ rewrite(A,B) ),
    inference(fof_nnf,[status(thm)],[rewrite_in_reflexive_rewrite]) ).

fof(f_4_2,plain,
    ! [U_4,U_3] :
      ( reflexive_rewrite(U_4,U_3)
      | ~ rewrite(U_4,U_3) ),
    inference(variable_rename,[status(thm)],[f_4_1]) ).

cnf(f_4_3,plain,
    ( reflexive_rewrite(U_4,U_3)
    | ~ rewrite(U_4,U_3) ),
    inference(clausify,[status(thm)],[f_4_2]) ).

fof(f_5_1,plain,
    ! [A,B] :
      ( rewrite(A,B)
      | A = B
      | ~ reflexive_rewrite(A,B) ),
    inference(fof_nnf,[status(thm)],[equal_or_rewrite]) ).

fof(f_5_2,plain,
    ! [U_6,U_5] :
      ( rewrite(U_6,U_5)
      | U_6 = U_5
      | ~ reflexive_rewrite(U_6,U_5) ),
    inference(variable_rename,[status(thm)],[f_5_1]) ).

cnf(f_5_3,plain,
    ( rewrite(U_6,U_5)
    | U_6 = U_5
    | ~ reflexive_rewrite(U_6,U_5) ),
    inference(clausify,[status(thm)],[f_5_2]) ).

fof(f_6_1,plain,
    ! [A,B,C] :
      ( ? [D] :
          ( rewrite(C,D)
          & rewrite(B,D) )
      | ~ rewrite(A,C)
      | ~ rewrite(A,B) ),
    inference(fof_nnf,[status(thm)],[rewrite_diamond]) ).

fof(f_6_2,plain,
    ! [U_10,U_9,U_8] :
      ( ? [U_7] :
          ( rewrite(U_8,U_7)
          & rewrite(U_9,U_7) )
      | ~ rewrite(U_10,U_8)
      | ~ rewrite(U_10,U_9) ),
    inference(variable_rename,[status(thm)],[f_6_1]) ).

fof(f_6_3,plain,
    ! [U_10,U_9,U_8] :
      ( ( rewrite(U_8,sK1(U_10,U_9,U_8))
        & rewrite(U_9,sK1(U_10,U_9,U_8)) )
      | ~ rewrite(U_10,U_8)
      | ~ rewrite(U_10,U_9) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_7,sK1(U_10,U_9,U_8))],[f_6_2]) ).

cnf(f_6_4,plain,
    ( rewrite(U_9,sK1(U_10,U_9,U_8))
    | ~ rewrite(U_10,U_8)
    | ~ rewrite(U_10,U_9) ),
    inference(clausify,[status(thm)],[f_6_3]) ).

cnf(f_6_5,plain,
    ( rewrite(U_8,sK1(U_10,U_9,U_8))
    | ~ rewrite(U_10,U_8)
    | ~ rewrite(U_10,U_9) ),
    inference(clausify,[status(thm)],[f_6_3]) ).

fof(f_7_1,negated_conjecture,
    ~ goal,
    inference(negate,[status(cth)],[goal_to_be_proved]) ).

cnf(f_7_2,negated_conjecture,
    ~ goal,
    inference(clausify,[status(thm)],[f_7_1]) ).

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,
    ( sK1(Eq_x_0,Eq_x_1,Eq_x_2) = sK1(Eq_y_0,Eq_y_1,Eq_y_2)
    | Eq_x_2 != Eq_y_2
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

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

cnf(equality_6,axiom,
    ( rewrite(Eq_y_0,Eq_y_1)
    | ~ rewrite(Eq_x_0,Eq_x_1)
    | Eq_x_1 != Eq_y_1
    | 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.05  % Problem  : COM007+2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  This is a FOF_THM_RFO_SEQ problem
% 0.00/0.06  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.43  % Computer : n006.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Sun Sep 20 15:08:27 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 202.81/203.21  % SZS status Theorem for theBenchmark
% 202.81/203.21  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------