↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SWX233-1 : TPTP v9.3.1. Released v9.3.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 : n011.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:08 AM UTC 2026

% Result   : Unsatisfiable 0.78s 1.05s
% Output   : Proof 0.78s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   40 (  29 unt;   0 nHn;  37 RR)
%            Number of literals    :   59 (  44 equ;  21 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   13 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_006,axiom,
    f(nil) = btrue,
    file('theBenchmark.p',axiom_006) ).

cnf(axiom_008,axiom,
    prop1(X) = eq(f(X),bfalse),
    file('theBenchmark.p',axiom_008) ).

cnf(axiom_010,axiom,
    eq(btrue,bfalse) = bfalse,
    file('theBenchmark.p',axiom_010) ).

cnf(axiom_011,axiom,
    eq(X,X) = btrue,
    file('theBenchmark.p',axiom_011) ).

cnf(goal,negated_conjecture,
    eq(prop1(X),bfalse) != btrue,
    file('theBenchmark.p',goal) ).

cnf(equality_1,axiom,
    Eq_x_0 = Eq_x_0,
    theory(equality,[reflexivity]) ).

cnf(equality_2,axiom,
    ( Eq_x_1 = Eq_x_0
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[symmetry]) ).

cnf(equality_3,axiom,
    ( Eq_x_0 = Eq_x_2
    | Eq_x_1 != Eq_x_2
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[transitivity]) ).

cnf(equality_10,axiom,
    ( eq(Eq_x_0,Eq_x_1) = eq(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(t1,plain,
    eq(prop1(nil),bfalse) != btrue,
    inference(start,[status(thm),parent(0:0)],[goal]) ).

cnf(t2,plain,
    ( eq(eq(f(nil),bfalse),bfalse) != btrue
    | eq(prop1(nil),bfalse) != eq(eq(f(nil),bfalse),bfalse)
    | eq(prop1(nil),bfalse) = btrue ),
    inference(extension,[status(thm),parent(t1:1)],[equality_3]) ).

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

cnf(t4,plain,
    ( bfalse != bfalse
    | prop1(nil) != eq(f(nil),bfalse)
    | eq(prop1(nil),bfalse) = eq(eq(f(nil),bfalse),bfalse) ),
    inference(extension,[status(thm),parent(t2:2)],[equality_10]) ).

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

cnf(t6,plain,
    prop1(nil) = eq(f(nil),bfalse),
    inference(extension,[status(thm),parent(t4:2)],[axiom_008]) ).

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

cnf(t8,plain,
    ( eq(btrue,bfalse) != bfalse
    | bfalse != eq(btrue,bfalse)
    | bfalse = bfalse ),
    inference(extension,[status(thm),parent(t4:3)],[equality_3]) ).

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

cnf(t10,plain,
    ( eq(btrue,bfalse) != bfalse
    | bfalse = eq(btrue,bfalse) ),
    inference(extension,[status(thm),parent(t8:2)],[equality_2]) ).

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

cnf(t12,plain,
    eq(btrue,bfalse) = bfalse,
    inference(extension,[status(thm),parent(t10:2)],[axiom_010]) ).

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

cnf(t14,plain,
    eq(btrue,bfalse) = bfalse,
    inference(extension,[status(thm),parent(t8:3)],[axiom_010]) ).

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

cnf(t16,plain,
    ( eq(eq(btrue,bfalse),eq(btrue,bfalse)) != btrue
    | eq(eq(f(nil),bfalse),bfalse) != eq(eq(btrue,bfalse),eq(btrue,bfalse))
    | eq(eq(f(nil),bfalse),bfalse) = btrue ),
    inference(extension,[status(thm),parent(t2:3)],[equality_3]) ).

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

cnf(t18,plain,
    ( bfalse != eq(btrue,bfalse)
    | eq(f(nil),bfalse) != eq(btrue,bfalse)
    | eq(eq(f(nil),bfalse),bfalse) = eq(eq(btrue,bfalse),eq(btrue,bfalse)) ),
    inference(extension,[status(thm),parent(t16:2)],[equality_10]) ).

cnf(t19,plain,
    $false,
    inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).

cnf(t20,plain,
    ( bfalse != bfalse
    | f(nil) != btrue
    | eq(f(nil),bfalse) = eq(btrue,bfalse) ),
    inference(extension,[status(thm),parent(t18:2)],[equality_10]) ).

cnf(t21,plain,
    $false,
    inference(connection,[status(thm),parent(t20:1)],[t20:1,t18:2]) ).

cnf(t22,plain,
    f(nil) = btrue,
    inference(extension,[status(thm),parent(t20:2)],[axiom_006]) ).

cnf(t23,plain,
    $false,
    inference(connection,[status(thm),parent(t22:1)],[t22:1,t20:2]) ).

cnf(t24,plain,
    bfalse = bfalse,
    inference(extension,[status(thm),parent(t20:3)],[equality_1]) ).

cnf(t25,plain,
    $false,
    inference(connection,[status(thm),parent(t24:1)],[t24:1,t20:3]) ).

cnf(t26,plain,
    ( eq(btrue,bfalse) != bfalse
    | bfalse = eq(btrue,bfalse) ),
    inference(extension,[status(thm),parent(t18:3)],[equality_2]) ).

cnf(t27,plain,
    $false,
    inference(connection,[status(thm),parent(t26:1)],[t26:1,t18:3]) ).

cnf(t28,plain,
    eq(btrue,bfalse) = bfalse,
    inference(extension,[status(thm),parent(t26:2)],[axiom_010]) ).

cnf(t29,plain,
    $false,
    inference(connection,[status(thm),parent(t28:1)],[t28:1,t26:2]) ).

cnf(t30,plain,
    eq(eq(btrue,bfalse),eq(btrue,bfalse)) = btrue,
    inference(extension,[status(thm),parent(t16:3)],[axiom_011]) ).

cnf(t31,plain,
    $false,
    inference(connection,[status(thm),parent(t30:1)],[t30:1,t16:3]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWX233-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.03  This is a CNF_UNS_RFO_PEQ_UEQ problem
% 0.00/0.04  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n011.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 20 06:22:09 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.78/1.05  % SZS status Unsatisfiable for theBenchmark
% 0.78/1.05  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------