↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SET058-6 : 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 : 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 : Sun Sep 27 08:35:31 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_equality3_3,axiom,
    ~ member(not_subclass_element(x,y),x),
    file('theBenchmark.p',prove_equality3_3) ).

cnf(c_34,plain,
    ~ member(not_subclass_element(x,y),x),
    inference(clausify,[status(thm)],[prove_equality3_3]) ).

fof(prove_equality3_2,axiom,
    x != y,
    file('theBenchmark.p',prove_equality3_2) ).

cnf(c_35,plain,
    x != y,
    inference(clausify,[status(thm)],[prove_equality3_2]) ).

cnf(c_36,plain,
    y != x,
    inference(copy,[status(thm)],[c_35]) ).

fof(prove_equality3_1,axiom,
    member(not_subclass_element(y,x),x),
    file('theBenchmark.p',prove_equality3_1) ).

cnf(c_37,plain,
    member(not_subclass_element(y,x),x),
    inference(clausify,[status(thm)],[prove_equality3_1]) ).

fof(subclass_implies_equal,axiom,
    ! [VAR_0,VAR_1] :
      ( VAR_0 = VAR_1
      | ~ subclass(VAR_1,VAR_0)
      | ~ subclass(VAR_0,VAR_1) ),
    file('theBenchmark.p',subclass_implies_equal) ).

cnf(c_117,plain,
    ( A = B
    | ~ subclass(B,A)
    | ~ subclass(A,B) ),
    inference(clausify,[status(thm)],[subclass_implies_equal]) ).

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_121,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_122,plain,
    ( subclass(A,B)
    | member(not_subclass_element(A,B),A) ),
    inference(clausify,[status(thm)],[not_subclass_members1]) ).

cnf(c_317,plain,
    subclass(y,x),
    inference(resolve,[status(thm)],[c_121,c_37]) ).

cnf(c_405,plain,
    ( x = y
    | ~ subclass(x,y) ),
    inference(resolve,[status(thm)],[c_317,c_117]) ).

cnf(c_406,plain,
    ( y = x
    | ~ subclass(x,y) ),
    inference(copy,[status(thm)],[c_405]) ).

cnf(c_400,plain,
    ~ subclass(x,y),
    inference(resolve,[status(thm)],[c_36,c_406]) ).

cnf(c_407,plain,
    member(not_subclass_element(x,y),x),
    inference(resolve,[status(thm)],[c_400,c_122]) ).

cnf(c_404,plain,
    $false,
    inference(resolve,[status(thm)],[c_34,c_407]) ).

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