↑ Up

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

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

% Computer : n003.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:54 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_intersection_with_null_class_1,axiom,
    intersection(null_class,x) != null_class,
    file('theBenchmark.p',prove_intersection_with_null_class_1) ).

cnf(c_36,plain,
    intersection(null_class,x) != null_class,
    inference(clausify,[status(thm)],[prove_intersection_with_null_class_1]) ).

fof(regularity1,axiom,
    ! [VAR_0] :
      ( member(regular(VAR_0),VAR_0)
      | VAR_0 = null_class ),
    file('theBenchmark.p',regularity1) ).

cnf(c_75,plain,
    ( member(regular(A),A)
    | A = null_class ),
    inference(clausify,[status(thm)],[regularity1]) ).

cnf(c_76,plain,
    ( member(regular(A),A)
    | null_class = A ),
    inference(copy,[status(thm)],[c_75]) ).

fof(complement1,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ member(VAR_0,VAR_1)
      | ~ member(VAR_0,complement(VAR_1)) ),
    file('theBenchmark.p',complement1) ).

cnf(c_119,plain,
    ( ~ member(A,B)
    | ~ member(A,complement(B)) ),
    inference(clausify,[status(thm)],[complement1]) ).

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

cnf(c_122,plain,
    ( member(A,B)
    | ~ member(A,intersection(B,C)) ),
    inference(clausify,[status(thm)],[intersection1]) ).

fof(class_elements_are_sets,axiom,
    ! [VAR_0] : subclass(VAR_0,universal_class),
    file('theBenchmark.p',class_elements_are_sets) ).

cnf(c_141,plain,
    subclass(A,universal_class),
    inference(clausify,[status(thm)],[class_elements_are_sets]) ).

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_144,plain,
    ( member(C,B)
    | ~ member(C,A)
    | ~ subclass(A,B) ),
    inference(clausify,[status(thm)],[subclass_members]) ).

cnf(c_829,plain,
    ( null_class = complement(A)
    | ~ member(regular(complement(A)),A) ),
    inference(resolve,[status(thm)],[c_119,c_76]) ).

cnf(c_258,plain,
    ( complement(A) = null_class
    | ~ member(regular(complement(A)),A) ),
    inference(copy,[status(thm)],[c_829]) ).

cnf(c_830,plain,
    ( null_class = intersection(A,B)
    | member(regular(intersection(A,B)),A) ),
    inference(resolve,[status(thm)],[c_122,c_76]) ).

cnf(c_271,plain,
    ( intersection(A,B) = null_class
    | member(regular(intersection(A,B)),A) ),
    inference(copy,[status(thm)],[c_830]) ).

cnf(c_311,plain,
    ( member(A,universal_class)
    | ~ member(A,B) ),
    inference(resolve,[status(thm)],[c_144,c_141]) ).

cnf(c_479,plain,
    ( null_class = A
    | member(regular(A),universal_class) ),
    inference(resolve,[status(thm)],[c_311,c_76]) ).

cnf(c_831,plain,
    ( complement(universal_class) = null_class
    | null_class = complement(universal_class) ),
    inference(resolve,[status(thm)],[c_479,c_258]) ).

cnf(c_832,plain,
    ( complement(universal_class) = null_class
    | complement(universal_class) = null_class ),
    inference(copy,[status(thm)],[c_831]) ).

cnf(c_640,plain,
    complement(universal_class) = null_class,
    inference(copy,[status(thm)],[c_832]) ).

cnf(c_833,plain,
    ( ~ member(regular(A),complement(universal_class))
    | null_class = A ),
    inference(resolve,[status(thm)],[c_479,c_119]) ).

cnf(c_661,plain,
    ( ~ member(regular(A),null_class)
    | null_class = A ),
    inference(paramod,[status(thm)],[c_640,c_833]) ).

cnf(c_834,plain,
    ( intersection(null_class,A) = null_class
    | null_class = intersection(null_class,A) ),
    inference(resolve,[status(thm)],[c_661,c_271]) ).

cnf(c_835,plain,
    ( intersection(null_class,A) = null_class
    | intersection(null_class,A) = null_class ),
    inference(copy,[status(thm)],[c_834]) ).

cnf(c_827,plain,
    intersection(null_class,A) = null_class,
    inference(copy,[status(thm)],[c_835]) ).

cnf(c_828,plain,
    $false,
    inference(resolve,[status(thm)],[c_827,c_36]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET146-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n003.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep 26 07:14:53 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37  % Process 2296529 was started by sandbox2 on n003,
% 0.09/0.37  % Sat Sep 26 07:14:53 2026
% 0.09/0.37  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.37  
% 0.09/0.37  % From the command line: assign(max_seconds, 300).
% 1.12/0.57  
% 1.12/0.57  % SZS status Unsatisfiable for theBenchmark
% 1.12/0.57  
% 1.12/0.57  % Proof 1 at 0.15 (+ 0.03) seconds.
% 1.12/0.57  % Length of proof is 15.
% 1.12/0.57  % Level of proof is 6.
% 1.12/0.57  % Maximum clause weight is 26.000.
% 1.12/0.57  % Given clauses 193.
% 1.12/0.57  
% 1.12/0.57  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------