↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SET025+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox2/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:23 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(unordered_pair,axiom,
    ! [X,Y] : member(unordered_pair(X,Y),universal_class),
    file('theBenchmark.p',unordered_pair) ).

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

fof(ordered_pair_defn,axiom,
    ! [X,Y] : ordered_pair(X,Y) = unordered_pair(singleton(X),unordered_pair(X,singleton(Y))),
    file('theBenchmark.p',ordered_pair_defn) ).

fof(ordered_pair_is_set,conjecture,
    ! [X,Y] : member(ordered_pair(X,Y),universal_class),
    file('theBenchmark.p',ordered_pair_is_set) ).

fof(ordered_pair_is_set_neg,negated_conjecture,
    ~ ! [X,Y] : member(ordered_pair(X,Y),universal_class),
    inference(assume_negation,[status(cth)],[ordered_pair_is_set]) ).

fof(nnf_42,plain,
    ? [X,Y] : ~ member(ordered_pair(X,Y),universal_class),
    inference(fof_nnf,[status(thm)],[ordered_pair_is_set_neg]) ).

fof(sk_ordered_pair_is_set_neg,plain,
    ~ member(ordered_pair(sK0,sK1),universal_class),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X,sK0),skolemize(Y,sK1)],[nnf_42]) ).

cnf(c_64,negated_conjecture,
    ~ member(ordered_pair(sK0,sK1),universal_class),
    inference(split_conjunct,[status(thm)],[sk_ordered_pair_is_set_neg]) ).

cnf(c_126,plain,
    ordered_pair(A,B) = unordered_pair(singleton(A),unordered_pair(A,singleton(B))),
    inference(clausify,[status(thm)],[ordered_pair_defn]) ).

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

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

cnf(c_191,negated_conjecture,
    ~ member(unordered_pair(singleton(sK0),unordered_pair(sK0,singleton(sK1))),universal_class),
    inference(paramod,[status(thm)],[c_126,c_64]) ).

cnf(c_192,negated_conjecture,
    ~ member(unordered_pair(unordered_pair(sK0,sK0),unordered_pair(sK0,singleton(sK1))),universal_class),
    inference(paramod,[status(thm)],[c_127,c_191]) ).

cnf(c_193,negated_conjecture,
    ~ member(unordered_pair(unordered_pair(sK0,sK0),unordered_pair(sK0,unordered_pair(sK1,sK1))),universal_class),
    inference(paramod,[status(thm)],[c_127,c_192]) ).

cnf(c_190,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_128,c_193]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SET025+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45  % Computer : n016.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 06:59:01 UTC 2026
% 0.19/0.45  % CPUTime  : 
% 0.19/0.45  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.19/0.45  % Process 231443 was started by sandbox2 on n016,
% 0.19/0.45  % Sat Sep 26 06:59:01 2026
% 0.19/0.45  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.19/0.47  
% 0.19/0.47  % From the command line: assign(max_seconds, 300).
% 0.19/0.51  
% 0.19/0.51  % SZS status Theorem for theBenchmark
% 0.19/0.51  
% 0.19/0.51  % Proof 1 at 0.02 (+ 0.01) seconds.
% 0.19/0.51  % Length of proof is 9.
% 0.19/0.51  % Level of proof is 2.
% 0.19/0.51  % Maximum clause weight is 11.000.
% 0.19/0.51  % Given clauses 0.
% 0.19/0.51  
% 0.19/0.51  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------