↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SYN978+1 : TPTP v9.3.1. Released v3.1.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 : 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 : Thu Sep 24 09:11:19 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
    ( ( b
      & a )
   => ( a
    <=> b ) ),
    file('theBenchmark.p',prove_this) ).

fof(f_1_1,negated_conjecture,
    ( ~ ( a
      <=> b )
    & b
    & a ),
    inference(negate,[status(cth)],[prove_this]) ).

fof(f_1_2,negated_conjecture,
    ( ( ( ~ a
        & b )
      | ( ~ b
        & a ) )
    & b
    & a ),
    inference(fof_nnf,[status(thm)],[f_1_1]) ).

fof(f_1_3,negated_conjecture,
    ( ( ~ a
      | ~ sP1 )
    & ( b
      | ~ sP1 )
    & ( ~ b
      | ~ sP0 )
    & ( a
      | ~ sP0 )
    & ( sP1
      | sP0 )
    & b
    & a ),
    inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_1_2]) ).

cnf(f_1_4,negated_conjecture,
    a,
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_5,negated_conjecture,
    b,
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_6,negated_conjecture,
    ( sP1
    | sP0 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_7,negated_conjecture,
    ( a
    | ~ sP0 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_8,negated_conjecture,
    ( ~ b
    | ~ sP0 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_9,negated_conjecture,
    ( b
    | ~ sP1 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_10,negated_conjecture,
    ( ~ a
    | ~ sP1 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN978+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03  This is a FOF_THM_PRP problem
% 0.00/0.03  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n018.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 : Sun Sep 20 07:31:26 UTC 2026
% 0.09/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
%------------------------------------------------------------------------------