↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n015.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 02:31:48 PM UTC 2026

% Result   : Unsatisfiable 3.31s 0.86s
% Output   : Proof 3.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   42 (  34 unt;   0 def)
%            Number of atoms       :   62 (  14 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   46 (  26   ~;  20   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-4 aty)
%            Number of variables   :   20 (   0 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f0,axiom,
    ( shaved(members,X)
    | ~ shaved(X,Y)
    | ~ member(Y)
    | ~ member(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',one_shaved_then_all_shaved) ).

fof(f0_nnf,plain,
    ! [X,Y] :
      ( shaved(members,X)
      | ~ shaved(X,Y)
      | ~ member(Y)
      | ~ member(X) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [X,Y] :
      ( shaved(members,X)
      | ~ shaved(X,Y)
      | ~ member(Y)
      | ~ member(X) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( shaved(members,X0)
    | ~ shaved(X0,X1)
    | ~ member(X1)
    | ~ member(X0) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(hi0,axiom,
    ifeq(member(X0),true,ifeq(member(X1),true,ifeq(shaved(X0,X1),true,shaved(members,X0),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(f2,hypothesis,
    member(guido),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',guido) ).

fof(f2_nnf,plain,
    member(guido),
    inference(nnf_transformation,[status(thm)],[f2]) ).

cnf(c2,plain,
    member(guido),
    inference(cnf_transformation,[status(esa)],[f2_nnf]) ).

cnf(hi2,axiom,
    member(guido) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(f5,hypothesis,
    member(cesare),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cesare) ).

fof(f5_nnf,plain,
    member(cesare),
    inference(nnf_transformation,[status(thm)],[f5]) ).

cnf(c5,plain,
    member(cesare),
    inference(cnf_transformation,[status(esa)],[f5_nnf]) ).

cnf(hi5,axiom,
    member(cesare) = true,
    inference(equality_encoding,[status(esa)],[c5]) ).

cnf(f6,hypothesis,
    shaved(guido,cesare),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',guido_has_shaved_cesare) ).

fof(f6_nnf,plain,
    shaved(guido,cesare),
    inference(nnf_transformation,[status(thm)],[f6]) ).

cnf(c6,plain,
    shaved(guido,cesare),
    inference(cnf_transformation,[status(esa)],[f6_nnf]) ).

cnf(hi6,axiom,
    shaved(guido,cesare) = true,
    inference(equality_encoding,[status(esa)],[c6]) ).

cnf(h0,plain,
    shaved(members,guido) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi2,hi5,hi6]) ).

cnf(f1,axiom,
    ( shaved(Y,X)
    | ~ member(Y)
    | ~ shaved(members,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',all_shaved_then_one_shaved) ).

fof(f1_nnf,plain,
    ! [X,Y] :
      ( shaved(Y,X)
      | ~ member(Y)
      | ~ shaved(members,X) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X,Y] :
      ( shaved(Y,X)
      | ~ member(Y)
      | ~ shaved(members,X) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ( shaved(X1,X0)
    | ~ member(X1)
    | ~ shaved(members,X0) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(hi1,axiom,
    ifeq(shaved(members,X0),true,ifeq(member(X1),true,shaved(X1,X0),true),true) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(f3,hypothesis,
    member(lorenzo),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lorenzo) ).

fof(f3_nnf,plain,
    member(lorenzo),
    inference(nnf_transformation,[status(thm)],[f3]) ).

cnf(c3,plain,
    member(lorenzo),
    inference(cnf_transformation,[status(esa)],[f3_nnf]) ).

cnf(hi3,axiom,
    member(lorenzo) = true,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(h3,plain,
    shaved(lorenzo,guido) = true,
    inference(hyper_resolution,[status(thm)],[hi1,h0,hi3]) ).

cnf(h7,plain,
    shaved(members,lorenzo) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi3,hi2,h3]) ).

cnf(f4,hypothesis,
    member(petruchio),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',petruchio) ).

fof(f4_nnf,plain,
    member(petruchio),
    inference(nnf_transformation,[status(thm)],[f4]) ).

cnf(c4,plain,
    member(petruchio),
    inference(cnf_transformation,[status(esa)],[f4_nnf]) ).

cnf(hi4,axiom,
    member(petruchio) = true,
    inference(equality_encoding,[status(esa)],[c4]) ).

cnf(t20,plain,
    shaved(petruchio,lorenzo) = true,
    inference(hyper_resolution,[status(thm)],[hi1,h7,hi4]) ).

cnf(t30,plain,
    shaved(petruchio,lorenzo) = true,
    inference(orient,[status(thm)],[t20]) ).

cnf(f7,negated_conjecture,
    ~ shaved(petruchio,lorenzo),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_petruchio_has_shaved_lorenzo) ).

fof(f7_nnf,plain,
    ~ shaved(petruchio,lorenzo),
    inference(nnf_transformation,[status(thm)],[f7]) ).

fof(f7_sk,plain,
    ~ shaved(petruchio,lorenzo),
    inference(skolemisation,[status(esa)],[f7_nnf]) ).

cnf(c7,plain,
    ~ shaved(petruchio,lorenzo),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

cnf(goal_0,negated_conjecture,
    shaved(petruchio,lorenzo) != true,
    inference(equality_encoding,[status(esa)],[c7]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : PUZ003-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.36  % Computer : n015.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Thu Sep 24 06:39:25 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.31/0.86  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.31/0.86  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------