↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SET152-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 : 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:35:55 AM UTC 2026

% Result   : Unsatisfiable 0.18s 0.54s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   17 (   9 unt;   0 def)
%            Number of atoms       :   27 (   6 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   23 (  13   ~;  10   |;   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    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   17 (   2 sgn   7   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_complement_of_universal_class_1,axiom,
    complement(universal_class) != null_class,
    file('theBenchmark.p',prove_complement_of_universal_class_1) ).

cnf(c_36,plain,
    complement(universal_class) != null_class,
    inference(clausify,[status(thm)],[prove_complement_of_universal_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(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_492,plain,
    null_class != complement(universal_class),
    inference(copy,[status(thm)],[c_36]) ).

cnf(c_183,plain,
    member(regular(complement(universal_class)),complement(universal_class)),
    inference(resolve,[status(thm)],[c_76,c_492]) ).

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

cnf(c_484,plain,
    member(regular(complement(universal_class)),universal_class),
    inference(resolve,[status(thm)],[c_183,c_355]) ).

cnf(c_493,plain,
    ~ member(regular(complement(universal_class)),universal_class),
    inference(resolve,[status(thm)],[c_183,c_119]) ).

cnf(c_491,plain,
    $false,
    inference(resolve,[status(thm)],[c_484,c_493]) ).

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