↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SET940+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n014.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 : Thu Sep 24 02:11:01 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f8,conjecture,
    ! [A,B] : union(unordered_pair(A,B)) = set_union2(A,B),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f9,negated_conjecture,
    ~ ! [A,B] : union(unordered_pair(A,B)) = set_union2(A,B),
    inference(negated_conjecture,[status(cth)],[f8]) ).

fof(f10,axiom,
    ! [A,B] : union(unordered_pair(A,B)) = set_union2(A,B),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f25,plain,
    ? [A,B] : union(unordered_pair(A,B)) != set_union2(A,B),
    inference(pre_NNF_transformation,[status(thm)],[f9]) ).

fof(f26,plain,
    union(unordered_pair(sK2_skl,sK3_skl)) != set_union2(sK2_skl,sK3_skl),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl,sK3_skl]),skolemize(A,sK2_skl),skolemize(B,sK3_skl)],[f25]) ).

fof(f27,plain,
    union(unordered_pair(sK2_skl,sK3_skl)) != set_union2(sK2_skl,sK3_skl),
    inference(cnf_transformation,[status(thm)],[f26]) ).

fof(f28,plain,
    ! [X0,X1] : union(unordered_pair(X0,X1)) = set_union2(X0,X1),
    inference(cnf_transformation,[status(thm)],[f10]) ).

fof(f29,plain,
    set_union2(sK2_skl,sK3_skl) != set_union2(sK2_skl,sK3_skl),
    inference(backward_demodulation,[status(thm)],[f28,f27]) ).

fof(f30,plain,
    $false,
    inference(trivial_equality_resolution,[status(thm)],[f29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET940+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n014.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 05:44:34 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.37  % Drodi V4.1.1
% 0.14/0.38  % Refutation found
% 0.14/0.38  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.41  % Elapsed time: 0.038166 seconds
% 0.14/0.41  % CPU time: 0.122463 seconds
% 0.14/0.41  % Total memory used: 57.995 MB
% 0.14/0.41  % Net memory used: 57.546 MB
%------------------------------------------------------------------------------