↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SYN014-2 : TPTP v9.3.1. Released v1.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 : n009.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:13 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(reflexivityish,axiom,
    equalish(X,X),
    file('theBenchmark.p',reflexivityish) ).

cnf(symmetryish,axiom,
    ( equalish(Y,X)
    | ~ equalish(X,Y) ),
    file('theBenchmark.p',symmetryish) ).

cnf(transitivityish,axiom,
    ( equalish(X,Z)
    | ~ equalish(Y,Z)
    | ~ equalish(X,Y) ),
    file('theBenchmark.p',transitivityish) ).

cnf(element_substitutionish1,axiom,
    ( element(C,B)
    | ~ element(C,A)
    | ~ equalish(A,B) ),
    file('theBenchmark.p',element_substitutionish1) ).

cnf(element_substitutionish2,axiom,
    ( element(C,B)
    | ~ equalish(A,C)
    | ~ element(A,B) ),
    file('theBenchmark.p',element_substitutionish2) ).

cnf(c_3,negated_conjecture,
    ( equalish(A,a)
    | equalish(A,k)
    | ~ element(A,a) ),
    file('theBenchmark.p',c_3) ).

cnf(c_4,negated_conjecture,
    ( equalish(A,a)
    | element(A,a)
    | ~ equalish(A,k) ),
    file('theBenchmark.p',c_4) ).

cnf(c_5,negated_conjecture,
    ( equalish(A,m)
    | ~ element(A,m)
    | ~ equalish(f(A),m) ),
    file('theBenchmark.p',c_5) ).

cnf(c_6,negated_conjecture,
    ( equalish(A,m)
    | ~ element(A,m)
    | ~ equalish(f(A),A) ),
    file('theBenchmark.p',c_6) ).

cnf(c_7,negated_conjecture,
    ( equalish(A,m)
    | ~ element(A,m)
    | element(A,f(A)) ),
    file('theBenchmark.p',c_7) ).

cnf(c_8,negated_conjecture,
    ( equalish(A,m)
    | ~ element(A,m)
    | element(f(A),A) ),
    file('theBenchmark.p',c_8) ).

cnf(c_9,negated_conjecture,
    ( equalish(B,m)
    | element(B,m)
    | equalish(A,m)
    | equalish(A,B)
    | ~ element(B,A)
    | ~ element(A,B) ),
    file('theBenchmark.p',c_9) ).

cnf(c_10,negated_conjecture,
    ( equalish(A,n)
    | element(A,n)
    | ~ equalish(g(A),n) ),
    file('theBenchmark.p',c_10) ).

cnf(c_11,negated_conjecture,
    ( equalish(A,n)
    | element(A,n)
    | ~ equalish(g(A),A) ),
    file('theBenchmark.p',c_11) ).

cnf(c_12,negated_conjecture,
    ( equalish(A,n)
    | element(A,n)
    | element(A,g(A)) ),
    file('theBenchmark.p',c_12) ).

cnf(c_13,negated_conjecture,
    ( equalish(A,n)
    | element(A,n)
    | element(g(A),A) ),
    file('theBenchmark.p',c_13) ).

cnf(c_14,negated_conjecture,
    ( equalish(B,n)
    | ~ element(B,n)
    | equalish(A,n)
    | equalish(A,B)
    | ~ element(B,A)
    | ~ element(A,B) ),
    file('theBenchmark.p',c_14) ).

cnf(c_15,negated_conjecture,
    ( equalish(A,k)
    | element(A,k)
    | ~ equalish(A,m) ),
    file('theBenchmark.p',c_15) ).

cnf(c_16,negated_conjecture,
    ( equalish(A,k)
    | element(A,k)
    | ~ equalish(A,n) ),
    file('theBenchmark.p',c_16) ).

cnf(c_17,negated_conjecture,
    ( equalish(A,k)
    | equalish(A,m)
    | equalish(A,n)
    | ~ element(A,k) ),
    file('theBenchmark.p',c_17) ).

cnf(c_18,negated_conjecture,
    ~ equalish(n,a),
    file('theBenchmark.p',c_18) ).

cnf(c_19,negated_conjecture,
    ~ equalish(m,n),
    file('theBenchmark.p',c_19) ).

cnf(c_20,negated_conjecture,
    equalish(n,k),
    file('theBenchmark.p',c_20) ).

cnf(c_21,negated_conjecture,
    ~ equalish(m,a),
    file('theBenchmark.p',c_21) ).

cnf(c_22,negated_conjecture,
    ~ equalish(k,a),
    file('theBenchmark.p',c_22) ).

cnf(c_23,negated_conjecture,
    equalish(m,k),
    file('theBenchmark.p',c_23) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN014-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  This is a CNF_UNS_RFO_NEQ_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.08/0.34  % Computer : n009.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Sun Sep 20 06:22:27 UTC 2026
% 0.08/0.34  % CPUTime  : 
% 0.13/0.38  % SZS status Unsatisfiable for theBenchmark
% 0.13/0.38  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------