↑ Up

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

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_corollary_1_to_singletons_are_sets_1,axiom,
    ~ member(singleton(y),unordered_pair(x,singleton(y))),
    file('theBenchmark.p',prove_corollary_1_to_singletons_are_sets_1) ).

cnf(c_34,plain,
    ~ member(singleton(y),unordered_pair(x,singleton(y))),
    inference(clausify,[status(thm)],[prove_corollary_1_to_singletons_are_sets_1]) ).

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

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

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

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

cnf(c_110,plain,
    member(unordered_pair(A,B),universal_class),
    inference(clausify,[status(thm)],[unordered_pairs_in_universal]) ).

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_111,plain,
    ( member(A,unordered_pair(B,A))
    | ~ member(A,universal_class) ),
    inference(clausify,[status(thm)],[unordered_pair3]) ).

cnf(c_222,plain,
    ~ member(unordered_pair(y,y),unordered_pair(x,singleton(y))),
    inference(paramod,[status(thm)],[c_109,c_34]) ).

cnf(c_195,plain,
    ~ member(unordered_pair(y,y),unordered_pair(x,unordered_pair(y,y))),
    inference(paramod,[status(thm)],[c_109,c_222]) ).

cnf(c_220,plain,
    member(unordered_pair(A,B),unordered_pair(C,unordered_pair(A,B))),
    inference(resolve,[status(thm)],[c_111,c_110]) ).

cnf(c_221,plain,
    $false,
    inference(resolve,[status(thm)],[c_220,c_195]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET078-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.08/0.35  % Computer : n017.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep 26 06:58:33 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36  % Process 92040 was started by sandbox2 on n017,
% 0.08/0.36  % Sat Sep 26 06:58:33 2026
% 0.08/0.36  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.12/0.36  
% 0.12/0.36  % From the command line: assign(max_seconds, 300).
% 0.12/0.39  
% 0.12/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.12/0.39  
% 0.12/0.39  % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.12/0.39  % Length of proof is 8.
% 0.12/0.39  % Level of proof is 3.
% 0.12/0.39  % Maximum clause weight is 9.000.
% 0.12/0.39  % Given clauses 26.
% 0.12/0.39  
% 0.12/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------