↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SYN049-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 : n012.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:18 AM UTC 2026

% Result   : Unsatisfiable 0.03s 0.31s
% Output   : Proof 0.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    8 (   6 unt;   0 nHn;   6 RR)
%            Number of literals    :   10 (   0 equ;   4 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   0 con; 1-1 aty)
%            Number of variables   :    6 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_1,negated_conjecture,
    ( big_q(g(X))
    | ~ big_p(f(X)) ),
    file('theBenchmark.p',clause_1) ).

cnf(clause_2,negated_conjecture,
    big_p(X),
    file('theBenchmark.p',clause_2) ).

cnf(clause_3,negated_conjecture,
    ~ big_q(X),
    file('theBenchmark.p',clause_3) ).

cnf(t1,plain,
    ~ big_q(g(U_16)),
    inference(start,[status(thm),parent(0:0)],[clause_3]) ).

cnf(t2,plain,
    ( ~ big_p(f(U_16))
    | big_q(g(U_16)) ),
    inference(extension,[status(thm),parent(t1:1)],[clause_1]) ).

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

cnf(t4,plain,
    big_p(f(U_16)),
    inference(extension,[status(thm),parent(t2:2)],[clause_2]) ).

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


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