%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : SET856-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n011.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 : Fri May 19 11:54:40 EDT 2023

% Result   : Unsatisfiable 2.34s 1.49s
% Output   : Refutation 2.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   15 (   7 unt;   8 typ;   0 def)
%            Number of atoms       :    7 (   0 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   59 (   4   ~;   0   |;   0   &;  55   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    9 (   9   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   8 usr;   6 con; 0-3 aty)
%            Number of variables   :    0 (   0   ^;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
thf(c_lessequals_type,type,
    c_lessequals: $i > $i > $i > $o ).

thf(c_Zorn_Osucc_type,type,
    c_Zorn_Osucc: $i > $i > $i > $i ).

thf(v_S_type,type,
    v_S: $i ).

thf(v_n_type,type,
    v_n: $i ).

thf(t_a_type,type,
    t_a: $i ).

thf(c_Union_type,type,
    c_Union: $i > $i > $i ).

thf(v_Y_type,type,
    v_Y: $i ).

thf(tc_set_type,type,
    tc_set: $i > $i ).

thf(2,negated_conjecture,
    ~ ( c_lessequals @ ( c_Zorn_Osucc @ v_S @ v_n @ t_a ) @ ( c_Union @ v_Y @ ( tc_set @ t_a ) ) @ ( tc_set @ ( tc_set @ t_a ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).

thf(4,plain,
    ~ ( c_lessequals @ ( c_Zorn_Osucc @ v_S @ v_n @ t_a ) @ ( c_Union @ v_Y @ ( tc_set @ t_a ) ) @ ( tc_set @ ( tc_set @ t_a ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(5,plain,
    ~ ( c_lessequals @ ( c_Zorn_Osucc @ v_S @ v_n @ t_a ) @ ( c_Union @ v_Y @ ( tc_set @ t_a ) ) @ ( tc_set @ ( tc_set @ t_a ) ) ),
    inference(polarity_switch,[status(thm)],[4]) ).

thf(1,negated_conjecture,
    c_lessequals @ ( c_Zorn_Osucc @ v_S @ v_n @ t_a ) @ ( c_Union @ v_Y @ ( tc_set @ t_a ) ) @ ( tc_set @ ( tc_set @ t_a ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

thf(3,plain,
    c_lessequals @ ( c_Zorn_Osucc @ v_S @ v_n @ t_a ) @ ( c_Union @ v_Y @ ( tc_set @ t_a ) ) @ ( tc_set @ ( tc_set @ t_a ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(6,plain,
    ~ $true,
    inference(rewrite,[status(thm)],[5,3]) ).

thf(7,plain,
    $false,
    inference(simp,[status(thm)],[6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET856-2 : TPTP v8.1.2. Released v3.2.0.
% 0.13/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.36  % Computer : n011.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu May 18 19:18:48 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 0.99/0.88  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.13/1.00  % [INFO] 	 Parsing done (116ms). 
% 1.13/1.00  % [INFO] 	 Running in sequential loop mode. 
% 1.63/1.20  % [INFO] 	 eprover registered as external prover. 
% 1.63/1.21  % [INFO] 	 cvc4 registered as external prover. 
% 1.63/1.21  % [INFO] 	 Scanning for conjecture ... 
% 1.77/1.26  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.77/1.28  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.77/1.28  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 1.77/1.28  % [INFO] 	 Type checking passed. 
% 1.77/1.28  % [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 ... 
% 2.28/1.49  % [INFO] 	 Killing All external provers ... 
% 2.34/1.49  % Time passed: 976ms (effective reasoning time: 481ms)
% 2.34/1.49  % 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)>
% 2.34/1.49  % Axioms used in derivation (0): 
% 2.34/1.49  % No. of inferences in proof: 7
% 2.34/1.49  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 976 ms resp. 481 ms w/o parsing
% 2.34/1.51  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.34/1.51  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------