↑ Up

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

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

% Result   : Unsatisfiable 66.37s 9.89s
% Output   : CNFRefutation 66.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   29 (  18 unt;   0 def)
%            Number of atoms       :   46 (   3 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   38 (  21   ~;  17   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   32 (   2 sgn  13   !;   0   ?)

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

cnf(c_36,plain,
    ~ member(x,z),
    inference(clausify,[status(thm)],[prove_members_of_union1_3]) ).

fof(prove_members_of_union1_2,axiom,
    ~ member(x,y),
    file('theBenchmark.p',prove_members_of_union1_2) ).

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

fof(prove_members_of_union1_1,axiom,
    member(x,union(y,z)),
    file('theBenchmark.p',prove_members_of_union1_1) ).

cnf(c_38,plain,
    member(x,union(y,z)),
    inference(clausify,[status(thm)],[prove_members_of_union1_1]) ).

fof(union,axiom,
    ! [VAR_0,VAR_1] : complement(intersection(complement(VAR_0),complement(VAR_1))) = union(VAR_0,VAR_1),
    file('theBenchmark.p',union) ).

cnf(c_118,plain,
    complement(intersection(complement(A),complement(B))) = union(A,B),
    inference(clausify,[status(thm)],[union]) ).

cnf(c_119,plain,
    union(A,B) = complement(intersection(complement(A),complement(B))),
    inference(copy,[status(thm)],[c_118]) ).

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

cnf(c_120,plain,
    ( member(A,B)
    | member(A,complement(B))
    | ~ member(A,universal_class) ),
    inference(clausify,[status(thm)],[complement2]) ).

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

cnf(c_121,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_122,plain,
    ( member(A,intersection(B,C))
    | ~ member(A,C)
    | ~ member(A,B) ),
    inference(clausify,[status(thm)],[intersection3]) ).

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

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

cnf(c_233,plain,
    member(x,complement(intersection(complement(y),complement(z)))),
    inference(paramod,[status(thm)],[c_119,c_38]) ).

cnf(c_1101,plain,
    ~ member(x,intersection(complement(y),complement(z))),
    inference(resolve,[status(thm)],[c_233,c_121]) ).

cnf(c_6338,plain,
    ( member(A,universal_class)
    | ~ member(A,B) ),
    inference(resolve,[status(thm)],[c_146,c_143]) ).

cnf(c_1103,plain,
    member(x,universal_class),
    inference(resolve,[status(thm)],[c_6338,c_233]) ).

cnf(c_1404,plain,
    ( member(x,A)
    | member(x,complement(A)) ),
    inference(resolve,[status(thm)],[c_1103,c_120]) ).

cnf(c_5662,plain,
    member(x,complement(y)),
    inference(resolve,[status(thm)],[c_1404,c_37]) ).

cnf(c_5663,plain,
    member(x,complement(z)),
    inference(resolve,[status(thm)],[c_1404,c_36]) ).

cnf(c_6339,plain,
    ( member(x,intersection(complement(y),A))
    | ~ member(x,A) ),
    inference(resolve,[status(thm)],[c_122,c_5662]) ).

cnf(c_6340,plain,
    member(x,intersection(complement(y),complement(z))),
    inference(resolve,[status(thm)],[c_6339,c_5663]) ).

cnf(c_6337,plain,
    $false,
    inference(resolve,[status(thm)],[c_1101,c_6340]) ).

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