↑ Up

Prover9---2026-6A.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SET027-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n019.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 : Sun Sep 27 08:35:25 AM UTC 2026

% Result   : Unsatisfiable 0.10s 0.45s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   19 (  11 unt;   0 def)
%            Number of atoms       :   29 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  12   ~;  10   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn   7   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_transitivity_of_subclass_3,axiom,
    ~ subclass(x,z),
    file('theBenchmark.p',prove_transitivity_of_subclass_3) ).

cnf(c_33,plain,
    ~ subclass(x,z),
    inference(clausify,[status(thm)],[prove_transitivity_of_subclass_3]) ).

fof(prove_transitivity_of_subclass_2,axiom,
    subclass(y,z),
    file('theBenchmark.p',prove_transitivity_of_subclass_2) ).

cnf(c_34,plain,
    subclass(y,z),
    inference(clausify,[status(thm)],[prove_transitivity_of_subclass_2]) ).

fof(prove_transitivity_of_subclass_1,axiom,
    subclass(x,y),
    file('theBenchmark.p',prove_transitivity_of_subclass_1) ).

cnf(c_35,plain,
    subclass(x,y),
    inference(clausify,[status(thm)],[prove_transitivity_of_subclass_1]) ).

fof(not_subclass_members2,axiom,
    ! [VAR_0,VAR_1] :
      ( subclass(VAR_0,VAR_1)
      | ~ member(not_subclass_element(VAR_0,VAR_1),VAR_1) ),
    file('theBenchmark.p',not_subclass_members2) ).

cnf(c_124,plain,
    ( subclass(A,B)
    | ~ member(not_subclass_element(A,B),B) ),
    inference(clausify,[status(thm)],[not_subclass_members2]) ).

fof(not_subclass_members1,axiom,
    ! [VAR_0,VAR_1] :
      ( subclass(VAR_0,VAR_1)
      | member(not_subclass_element(VAR_0,VAR_1),VAR_0) ),
    file('theBenchmark.p',not_subclass_members1) ).

cnf(c_125,plain,
    ( subclass(A,B)
    | member(not_subclass_element(A,B),A) ),
    inference(clausify,[status(thm)],[not_subclass_members1]) ).

fof(subclass_members,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( member(VAR_2,VAR_1)
      | ~ member(VAR_2,VAR_0)
      | ~ subclass(VAR_0,VAR_1) ),
    file('theBenchmark.p',subclass_members) ).

cnf(c_126,plain,
    ( member(C,B)
    | ~ member(C,A)
    | ~ subclass(A,B) ),
    inference(clausify,[status(thm)],[subclass_members]) ).

cnf(c_282,plain,
    ~ member(not_subclass_element(x,z),z),
    inference(resolve,[status(thm)],[c_124,c_33]) ).

cnf(c_303,plain,
    member(not_subclass_element(x,z),x),
    inference(resolve,[status(thm)],[c_125,c_33]) ).

cnf(c_313,plain,
    ( member(A,y)
    | ~ member(A,x) ),
    inference(resolve,[status(thm)],[c_126,c_35]) ).

cnf(c_314,plain,
    ( member(A,z)
    | ~ member(A,y) ),
    inference(resolve,[status(thm)],[c_126,c_34]) ).

cnf(c_562,plain,
    ~ member(not_subclass_element(x,z),y),
    inference(resolve,[status(thm)],[c_314,c_282]) ).

cnf(c_585,plain,
    member(not_subclass_element(x,z),y),
    inference(resolve,[status(thm)],[c_303,c_313]) ).

cnf(c_584,plain,
    $false,
    inference(resolve,[status(thm)],[c_562,c_585]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET027-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n019.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep 26 06:54:48 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.38  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.38  % Process 654331 was started by sandbox on n019,
% 0.10/0.38  % Sat Sep 26 06:54:48 2026
% 0.10/0.38  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.38  
% 0.10/0.38  % From the command line: assign(max_seconds, 300).
% 0.10/0.45  
% 0.10/0.45  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.45  
% 0.10/0.45  % Proof 1 at 0.04 (+ 0.02) seconds.
% 0.10/0.45  % Length of proof is 12.
% 0.10/0.45  % Level of proof is 3.
% 0.10/0.45  % Maximum clause weight is 18.000.
% 0.10/0.45  % Given clauses 139.
% 0.10/0.45  
% 0.10/0.45  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------