%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : SET940+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n009.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Apr 30 20:40:45 EDT 2024

% Result   : Theorem 0.12s 0.35s
% Output   : CNFRefutation 0.12s
% 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(esa)],[f9]) ).

fof(f26,plain,
    union(unordered_pair(sk0_2,sk0_3)) != set_union2(sk0_2,sk0_3),
    inference(skolemization,[status(esa)],[f25]) ).

fof(f27,plain,
    union(unordered_pair(sk0_2,sk0_3)) != set_union2(sk0_2,sk0_3),
    inference(cnf_transformation,[status(esa)],[f26]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET940+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.12  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.33  % Computer : n009.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Mon Apr 29 21:34:26 EDT 2024
% 0.12/0.34  % CPUTime  : 
% 0.12/0.34  % Drodi V3.6.0
% 0.12/0.35  % Refutation found
% 0.12/0.35  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.35  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.36  % Elapsed time: 0.016581 seconds
% 0.12/0.36  % CPU time: 0.020860 seconds
% 0.12/0.36  % Total memory used: 5.810 MB
% 0.12/0.36  % Net memory used: 5.704 MB
%------------------------------------------------------------------------------