%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.12
% Problem  : SWC262+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n003.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 May 21 04:34:41 EDT 2024

% Result   : Theorem 6.07s 2.54s
% Output   : Refutation 6.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   15 (   8 unt;   4 typ;   0 def)
%            Number of atoms       :   34 (  11 equ;   0 cnn)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   58 (  15   ~;   9   |;   0   &;  22   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   12 (   0   ^  12   !;   0   ?;  12   :)

% Comments : 
%------------------------------------------------------------------------------
thf(ssList_type,type,
    ssList: $i > $o ).

thf(totalorderedP_type,type,
    totalorderedP: $i > $o ).

thf(sk1_type,type,
    sk1: $i ).

thf(sk3_type,type,
    sk3: $i ).

thf(1,conjecture,
    ! [A: $i] :
      ( ( ssList @ A )
     => ! [B: $i] :
          ( ( ssList @ B )
         => ! [C: $i] :
              ( ( ssList @ C )
             => ! [D: $i] :
                  ( ( ssList @ D )
                 => ( ( B != D )
                    | ( A != C )
                    | ~ ( totalorderedP @ C )
                    | ( totalorderedP @ A ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

thf(2,negated_conjecture,
    ~ ! [A: $i] :
        ( ( ssList @ A )
       => ! [B: $i] :
            ( ( ssList @ B )
           => ! [C: $i] :
                ( ( ssList @ C )
               => ! [D: $i] :
                    ( ( ssList @ D )
                   => ( ( B != D )
                      | ( A != C )
                      | ~ ( totalorderedP @ C )
                      | ( totalorderedP @ A ) ) ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(98,plain,
    ~ ! [A: $i] :
        ( ( ssList @ A )
       => ! [B: $i] :
            ( ( ssList @ B )
           => ! [C: $i] :
                ( ( ssList @ C )
               => ! [D: $i] :
                    ( ( ssList @ D )
                   => ( ( B != D )
                      | ( A != C )
                      | ~ ( totalorderedP @ C )
                      | ( totalorderedP @ A ) ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(101,plain,
    totalorderedP @ sk3,
    inference(cnf,[status(esa)],[98]) ).

thf(106,plain,
    ~ ( totalorderedP @ sk1 ),
    inference(cnf,[status(esa)],[98]) ).

thf(499,plain,
    ( ( totalorderedP @ sk3 )
   != ( totalorderedP @ sk1 ) ),
    inference(paramod_ordered,[status(thm)],[101,106]) ).

thf(500,plain,
    sk3 != sk1,
    inference(simp,[status(thm)],[499]) ).

thf(104,plain,
    sk1 = sk3,
    inference(cnf,[status(esa)],[98]) ).

thf(108,plain,
    sk3 = sk1,
    inference(lifteq,[status(thm)],[104]) ).

thf(504,plain,
    sk1 != sk1,
    inference(rewrite,[status(thm)],[500,108]) ).

thf(505,plain,
    $false,
    inference(simp,[status(thm)],[504]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWC262+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.16  % Command  : run_Leo-III %s %d
% 0.17/0.37  % Computer : n003.cluster.edu
% 0.17/0.37  % Model    : x86_64 x86_64
% 0.17/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37  % Memory   : 8042.1875MB
% 0.17/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37  % CPULimit : 300
% 0.17/0.37  % WCLimit  : 300
% 0.17/0.37  % DateTime : Sun May 19 02:40:24 EDT 2024
% 0.17/0.38  % CPUTime  : 
% 0.97/0.88  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.37/1.06  % [INFO] 	 Parsing done (172ms). 
% 1.37/1.07  % [INFO] 	 Running in sequential loop mode. 
% 1.95/1.29  % [INFO] 	 nitpick registered as external prover. 
% 1.95/1.30  % [INFO] 	 Scanning for conjecture ... 
% 2.21/1.38  % [INFO] 	 Found a conjecture (or negated_conjecture) and 95 axioms. Running axiom selection ... 
% 2.36/1.44  % [INFO] 	 Axiom selection finished. Selected 95 axioms (removed 0 axioms). 
% 2.90/1.55  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.90/1.56  % [INFO] 	 Type checking passed. 
% 2.90/1.56  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 6.07/2.54  % [INFO] 	 Killing All external provers ... 
% 6.07/2.54  % Time passed: 1992ms (effective reasoning time: 1467ms)
% 6.07/2.54  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 6.07/2.54  % Axioms used in derivation (0): 
% 6.07/2.54  % No. of inferences in proof: 11
% 6.07/2.54  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1992 ms resp. 1467 ms w/o parsing
% 6.07/2.56  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.07/2.56  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------