↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SET245-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 : n009.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:36:06 AM UTC 2026

% Result   : Unsatisfiable 0.24s 0.63s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   41 (  16 unt;   0 def)
%            Number of atoms       :   70 (  31 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   54 (  25   ~;  29   |;   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    :    9 (   9 usr;   4 con; 0-3 aty)
%            Number of variables   :   65 (   4 sgn  19   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_restriction_with_null_class1_1,axiom,
    restrict(null_class,x,y) != null_class,
    file('theBenchmark.p',prove_restriction_with_null_class1_1) ).

cnf(c_36,plain,
    restrict(null_class,x,y) != null_class,
    inference(clausify,[status(thm)],[prove_restriction_with_null_class1_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(restriction2,axiom,
    ! [VAR_0,VAR_1,VAR_2] : intersection(cross_product(VAR_0,VAR_1),VAR_2) = restrict(VAR_2,VAR_0,VAR_1),
    file('theBenchmark.p',restriction2) ).

cnf(c_110,plain,
    intersection(cross_product(A,B),C) = restrict(C,A,B),
    inference(clausify,[status(thm)],[restriction2]) ).

cnf(c_111,plain,
    restrict(A,B,C) = intersection(cross_product(B,C),A),
    inference(copy,[status(thm)],[c_110]) ).

fof(restriction1,axiom,
    ! [VAR_0,VAR_1,VAR_2] : intersection(VAR_0,cross_product(VAR_1,VAR_2)) = restrict(VAR_0,VAR_1,VAR_2),
    file('theBenchmark.p',restriction1) ).

cnf(c_112,plain,
    intersection(A,cross_product(B,C)) = restrict(A,B,C),
    inference(clausify,[status(thm)],[restriction1]) ).

cnf(c_1252,plain,
    intersection(A,cross_product(B,C)) = intersection(cross_product(B,C),A),
    inference(paramod,[status(thm)],[c_111,c_112]) ).

cnf(c_113,plain,
    intersection(cross_product(A,B),C) = intersection(C,cross_product(A,B)),
    inference(copy,[status(thm)],[c_1252]) ).

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(intersection3,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( member(VAR_0,intersection(VAR_1,VAR_2))
      | ~ member(VAR_0,VAR_2)
      | ~ member(VAR_0,VAR_1) ),
    file('theBenchmark.p',intersection3) ).

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

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_1253,plain,
    intersection(cross_product(x,y),null_class) != null_class,
    inference(paramod,[status(thm)],[c_111,c_36]) ).

cnf(c_230,plain,
    intersection(null_class,cross_product(x,y)) != null_class,
    inference(paramod,[status(thm)],[c_113,c_1253]) ).

cnf(c_232,plain,
    ( member(A,intersection(B,B))
    | ~ member(A,B) ),
    inference(factor,[status(thm)],[c_120]) ).

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

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

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

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

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

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

cnf(c_525,plain,
    ( member(regular(A),intersection(universal_class,universal_class))
    | null_class = A ),
    inference(resolve,[status(thm)],[c_449,c_232]) ).

cnf(c_1256,plain,
    ( complement(intersection(universal_class,universal_class)) = null_class
    | null_class = complement(intersection(universal_class,universal_class)) ),
    inference(resolve,[status(thm)],[c_525,c_259]) ).

cnf(c_1257,plain,
    ( complement(intersection(universal_class,universal_class)) = null_class
    | complement(intersection(universal_class,universal_class)) = null_class ),
    inference(copy,[status(thm)],[c_1256]) ).

cnf(c_1229,plain,
    complement(intersection(universal_class,universal_class)) = null_class,
    inference(copy,[status(thm)],[c_1257]) ).

cnf(c_1238,plain,
    ( ~ member(A,intersection(universal_class,universal_class))
    | ~ member(A,null_class) ),
    inference(paramod,[status(thm)],[c_1229,c_119]) ).

cnf(c_1243,plain,
    ( null_class = A
    | ~ member(regular(A),null_class) ),
    inference(resolve,[status(thm)],[c_1238,c_525]) ).

cnf(c_1258,plain,
    ( intersection(null_class,A) = null_class
    | null_class = intersection(null_class,A) ),
    inference(resolve,[status(thm)],[c_1243,c_269]) ).

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

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

cnf(c_1251,plain,
    $false,
    inference(resolve,[status(thm)],[c_1250,c_230]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SET245-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45  % Computer : n009.cluster.edu
% 0.19/0.45  % Model    : x86_64 x86_64
% 0.19/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45  % Memory   : 8046.5625MB
% 0.19/0.45  % OS       : Linux 6.8.0-71-generic
% 0.19/0.45  % CPULimit : 300
% 0.19/0.45  % WCLimit  : 300
% 0.19/0.45  % DateTime : Sat Sep 26 07:23:01 UTC 2026
% 0.19/0.45  % CPUTime  : 
% 0.19/0.46  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.19/0.46  % Process 3678720 was started by sandbox on n009,
% 0.19/0.46  % Sat Sep 26 07:23:01 2026
% 0.19/0.46  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.19/0.47  
% 0.19/0.47  % From the command line: assign(max_seconds, 300).
% 0.24/0.63  
% 0.24/0.63  % SZS status Unsatisfiable for theBenchmark
% 0.24/0.63  
% 0.24/0.63  % Proof 1 at 0.12 (+ 0.04) seconds.
% 0.24/0.63  % Length of proof is 24.
% 0.24/0.63  % Level of proof is 8.
% 0.24/0.63  % Maximum clause weight is 11.000.
% 0.24/0.63  % Given clauses 238.
% 0.24/0.63  
% 0.24/0.63  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------