↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SYN035-1 : 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 : n014.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:14 AM UTC 2026

% Result   : Unsatisfiable 0.12s 0.37s
% Output   : Proof 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   20 (  15 unt;   0 nHn;  13 RR)
%            Number of literals    :   32 (   0 equ;  14 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :   24 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause1,axiom,
    p(A,B),
    file('theBenchmark.p',clause1) ).

cnf(clause2,axiom,
    ( q(A,B)
    | ~ p(B,f(A,B))
    | ~ p(f(A,B),f(A,B)) ),
    file('theBenchmark.p',clause2) ).

cnf(theorem,negated_conjecture,
    ( ~ p(B,f(A,B))
    | ~ p(f(A,B),f(A,B))
    | ~ q(A,f(A,B))
    | ~ q(f(A,B),f(A,B)) ),
    file('theBenchmark.p',theorem) ).

cnf(t1,plain,
    ( ~ q(U_46,f(U_46,U_42))
    | ~ p(f(U_46,U_42),f(U_46,U_42))
    | ~ p(U_42,f(U_46,U_42))
    | ~ q(f(U_46,U_42),f(U_46,U_42)) ),
    inference(start,[status(thm),parent(0:0)],[theorem]) ).

cnf(t2,plain,
    ( ~ p(f(U_46,U_42),f(f(U_46,U_42),f(U_46,U_42)))
    | ~ p(f(f(U_46,U_42),f(U_46,U_42)),f(f(U_46,U_42),f(U_46,U_42)))
    | q(f(U_46,U_42),f(U_46,U_42)) ),
    inference(extension,[status(thm),parent(t1:1)],[clause2]) ).

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

cnf(t4,plain,
    p(f(f(U_46,U_42),f(U_46,U_42)),f(f(U_46,U_42),f(U_46,U_42))),
    inference(extension,[status(thm),parent(t2:2)],[clause1]) ).

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

cnf(t6,plain,
    p(f(U_46,U_42),f(f(U_46,U_42),f(U_46,U_42))),
    inference(extension,[status(thm),parent(t2:3)],[clause1]) ).

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

cnf(t8,plain,
    p(U_42,f(U_46,U_42)),
    inference(extension,[status(thm),parent(t1:2)],[clause1]) ).

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

cnf(t10,plain,
    p(f(U_46,U_42),f(U_46,U_42)),
    inference(extension,[status(thm),parent(t1:3)],[clause1]) ).

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

cnf(t12,plain,
    ( ~ p(f(U_46,U_42),f(U_46,f(U_46,U_42)))
    | ~ p(f(U_46,f(U_46,U_42)),f(U_46,f(U_46,U_42)))
    | q(U_46,f(U_46,U_42)) ),
    inference(extension,[status(thm),parent(t1:4)],[clause2]) ).

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

cnf(t14,plain,
    p(f(U_46,f(U_46,U_42)),f(U_46,f(U_46,U_42))),
    inference(extension,[status(thm),parent(t12:2)],[clause1]) ).

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

cnf(t16,plain,
    p(f(U_46,U_42),f(U_46,f(U_46,U_42))),
    inference(extension,[status(thm),parent(t12:3)],[clause1]) ).

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


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