%------------------------------------------------------------------------------
% File     : Leo-III---1.7.15
% Problem  : SEV225^5 : TPTP v8.2.0. Bugfixed v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d THM

% Computer : n032.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 : Mon Jun 24 15:58:33 EDT 2024

% Result   : Theorem 1.72s 1.24s
% Output   : Refutation 1.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    5 (   2 unt;   0 typ;   1 def)
%            Number of atoms       :   13 (   4 equ;   0 cnn)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   23 (   7   ~;   0   |;   3   &;  10   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   3 usr;   3 con; 0-2 aty)
%            Number of variables   :    5 (   0   ^   5   !;   0   ?;   5   :)

% Comments : 
%------------------------------------------------------------------------------
thf(r_type,type,
    r: $tType ).

thf(c0_type,type,
    c0: r ).

thf(less_type,type,
    less: r > r > $o ).

thf(cIRREFLEXIVE_LAW_type,type,
    cIRREFLEXIVE_LAW: $o ).

thf(cIRREFLEXIVE_LAW_def,definition,
    ( cIRREFLEXIVE_LAW
    = ( ! [A: r] :
          ~ ( less @ A @ A ) ) ) ).

thf(1,conjecture,
    ( cIRREFLEXIVE_LAW
   => ! [A: r] :
        ~ ( ( less @ A @ c0 )
          & ( A = c0 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cPARNAS_FIG3_A) ).

thf(2,negated_conjecture,
    ~ ( cIRREFLEXIVE_LAW
     => ! [A: r] :
          ~ ( ( less @ A @ c0 )
            & ( A = c0 ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ! [A: r] :
          ~ ( less @ A @ A )
     => ! [A: r] :
          ~ ( ( less @ A @ c0 )
            & ( A = c0 ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(10,plain,
    $false,
    inference(e,[status(thm)],[3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.08  % Problem  : SEV225^5 : TPTP v8.2.0. Bugfixed v5.3.0.
% 0.07/0.08  % Command  : run_Leo-III %s %d THM
% 0.07/0.26  % Computer : n032.cluster.edu
% 0.07/0.26  % Model    : x86_64 x86_64
% 0.07/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26  % Memory   : 8042.1875MB
% 0.07/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26  % CPULimit : 300
% 0.07/0.26  % WCLimit  : 300
% 0.07/0.26  % DateTime : Fri Jun 21 18:56:40 EDT 2024
% 0.07/0.26  % CPUTime  : 
% 0.62/0.65  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 0.84/0.74  % [INFO] 	 Parsing done (94ms). 
% 0.84/0.75  % [INFO] 	 Running in sequential loop mode. 
% 1.13/0.95  % [INFO] 	 eprover registered as external prover. 
% 1.13/0.96  % [INFO] 	 Scanning for conjecture ... 
% 1.23/1.01  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.23/1.03  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.23/1.03  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.23/1.03  % [INFO] 	 Type checking passed. 
% 1.23/1.03  % [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 ... 
% 1.72/1.24  % External prover 'e' found a proof!
% 1.72/1.24  % [INFO] 	 Killing All external provers ... 
% 1.72/1.24  % Time passed: 862ms (effective reasoning time: 483ms)
% 1.72/1.24  % 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)>
% 1.72/1.24  % Axioms used in derivation (0): 
% 1.72/1.24  % No. of inferences in proof: 4
% 1.72/1.24  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 862 ms resp. 483 ms w/o parsing
% 1.77/1.26  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 1.77/1.26  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------