↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SET940+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 : n013.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:57:50 AM UTC 2026

% Result   : Theorem 0.15s 15.42s
% Output   : Proof 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (  15 unt;   0 def)
%            Number of atoms       :   15 (  14 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    8 (   8   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   17 (   0 sgn  10   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t93_zfmisc_1,conjecture,
    ! [A,B] : union(unordered_pair(A,B)) = set_union2(A,B),
    file('theBenchmark.p',t93_zfmisc_1) ).

fof(l52_zfmisc_1,axiom,
    ! [A,B] : union(unordered_pair(A,B)) = set_union2(A,B),
    file('theBenchmark.p',l52_zfmisc_1) ).

fof(f_8_1,negated_conjecture,
    ~ ! [A,B] : union(unordered_pair(A,B)) = set_union2(A,B),
    inference(negate,[status(cth)],[t93_zfmisc_1]) ).

fof(f_8_2,negated_conjecture,
    ? [A,B] : union(unordered_pair(A,B)) != set_union2(A,B),
    inference(fof_nnf,[status(thm)],[f_8_1]) ).

fof(f_8_3,negated_conjecture,
    ? [U_13,U_12] : union(unordered_pair(U_13,U_12)) != set_union2(U_13,U_12),
    inference(variable_rename,[status(thm)],[f_8_2]) ).

fof(f_8_4,negated_conjecture,
    ? [U_12] : union(unordered_pair(sK3,U_12)) != set_union2(sK3,U_12),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_13,sK3)],[f_8_3]) ).

fof(f_8_5,negated_conjecture,
    union(unordered_pair(sK3,sK4)) != set_union2(sK3,sK4),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_12,sK4)],[f_8_4]) ).

fof(f_8_6,negated_conjecture,
    union(unordered_pair(sK3,sK4)) != set_union2(sK3,sK4),
    inference(definitional_conversion,[status(esa)],[f_8_5]) ).

cnf(f_8_7,negated_conjecture,
    union(unordered_pair(sK3,sK4)) != set_union2(sK3,sK4),
    inference(clausify,[status(thm)],[f_8_6]) ).

fof(f_9_1,plain,
    ! [A,B] : union(unordered_pair(A,B)) = set_union2(A,B),
    inference(fof_nnf,[status(thm)],[l52_zfmisc_1]) ).

fof(f_9_2,plain,
    ! [U_15,U_14] : union(unordered_pair(U_15,U_14)) = set_union2(U_15,U_14),
    inference(variable_rename,[status(thm)],[f_9_1]) ).

cnf(f_9_3,plain,
    union(unordered_pair(U_15,U_14)) = set_union2(U_15,U_14),
    inference(clausify,[status(thm)],[f_9_2]) ).

cnf(t1,plain,
    union(unordered_pair(sK3,sK4)) != set_union2(sK3,sK4),
    inference(start,[status(thm),parent(0:0)],[f_8_7]) ).

cnf(t2,plain,
    union(unordered_pair(sK3,sK4)) = set_union2(sK3,sK4),
    inference(extension,[status(thm),parent(t1:1)],[f_9_3]) ).

cnf(t3,plain,
    $false,
    inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET940+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03  This is a FOF_THM_RFO_SEQ 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.10/15.39  % Computer : n013.cluster.edu
% 0.10/15.39  % Model    : x86_64 x86_64
% 0.10/15.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/15.39  % Memory   : 8046.5625MB
% 0.10/15.39  % OS       : Linux 6.8.0-71-generic
% 0.10/15.39  % CPULimit : 300
% 0.10/15.39  % WCLimit  : 300
% 0.10/15.39  % DateTime : Sat Sep 19 23:07:39 UTC 2026
% 0.10/15.39  % CPUTime  : 
% 0.15/15.42  % SZS status Theorem for theBenchmark
% 0.15/15.42  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------