↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n001.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:15 PM UTC 2026

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

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

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

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

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

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

cnf(t372,plain,
    eq(q1(X1,c,c),true) = efalse,
    inference(orient,[status(thm)],[t67]) ).

cnf(f132,axiom,
    ( ~ p0(G,F)
    | q1(F,G,G) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_095) ).

fof(f132_nnf,plain,
    ! [F,G] :
      ( ~ p0(G,F)
      | q1(F,G,G) ),
    inference(nnf_transformation,[status(thm)],[f132]) ).

fof(f132_sk,plain,
    ! [F,G] :
      ( ~ p0(G,F)
      | q1(F,G,G) ),
    inference(skolemisation,[status(esa)],[f132_nnf]) ).

cnf(c132,plain,
    ( ~ p0(X1,X0)
    | q1(X0,X1,X1) ),
    inference(cnf_transformation,[status(esa)],[f132_sk]) ).

cnf(hi130,axiom,
    ifeq(p0(X0,X1),true,q1(X1,X0,X0),true) = true,
    inference(equality_encoding,[status(esa)],[c132]) ).

cnf(f17,axiom,
    p0(c,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_18) ).

fof(f17_nnf,plain,
    p0(c,b),
    inference(nnf_transformation,[status(thm)],[f17]) ).

cnf(c17,plain,
    p0(c,b),
    inference(cnf_transformation,[status(esa)],[f17_nnf]) ).

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

cnf(t57,plain,
    q1(b,c,c) = true,
    inference(hyper_resolution,[status(thm)],[hi130,hi17]) ).

cnf(t277,plain,
    q1(b,c,c) = true,
    inference(orient,[status(thm)],[t57]) ).

cnf(t373,plain,
    efalse = eq(true,true),
    inference(cp,[status(thm)],[t372,t277]) ).

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

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

cnf(t383,plain,
    efalse = etrue,
    inference(step,[status(thm)],[t373,t371]) ).

cnf(t374,plain,
    efalse = etrue,
    inference(orient,[status(thm)],[t383]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN281-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/0.38  % Computer : n001.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Fri Sep 25 00:48:38 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.21/1.32  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.21/1.32  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------