↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n008.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:33:47 PM UTC 2026

% Result   : Unsatisfiable 0.60s 0.80s
% Output   : Proof 0.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   31
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   58 (  11 unt;   0 def)
%            Number of atoms       :  135 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  133 (  56   ~;  77   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :    9 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f6,negated_conjecture,
    ( ~ big_p(f(f(sk1)))
    | ~ big_p(sk2)
    | big_p(f(sk2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel62_7) ).

fof(f6_nnf,plain,
    ( ~ big_p(f(f(sk1)))
    | ~ big_p(sk2)
    | big_p(f(sk2)) ),
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ( ~ big_p(f(f(sk1)))
    | ~ big_p(sk2)
    | big_p(f(sk2)) ),
    inference(skolemisation,[status(esa)],[f6_nnf]) ).

cnf(c6,plain,
    ( ~ big_p(f(f(sk1)))
    | ~ big_p(sk2)
    | big_p(f(sk2)) ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

cnf(f1,negated_conjecture,
    ( ~ big_p(a)
    | big_p(A)
    | big_p(f(f(A))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel62_2) ).

fof(f1_nnf,plain,
    ! [A] :
      ( ~ big_p(a)
      | big_p(A)
      | big_p(f(f(A))) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [A] :
      ( ~ big_p(a)
      | big_p(A)
      | big_p(f(f(A))) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ( ~ big_p(a)
    | big_p(X0)
    | big_p(f(f(X0))) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(f0,negated_conjecture,
    big_p(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel62_1) ).

fof(f0_nnf,plain,
    big_p(a),
    inference(nnf_transformation,[status(thm)],[f0]) ).

cnf(c0,plain,
    big_p(a),
    inference(cnf_transformation,[status(esa)],[f0_nnf]) ).

cnf(p7,plain,
    ( big_p(X0)
    | big_p(f(f(X0))) ),
    inference(resolution,[status(thm)],[c1,c0]) ).

cnf(f3,negated_conjecture,
    ( ~ big_p(f(f(sk2)))
    | ~ big_p(f(f(sk1))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel62_4) ).

fof(f3_nnf,plain,
    ( ~ big_p(f(f(sk2)))
    | ~ big_p(f(f(sk1))) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ( ~ big_p(f(f(sk2)))
    | ~ big_p(f(f(sk1))) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    ( ~ big_p(f(f(sk2)))
    | ~ big_p(f(f(sk1))) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(p8,plain,
    ( ~ big_p(f(f(sk2)))
    | big_p(sk1) ),
    inference(resolution,[status(thm)],[p7,c3]) ).

cnf(p10,plain,
    ( big_p(sk2)
    | big_p(sk1) ),
    inference(resolution,[status(thm)],[p8,p7]) ).

cnf(p11,plain,
    ( big_p(sk1)
    | ~ big_p(f(f(sk1)))
    | big_p(f(sk2)) ),
    inference(resolution,[status(thm)],[c6,p10]) ).

cnf(p14,plain,
    ( big_p(sk1)
    | big_p(sk1)
    | big_p(f(sk2)) ),
    inference(resolution,[status(thm)],[p11,p7]) ).

cnf(p15,plain,
    ( big_p(sk1)
    | big_p(f(sk2)) ),
    inference(factoring,[status(thm)],[p14]) ).

cnf(f2,negated_conjecture,
    ( ~ big_p(a)
    | ~ big_p(f(A))
    | big_p(f(f(A))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel62_3) ).

fof(f2_nnf,plain,
    ! [A] :
      ( ~ big_p(a)
      | ~ big_p(f(A))
      | big_p(f(f(A))) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [A] :
      ( ~ big_p(a)
      | ~ big_p(f(A))
      | big_p(f(f(A))) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ( ~ big_p(a)
    | ~ big_p(f(X0))
    | big_p(f(f(X0))) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(p17,plain,
    ( ~ big_p(a)
    | big_p(f(f(sk2)))
    | big_p(sk1) ),
    inference(resolution,[status(thm)],[p15,c2]) ).

cnf(p19,plain,
    ( big_p(f(f(sk2)))
    | big_p(sk1) ),
    inference(resolution,[status(thm)],[p17,c0]) ).

cnf(p21,plain,
    ( big_p(sk1)
    | big_p(sk1) ),
    inference(resolution,[status(thm)],[p19,p8]) ).

cnf(p23,plain,
    big_p(sk1),
    inference(factoring,[status(thm)],[p21]) ).

cnf(f5,negated_conjecture,
    ( ~ big_p(f(f(sk2)))
    | ~ big_p(sk1)
    | big_p(f(sk1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel62_6) ).

fof(f5_nnf,plain,
    ( ~ big_p(f(f(sk2)))
    | ~ big_p(sk1)
    | big_p(f(sk1)) ),
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    ( ~ big_p(f(f(sk2)))
    | ~ big_p(sk1)
    | big_p(f(sk1)) ),
    inference(skolemisation,[status(esa)],[f5_nnf]) ).

cnf(c5,plain,
    ( ~ big_p(f(f(sk2)))
    | ~ big_p(sk1)
    | big_p(f(sk1)) ),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(p24,plain,
    ( ~ big_p(f(f(sk2)))
    | big_p(f(sk1)) ),
    inference(resolution,[status(thm)],[p23,c5]) ).

cnf(p26,plain,
    ( big_p(sk2)
    | big_p(f(sk1)) ),
    inference(resolution,[status(thm)],[p24,p7]) ).

cnf(p27,plain,
    ( ~ big_p(a)
    | big_p(f(f(sk1)))
    | big_p(sk2) ),
    inference(resolution,[status(thm)],[p26,c2]) ).

cnf(p29,plain,
    ( big_p(f(f(sk1)))
    | big_p(sk2) ),
    inference(resolution,[status(thm)],[p27,c0]) ).

cnf(p30,plain,
    ( ~ big_p(f(f(sk2)))
    | big_p(sk2) ),
    inference(resolution,[status(thm)],[p29,c3]) ).

cnf(p32,plain,
    ( big_p(sk2)
    | big_p(sk2) ),
    inference(resolution,[status(thm)],[p30,p7]) ).

cnf(p34,plain,
    big_p(sk2),
    inference(factoring,[status(thm)],[p32]) ).

cnf(f4,negated_conjecture,
    ( ~ big_p(sk2)
    | ~ big_p(sk1)
    | big_p(f(sk2))
    | big_p(f(sk1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel62_5) ).

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

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

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

cnf(p25,plain,
    ( ~ big_p(sk2)
    | big_p(f(sk2))
    | big_p(f(sk1)) ),
    inference(resolution,[status(thm)],[p23,c4]) ).

cnf(p36,plain,
    ( big_p(f(sk2))
    | big_p(f(sk1)) ),
    inference(resolution,[status(thm)],[p34,p25]) ).

cnf(p37,plain,
    ( ~ big_p(a)
    | big_p(f(f(sk2)))
    | big_p(f(sk1)) ),
    inference(resolution,[status(thm)],[p36,c2]) ).

cnf(p39,plain,
    ( big_p(f(f(sk2)))
    | big_p(f(sk1)) ),
    inference(resolution,[status(thm)],[p37,c0]) ).

cnf(p41,plain,
    ( big_p(f(sk1))
    | big_p(f(sk1)) ),
    inference(resolution,[status(thm)],[p39,p24]) ).

cnf(p42,plain,
    big_p(f(sk1)),
    inference(factoring,[status(thm)],[p41]) ).

cnf(p43,plain,
    ( ~ big_p(a)
    | big_p(f(f(sk1))) ),
    inference(resolution,[status(thm)],[p42,c2]) ).

cnf(p45,plain,
    big_p(f(f(sk1))),
    inference(resolution,[status(thm)],[p43,c0]) ).

cnf(p35,plain,
    ( ~ big_p(f(f(sk1)))
    | big_p(f(sk2)) ),
    inference(resolution,[status(thm)],[p34,c6]) ).

cnf(p48,plain,
    big_p(f(sk2)),
    inference(resolution,[status(thm)],[p45,p35]) ).

cnf(p49,plain,
    ( ~ big_p(a)
    | big_p(f(f(sk2))) ),
    inference(resolution,[status(thm)],[p48,c2]) ).

cnf(p51,plain,
    big_p(f(f(sk2))),
    inference(resolution,[status(thm)],[p49,c0]) ).

cnf(p46,plain,
    ~ big_p(f(f(sk2))),
    inference(resolution,[status(thm)],[p45,c3]) ).

cnf(p53,plain,
    $false,
    inference(resolution,[status(thm)],[p51,p46]) ).

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