↑ Up

ConnectPP---0.7.2.THM-Prf.s

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

% Computer : n007.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:56 AM UTC 2026

% Result   : Theorem 0.14s 0.39s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(left_to_right,axiom,
    ! [A,B] :
      ( ( p(B)
        & less(A,B)
        & p(A) )
     => goal ),
    file('theBenchmark.p',left_to_right) ).

fof(right_to_left,axiom,
    ! [A] :
      ( ? [B] :
          ( p(B)
          & less(A,B) )
      | p(A) ),
    file('theBenchmark.p',right_to_left) ).

fof(transitive_less,axiom,
    ! [A,B,C] :
      ( ( less(B,C)
        & less(A,B) )
     => less(A,C) ),
    file('theBenchmark.p',transitive_less) ).

fof(serial_less,axiom,
    ! [A] :
    ? [B] : less(A,B),
    file('theBenchmark.p',serial_less) ).

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

fof(f_1_1,plain,
    ! [A,B] :
      ( goal
      | ~ p(B)
      | ~ less(A,B)
      | ~ p(A) ),
    inference(fof_nnf,[status(thm)],[left_to_right]) ).

fof(f_1_2,plain,
    ! [U_1,U_0] :
      ( goal
      | ~ p(U_0)
      | ~ less(U_1,U_0)
      | ~ p(U_1) ),
    inference(variable_rename,[status(thm)],[f_1_1]) ).

fof(f_1_3,plain,
    ( ! [U_1] :
        ( ! [U_0] :
            ( ~ p(U_0)
            | ~ less(U_1,U_0) )
        | ~ p(U_1) )
    | goal ),
    inference(miniscope,[status(thm)],[f_1_2]) ).

cnf(f_1_4,plain,
    ( ~ p(U_0)
    | ~ less(U_1,U_0)
    | ~ p(U_1)
    | goal ),
    inference(clausify,[status(thm)],[f_1_3]) ).

fof(f_2_1,plain,
    ! [A] :
      ( ? [B] :
          ( p(B)
          & less(A,B) )
      | p(A) ),
    inference(fof_nnf,[status(thm)],[right_to_left]) ).

fof(f_2_2,plain,
    ! [U_3] :
      ( ? [U_2] :
          ( p(U_2)
          & less(U_3,U_2) )
      | p(U_3) ),
    inference(variable_rename,[status(thm)],[f_2_1]) ).

fof(f_2_3,plain,
    ! [U_3] :
      ( ( p(sK1(U_3))
        & less(U_3,sK1(U_3)) )
      | p(U_3) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_2,sK1(U_3))],[f_2_2]) ).

cnf(f_2_4,plain,
    ( less(U_3,sK1(U_3))
    | p(U_3) ),
    inference(clausify,[status(thm)],[f_2_3]) ).

cnf(f_2_5,plain,
    ( p(sK1(U_3))
    | p(U_3) ),
    inference(clausify,[status(thm)],[f_2_3]) ).

fof(f_3_1,plain,
    ! [A,B,C] :
      ( less(A,C)
      | ~ less(B,C)
      | ~ less(A,B) ),
    inference(fof_nnf,[status(thm)],[transitive_less]) ).

fof(f_3_2,plain,
    ! [U_6,U_5,U_4] :
      ( less(U_6,U_4)
      | ~ less(U_5,U_4)
      | ~ less(U_6,U_5) ),
    inference(variable_rename,[status(thm)],[f_3_1]) ).

cnf(f_3_3,plain,
    ( less(U_6,U_4)
    | ~ less(U_5,U_4)
    | ~ less(U_6,U_5) ),
    inference(clausify,[status(thm)],[f_3_2]) ).

fof(f_4_1,plain,
    ! [A] :
    ? [B] : less(A,B),
    inference(fof_nnf,[status(thm)],[serial_less]) ).

fof(f_4_2,plain,
    ! [U_8] :
    ? [U_7] : less(U_8,U_7),
    inference(variable_rename,[status(thm)],[f_4_1]) ).

fof(f_4_3,plain,
    ! [U_8] : less(U_8,sK2(U_8)),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_7,sK2(U_8))],[f_4_2]) ).

cnf(f_4_4,plain,
    less(U_8,sK2(U_8)),
    inference(clausify,[status(thm)],[f_4_3]) ).

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

fof(f_5_2,negated_conjecture,
    ~ goal,
    inference(definitional_conversion,[status(esa)],[f_5_1]) ).

cnf(f_5_3,negated_conjecture,
    ~ goal,
    inference(clausify,[status(thm)],[f_5_2]) ).

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

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