↑ Up

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

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

% Result   : Unsatisfiable 1.12s 0.66s
% Output   : CNFRefutation 1.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   36 (  27 unt;   0 def)
%            Number of atoms       :   47 (   9 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   34 (  23   ~;  11   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :   11 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   5 con; 0-2 aty)
%            Number of variables   :   38 (   6 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_member_of_triple_kludge2_4,axiom,
    ~ member(u,set_builder(u,set_builder(v,set_builder(w,null_class)))),
    file('theBenchmark.p',prove_member_of_triple_kludge2_4) ).

cnf(c_34,plain,
    ~ member(u,set_builder(u,set_builder(v,set_builder(w,null_class)))),
    inference(clausify,[status(thm)],[prove_member_of_triple_kludge2_4]) ).

fof(prove_member_of_triple_kludge2_1,axiom,
    member(u,universal_class),
    file('theBenchmark.p',prove_member_of_triple_kludge2_1) ).

cnf(c_37,plain,
    member(u,universal_class),
    inference(clausify,[status(thm)],[prove_member_of_triple_kludge2_1]) ).

fof(definition_of_set_builder,axiom,
    ! [VAR_0,VAR_1] : union(singleton(VAR_0),VAR_1) = set_builder(VAR_0,VAR_1),
    file('theBenchmark.p',definition_of_set_builder) ).

cnf(c_38,plain,
    union(singleton(A),B) = set_builder(A,B),
    inference(clausify,[status(thm)],[definition_of_set_builder]) ).

cnf(c_39,plain,
    set_builder(A,B) = union(singleton(A),B),
    inference(copy,[status(thm)],[c_38]) ).

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_98,plain,
    complement(intersection(complement(A),complement(B))) = union(A,B),
    inference(clausify,[status(thm)],[union]) ).

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

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_100,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_101,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_104,plain,
    ( member(A,B)
    | ~ member(A,intersection(B,C)) ),
    inference(clausify,[status(thm)],[intersection1]) ).

fof(singleton_set,axiom,
    ! [VAR_0] : unordered_pair(VAR_0,VAR_0) = singleton(VAR_0),
    file('theBenchmark.p',singleton_set) ).

cnf(c_114,plain,
    unordered_pair(A,A) = singleton(A),
    inference(clausify,[status(thm)],[singleton_set]) ).

cnf(c_115,plain,
    singleton(A) = unordered_pair(A,A),
    inference(copy,[status(thm)],[c_114]) ).

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

cnf(c_117,plain,
    ( member(A,unordered_pair(B,A))
    | ~ member(A,universal_class) ),
    inference(clausify,[status(thm)],[unordered_pair3]) ).

cnf(c_848,plain,
    ~ member(u,set_builder(u,set_builder(v,union(singleton(w),null_class)))),
    inference(paramod,[status(thm)],[c_39,c_34]) ).

cnf(c_849,plain,
    ~ member(u,set_builder(u,set_builder(v,union(unordered_pair(w,w),null_class)))),
    inference(paramod,[status(thm)],[c_115,c_848]) ).

cnf(c_850,plain,
    ~ member(u,set_builder(u,set_builder(v,complement(intersection(complement(unordered_pair(w,w)),complement(null_class)))))),
    inference(paramod,[status(thm)],[c_99,c_849]) ).

cnf(c_851,plain,
    ~ member(u,set_builder(u,union(singleton(v),complement(intersection(complement(unordered_pair(w,w)),complement(null_class)))))),
    inference(paramod,[status(thm)],[c_39,c_850]) ).

cnf(c_852,plain,
    ~ member(u,set_builder(u,union(unordered_pair(v,v),complement(intersection(complement(unordered_pair(w,w)),complement(null_class)))))),
    inference(paramod,[status(thm)],[c_115,c_851]) ).

cnf(c_853,plain,
    ~ member(u,set_builder(u,complement(intersection(complement(unordered_pair(v,v)),complement(complement(intersection(complement(unordered_pair(w,w)),complement(null_class)))))))),
    inference(paramod,[status(thm)],[c_99,c_852]) ).

cnf(c_854,plain,
    ~ member(u,union(singleton(u),complement(intersection(complement(unordered_pair(v,v)),complement(complement(intersection(complement(unordered_pair(w,w)),complement(null_class)))))))),
    inference(paramod,[status(thm)],[c_39,c_853]) ).

cnf(c_855,plain,
    ~ member(u,union(unordered_pair(u,u),complement(intersection(complement(unordered_pair(v,v)),complement(complement(intersection(complement(unordered_pair(w,w)),complement(null_class)))))))),
    inference(paramod,[status(thm)],[c_115,c_854]) ).

cnf(c_160,plain,
    ~ member(u,complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(v,v)),complement(complement(intersection(complement(unordered_pair(w,w)),complement(null_class)))))))))),
    inference(paramod,[status(thm)],[c_99,c_855]) ).

cnf(c_211,plain,
    ( member(u,A)
    | member(u,complement(A)) ),
    inference(resolve,[status(thm)],[c_100,c_37]) ).

cnf(c_243,plain,
    member(u,unordered_pair(A,u)),
    inference(resolve,[status(thm)],[c_117,c_37]) ).

cnf(c_430,plain,
    ~ member(u,complement(unordered_pair(A,u))),
    inference(resolve,[status(thm)],[c_101,c_243]) ).

cnf(c_807,plain,
    ~ member(u,intersection(complement(unordered_pair(A,u)),B)),
    inference(resolve,[status(thm)],[c_104,c_430]) ).

cnf(c_856,plain,
    member(u,intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(v,v)),complement(complement(intersection(complement(unordered_pair(w,w)),complement(null_class))))))))),
    inference(resolve,[status(thm)],[c_211,c_160]) ).

cnf(c_847,plain,
    $false,
    inference(resolve,[status(thm)],[c_807,c_856]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SET138-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.16/0.42  % Computer : n016.cluster.edu
% 0.16/0.42  % Model    : x86_64 x86_64
% 0.16/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42  % Memory   : 8046.5625MB
% 0.16/0.42  % OS       : Linux 6.8.0-71-generic
% 0.16/0.42  % CPULimit : 300
% 0.16/0.42  % WCLimit  : 300
% 0.16/0.42  % DateTime : Sat Sep 26 07:17:15 UTC 2026
% 0.16/0.42  % CPUTime  : 
% 0.16/0.42  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/0.42  % Process 270013 was started by sandbox on n016,
% 0.16/0.42  % Sat Sep 26 07:17:15 2026
% 0.16/0.42  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.16/0.43  
% 0.16/0.43  % From the command line: assign(max_seconds, 300).
% 1.12/0.66  
% 1.12/0.66  % SZS status Unsatisfiable for theBenchmark
% 1.12/0.66  
% 1.12/0.66  % Proof 1 at 0.17 (+ 0.04) seconds.
% 1.12/0.66  % Length of proof is 18.
% 1.12/0.66  % Level of proof is 4.
% 1.12/0.66  % Maximum clause weight is 24.000.
% 1.12/0.66  % Given clauses 163.
% 1.12/0.66  
% 1.12/0.66  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------