↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SET203-6 : TPTP v9.3.1. Bugfixed v2.1.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 : n008.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:56:35 AM UTC 2026

% Result   : Unsatisfiable 6.77s 22.10s
% Output   : Proof 6.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   21 (  16 unt;   0 nHn;  20 RR)
%            Number of literals    :   31 (   0 equ;  12 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :    8 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
    ( member(U,Y)
    | ~ member(U,X)
    | ~ subclass(X,Y) ),
    file('SET004-0.ax',subclass_members) ).

cnf(class_elements_are_sets,axiom,
    subclass(X,universal_class),
    file('SET004-0.ax',class_elements_are_sets) ).

cnf(cartesian_product3,axiom,
    ( member(ordered_pair(U,V),cross_product(X,Y))
    | ~ member(V,Y)
    | ~ member(U,X) ),
    file('SET004-0.ax',cartesian_product3) ).

cnf(prove_corollary_to_X_product_property1_1,negated_conjecture,
    member(u,x),
    file('theBenchmark.p',prove_corollary_to_X_product_property1_1) ).

cnf(prove_corollary_to_X_product_property1_2,negated_conjecture,
    member(v,y),
    file('theBenchmark.p',prove_corollary_to_X_product_property1_2) ).

cnf(prove_corollary_to_X_product_property1_3,negated_conjecture,
    ~ member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
    file('theBenchmark.p',prove_corollary_to_X_product_property1_3) ).

cnf(t1,plain,
    ~ member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
    inference(start,[status(thm),parent(0:0)],[prove_corollary_to_X_product_property1_3]) ).

cnf(t2,plain,
    ( ~ member(v,universal_class)
    | ~ member(u,universal_class)
    | member(ordered_pair(u,v),cross_product(universal_class,universal_class)) ),
    inference(extension,[status(thm),parent(t1:1)],[cartesian_product3]) ).

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

cnf(t4,plain,
    ( ~ member(u,x)
    | ~ subclass(x,universal_class)
    | member(u,universal_class) ),
    inference(extension,[status(thm),parent(t2:2)],[subclass_members]) ).

cnf(t5,plain,
    $false,
    inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).

cnf(t6,plain,
    subclass(x,universal_class),
    inference(extension,[status(thm),parent(t4:2)],[class_elements_are_sets]) ).

cnf(t7,plain,
    $false,
    inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).

cnf(t8,plain,
    member(u,x),
    inference(extension,[status(thm),parent(t4:3)],[prove_corollary_to_X_product_property1_1]) ).

cnf(t9,plain,
    $false,
    inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).

cnf(t10,plain,
    ( ~ member(v,y)
    | ~ subclass(y,universal_class)
    | member(v,universal_class) ),
    inference(extension,[status(thm),parent(t2:3)],[subclass_members]) ).

cnf(t11,plain,
    $false,
    inference(connection,[status(thm),parent(t10:1)],[t10:1,t2:3]) ).

cnf(t12,plain,
    subclass(y,universal_class),
    inference(extension,[status(thm),parent(t10:2)],[class_elements_are_sets]) ).

cnf(t13,plain,
    $false,
    inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).

cnf(t14,plain,
    member(v,y),
    inference(extension,[status(thm),parent(t10:3)],[prove_corollary_to_X_product_property1_2]) ).

cnf(t15,plain,
    $false,
    inference(connection,[status(thm),parent(t14:1)],[t14:1,t10:3]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET203-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.03  This is a CNF_UNS_RFO_SEQ_NHN 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.38  % Computer : n008.cluster.edu
% 0.10/15.38  % Model    : x86_64 x86_64
% 0.10/15.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/15.38  % Memory   : 8046.5625MB
% 0.10/15.38  % OS       : Linux 6.8.0-71-generic
% 0.10/15.38  % CPULimit : 300
% 0.10/15.38  % WCLimit  : 300
% 0.10/15.38  % DateTime : Sat Sep 19 21:57:42 UTC 2026
% 0.10/15.39  % CPUTime  : 
% 6.77/22.10  % SZS status Unsatisfiable for theBenchmark
% 6.77/22.10  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------