↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n004.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:35:34 PM UTC 2026

% Result   : Unsatisfiable 5.88s 1.46s
% Output   : Proof 5.88s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   44 (  15 unt;   0 def)
%            Number of atoms       :   86 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   77 (  35   ~;  42   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   69 (   7 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f1,negated_conjecture,
    ( ~ q(B,C)
    | ~ q(A,B)
    | q(A,C) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm400_2) ).

fof(f1_nnf,plain,
    ! [A,C,B] :
      ( ~ q(B,C)
      | ~ q(A,B)
      | q(A,C) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [A,C,B] :
      ( ~ q(B,C)
      | ~ q(A,B)
      | q(A,C) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ( ~ q(X2,X1)
    | ~ q(X0,X2)
    | q(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(f3,negated_conjecture,
    ( q(A,B)
    | p(A,B) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm400_4) ).

fof(f3_nnf,plain,
    ! [A,B] :
      ( q(A,B)
      | p(A,B) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [A,B] :
      ( q(A,B)
      | p(A,B) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    ( q(X0,X1)
    | p(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(f2,negated_conjecture,
    ( ~ q(A,B)
    | q(B,A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm400_3) ).

fof(f2_nnf,plain,
    ! [B,A] :
      ( ~ q(A,B)
      | q(B,A) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [B,A] :
      ( ~ q(A,B)
      | q(B,A) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ( ~ q(X1,X0)
    | q(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(p7,plain,
    ( q(X1,X0)
    | p(X0,X1) ),
    inference(resolution,[status(thm)],[c3,c2]) ).

cnf(p13,plain,
    ( p(X2,X0)
    | ~ q(X2,X1)
    | q(X0,X1) ),
    inference(resolution,[status(thm)],[c1,p7]) ).

cnf(p17,plain,
    ( p(X2,X1)
    | p(X2,X0)
    | q(X0,X1) ),
    inference(resolution,[status(thm)],[p13,c3]) ).

cnf(f5,negated_conjecture,
    ~ q(sk3,sk4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm400_6) ).

fof(f5_nnf,plain,
    ~ q(sk3,sk4),
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    ~ q(sk3,sk4),
    inference(skolemisation,[status(esa)],[f5_nnf]) ).

cnf(c5,plain,
    ~ q(sk3,sk4),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(p69,plain,
    ( p(X0,sk4)
    | p(X0,sk3) ),
    inference(resolution,[status(thm)],[p17,c5]) ).

cnf(f0,negated_conjecture,
    ( ~ p(B,C)
    | ~ p(A,B)
    | p(A,C) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm400_1) ).

fof(f0_nnf,plain,
    ! [A,C,B] :
      ( ~ p(B,C)
      | ~ p(A,B)
      | p(A,C) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [A,C,B] :
      ( ~ p(B,C)
      | ~ p(A,B)
      | p(A,C) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( ~ p(X2,X1)
    | ~ p(X0,X2)
    | p(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p113,plain,
    ( ~ p(sk4,X1)
    | p(X0,X1)
    | p(X0,sk3) ),
    inference(resolution,[status(thm)],[p69,c0]) ).

cnf(p525,plain,
    ( ~ p(sk4,sk3)
    | p(X0,sk3) ),
    inference(factoring,[status(thm)],[p113]) ).

cnf(p12,plain,
    ( p(X0,X2)
    | ~ q(X2,X1)
    | q(X0,X1) ),
    inference(resolution,[status(thm)],[c1,c3]) ).

cnf(p16,plain,
    ( p(X1,X2)
    | p(X0,X2)
    | q(X0,X1) ),
    inference(resolution,[status(thm)],[p12,p7]) ).

cnf(p45,plain,
    ( p(sk4,X0)
    | p(sk3,X0) ),
    inference(resolution,[status(thm)],[p16,c5]) ).

cnf(p6,plain,
    p(sk3,sk4),
    inference(resolution,[status(thm)],[c3,c5]) ).

cnf(p8,plain,
    ( ~ p(sk4,X0)
    | p(sk3,X0) ),
    inference(resolution,[status(thm)],[p6,c0]) ).

cnf(p84,plain,
    ( p(sk3,X0)
    | p(sk3,X0) ),
    inference(resolution,[status(thm)],[p45,p8]) ).

cnf(p115,plain,
    p(sk3,X0),
    inference(factoring,[status(thm)],[p84]) ).

cnf(p9,plain,
    p(sk4,sk3),
    inference(resolution,[status(thm)],[p7,c5]) ).

cnf(p10,plain,
    ( ~ p(sk3,X0)
    | p(sk4,X0) ),
    inference(resolution,[status(thm)],[p9,c0]) ).

cnf(p127,plain,
    p(sk4,X0),
    inference(resolution,[status(thm)],[p115,p10]) ).

cnf(p536,plain,
    p(X0,sk3),
    inference(resolution,[status(thm)],[p525,p127]) ).

cnf(p559,plain,
    ( ~ p(sk3,X1)
    | p(X0,X1) ),
    inference(resolution,[status(thm)],[p536,c0]) ).

cnf(p564,plain,
    p(X0,X1),
    inference(resolution,[status(thm)],[p559,p115]) ).

cnf(f4,negated_conjecture,
    ~ p(sk1,sk2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm400_5) ).

fof(f4_nnf,plain,
    ~ p(sk1,sk2),
    inference(nnf_transformation,[status(thm)],[f4]) ).

fof(f4_sk,plain,
    ~ p(sk1,sk2),
    inference(skolemisation,[status(esa)],[f4_nnf]) ).

cnf(c4,plain,
    ~ p(sk1,sk2),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(p565,plain,
    $false,
    inference(resolution,[status(thm)],[p564,c4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN726-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/0.37  % Computer : n004.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Fri Sep 25 02:11:36 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.88/1.46  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.88/1.46  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------