TSTP Solution File: SET849-2 by Leo-III---1.7.7

View Problem - Process Solution

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

% Computer : n010.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:37 EDT 2023

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

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

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

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

thf(c_Zorn_OTFin_type,type,
    c_Zorn_OTFin: $i > $i > $i ).

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

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

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

thf(c_in_type,type,
    c_in: $i > $i > $i > $o ).

thf(1,negated_conjecture,
    ( ( c_Zorn_Osucc @ v_S @ ( c_Union @ ( c_Zorn_OTFin @ v_S @ t_a ) @ ( tc_set @ t_a ) ) @ t_a )
   != ( c_Union @ ( c_Zorn_OTFin @ v_S @ t_a ) @ ( tc_set @ t_a ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

thf(5,plain,
    ( ( c_Zorn_Osucc @ v_S @ ( c_Union @ ( c_Zorn_OTFin @ v_S @ t_a ) @ ( tc_set @ t_a ) ) @ t_a )
   != ( c_Union @ ( c_Zorn_OTFin @ v_S @ t_a ) @ ( tc_set @ t_a ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(2,axiom,
    ! [B: $i,A: $i] : ( c_lessequals @ A @ A @ ( tc_set @ B ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__refl_0) ).

thf(8,plain,
    ! [B: $i,A: $i] : ( c_lessequals @ A @ A @ ( tc_set @ B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(3,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( c_lessequals @ A @ ( c_Zorn_OTFin @ B @ C ) @ ( tc_set @ ( tc_set @ ( tc_set @ C ) ) ) )
      | ( c_in @ ( c_Union @ A @ ( tc_set @ C ) ) @ ( c_Zorn_OTFin @ B @ C ) @ ( tc_set @ ( tc_set @ C ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__UnionI_0) ).

thf(9,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( c_lessequals @ A @ ( c_Zorn_OTFin @ B @ C ) @ ( tc_set @ ( tc_set @ ( tc_set @ C ) ) ) )
      | ( c_in @ ( c_Union @ A @ ( tc_set @ C ) ) @ ( c_Zorn_OTFin @ B @ C ) @ ( tc_set @ ( tc_set @ C ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(4,axiom,
    ! [B: $i,A: $i] :
      ( ~ ( c_in @ ( c_Union @ ( c_Zorn_OTFin @ A @ B ) @ ( tc_set @ B ) ) @ ( c_Zorn_OTFin @ A @ B ) @ ( tc_set @ ( tc_set @ B ) ) )
      | ( ( c_Union @ ( c_Zorn_OTFin @ A @ B ) @ ( tc_set @ B ) )
        = ( c_Zorn_Osucc @ A @ ( c_Union @ ( c_Zorn_OTFin @ A @ B ) @ ( tc_set @ B ) ) @ B ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Oequal__succ__Union_1) ).

thf(11,plain,
    ! [B: $i,A: $i] :
      ( ~ ( c_in @ ( c_Union @ ( c_Zorn_OTFin @ A @ B ) @ ( tc_set @ B ) ) @ ( c_Zorn_OTFin @ A @ B ) @ ( tc_set @ ( tc_set @ B ) ) )
      | ( ( c_Union @ ( c_Zorn_OTFin @ A @ B ) @ ( tc_set @ B ) )
        = ( c_Zorn_Osucc @ A @ ( c_Union @ ( c_Zorn_OTFin @ A @ B ) @ ( tc_set @ B ) ) @ B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(14,plain,
    $false,
    inference(cvc4,[status(thm)],[5,8,9,11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem  : SET849-2 : TPTP v8.1.2. Released v3.2.0.
% 0.05/0.12  % Command  : run_Leo-III %s %d
% 0.12/0.32  % Computer : n010.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Thu May 18 18:56:59 EDT 2023
% 0.12/0.32  % CPUTime  : 
% 0.83/0.81  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.19/0.96  % [INFO] 	 Parsing done (151ms). 
% 1.19/0.97  % [INFO] 	 Running in sequential loop mode. 
% 1.55/1.19  % [INFO] 	 eprover registered as external prover. 
% 1.55/1.19  % [INFO] 	 cvc4 registered as external prover. 
% 1.55/1.20  % [INFO] 	 Scanning for conjecture ... 
% 1.67/1.25  % [INFO] 	 Found a conjecture and 3 axioms. Running axiom selection ... 
% 1.72/1.27  % [INFO] 	 Axiom selection finished. Selected 3 axioms (removed 0 axioms). 
% 1.72/1.28  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 1.72/1.28  % [INFO] 	 Type checking passed. 
% 1.72/1.29  % [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.44/1.60  % External prover 'cvc4' found a proof!
% 2.44/1.60  % [INFO] 	 Killing All external provers ... 
% 2.44/1.60  % Time passed: 1133ms (effective reasoning time: 623ms)
% 2.44/1.60  % 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.44/1.60  % Axioms used in derivation (3): cls_Set_Osubset__refl_0, cls_Zorn_OTFin__UnionI_0, cls_Zorn_Oequal__succ__Union_1
% 2.44/1.60  % No. of inferences in proof: 9
% 2.44/1.60  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1133 ms resp. 623 ms w/o parsing
% 2.66/1.63  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.66/1.63  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------