↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SYN048+1 : TPTP v9.3.1. Released v2.0.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 : n003.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 09:09:18 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(pel18,conjecture,
    ? [Y] :
    ! [X] :
      ( big_f(Y)
     => big_f(X) ),
    file('theBenchmark.p',pel18) ).

fof(f_1_1,negated_conjecture,
    ~ ? [Y] :
      ! [X] :
        ( big_f(Y)
       => big_f(X) ),
    inference(negate,[status(cth)],[pel18]) ).

fof(f_1_2,negated_conjecture,
    ! [Y] :
    ? [X] :
      ( ~ big_f(X)
      & big_f(Y) ),
    inference(fof_nnf,[status(thm)],[f_1_1]) ).

fof(f_1_3,negated_conjecture,
    ! [U_1] :
    ? [U_0] :
      ( ~ big_f(U_0)
      & big_f(U_1) ),
    inference(variable_rename,[status(thm)],[f_1_2]) ).

fof(f_1_4,negated_conjecture,
    ( ! [U_1] : big_f(U_1)
    & ? [U_0] : ~ big_f(U_0) ),
    inference(miniscope,[status(thm)],[f_1_3]) ).

fof(f_1_5,negated_conjecture,
    ( ! [U_1] : big_f(U_1)
    & ~ big_f(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1)],[f_1_4]) ).

fof(f_1_6,negated_conjecture,
    ( ! [U_1] : big_f(U_1)
    & ~ big_f(sK1) ),
    inference(definitional_conversion,[status(esa)],[f_1_5]) ).

cnf(f_1_7,negated_conjecture,
    ~ big_f(sK1),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(f_1_8,negated_conjecture,
    big_f(U_1),
    inference(clausify,[status(thm)],[f_1_6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN048+1 : TPTP v9.3.1. Released v2.0.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.11/0.35  % Computer : n003.cluster.edu
% 0.11/0.35  % Model    : x86_64 x86_64
% 0.11/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35  % Memory   : 8046.5625MB
% 0.11/0.35  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Sun Sep 20 06:24:14 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.14/0.38  % SZS status Theorem for theBenchmark
% 0.14/0.38  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------