↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SYN279-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% 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 : Fri Sep 25 03:34:14 PM UTC 2026

% Result   : Unsatisfiable 3.49s 0.82s
% Output   : Proof 3.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   29 (  25 unt;   0 def)
%            Number of atoms       :   37 (  14 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  14   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-4 aty)
%            Number of variables   :   28 (  10 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f368,negated_conjecture,
    ~ q1(X,a,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f368_nnf,plain,
    ! [X] : ~ q1(X,a,c),
    inference(nnf_transformation,[status(thm)],[f368]) ).

fof(f368_sk,plain,
    ! [X] : ~ q1(X,a,c),
    inference(skolemisation,[status(esa)],[f368_nnf]) ).

cnf(c368,plain,
    ~ q1(X0,a,c),
    inference(cnf_transformation,[status(esa)],[f368_sk]) ).

cnf(t73,plain,
    eq(q1(X1,a,c),true) = efalse,
    inference(equality_encoding,[status(esa)],[c368]) ).

cnf(t380,plain,
    eq(q1(X1,a,c),true) = efalse,
    inference(orient,[status(thm)],[t73]) ).

cnf(f129,axiom,
    ( ~ p0(C,J)
    | ~ n0(B,A)
    | q1(J,A,J) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_092) ).

fof(f129_nnf,plain,
    ! [J,A,B,C] :
      ( ~ p0(C,J)
      | ~ n0(B,A)
      | q1(J,A,J) ),
    inference(nnf_transformation,[status(thm)],[f129]) ).

fof(f129_sk,plain,
    ! [J,A,B,C] :
      ( ~ p0(C,J)
      | ~ n0(B,A)
      | q1(J,A,J) ),
    inference(skolemisation,[status(esa)],[f129_nnf]) ).

cnf(c129,plain,
    ( ~ p0(X3,X0)
    | ~ n0(X2,X1)
    | q1(X0,X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f129_sk]) ).

cnf(hi127,axiom,
    ifeq(n0(X0,X1),true,ifeq(p0(X2,X3),true,q1(X3,X1,X3),true),true) = true,
    inference(equality_encoding,[status(esa)],[c129]) ).

cnf(f36,axiom,
    n0(b,a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_37) ).

fof(f36_nnf,plain,
    n0(b,a),
    inference(nnf_transformation,[status(thm)],[f36]) ).

cnf(c36,plain,
    n0(b,a),
    inference(cnf_transformation,[status(esa)],[f36_nnf]) ).

cnf(hi36,axiom,
    n0(b,a) = true,
    inference(equality_encoding,[status(esa)],[c36]) ).

cnf(f21,axiom,
    p0(b,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_22) ).

fof(f21_nnf,plain,
    p0(b,c),
    inference(nnf_transformation,[status(thm)],[f21]) ).

cnf(c21,plain,
    p0(b,c),
    inference(cnf_transformation,[status(esa)],[f21_nnf]) ).

cnf(hi21,axiom,
    p0(b,c) = true,
    inference(equality_encoding,[status(esa)],[c21]) ).

cnf(t62,plain,
    q1(c,a,c) = true,
    inference(hyper_resolution,[status(thm)],[hi127,hi36,hi21]) ).

cnf(t229,plain,
    q1(c,a,c) = true,
    inference(orient,[status(thm)],[t62]) ).

cnf(t381,plain,
    efalse = eq(true,true),
    inference(cp,[status(thm)],[t380,t229]) ).

cnf(t0,plain,
    eq(X1,X1) = etrue,
    introduced(definition) ).

cnf(t379,plain,
    eq(X1,X1) = etrue,
    inference(orient,[status(thm)],[t0]) ).

cnf(t391,plain,
    efalse = etrue,
    inference(step,[status(thm)],[t381,t379]) ).

cnf(t382,plain,
    efalse = etrue,
    inference(orient,[status(thm)],[t391]) ).

cnf(goal_0,negated_conjecture,
    etrue != efalse,
    introduced(definition) ).

cnf(g0_0,plain,
    etrue != etrue,
    inference(rw,[status(thm)],[goal_0,t382]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SYN279-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.02  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.05/0.30  % Computer : n012.cluster.edu
% 0.05/0.30  % Model    : x86_64 x86_64
% 0.05/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.30  % Memory   : 8046.5625MB
% 0.05/0.30  % OS       : Linux 6.8.0-71-generic
% 0.05/0.30  % CPULimit : 300
% 0.05/0.30  % WCLimit  : 300
% 0.05/0.30  % DateTime : Fri Sep 25 00:42:20 UTC 2026
% 0.05/0.30  % CPUTime  : 
% 0.05/0.30  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.49/0.82  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.49/0.82  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------