TSTP Solution File: SEV434^1 by Leo-III---1.7.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.12
% Problem  : SEV434^1 : TPTP v8.2.0. Released v5.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 : Tue May 21 04:10:31 EDT 2024

% Result   : Theorem 6.06s 2.27s
% Output   : Refutation 6.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   47 (  24 unt;   5 typ;   0 def)
%            Number of atoms       :   96 (  47 equ;   0 cnn)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :  130 (  41   ~;  23   |;   0   &;  66   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   5 con; 0-2 aty)
%            Number of variables   :   25 (   0   ^  23   !;   2   ?;  25   :)

% Comments : 
%------------------------------------------------------------------------------
thf(f_type,type,
    f: $o > $i ).

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

thf(sk2_type,type,
    sk2: $i ).

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

thf(sk4_type,type,
    sk4: $i > $o ).

thf(3,axiom,
    ! [A: $i] :
    ? [B: $o] :
      ( ( f @ B )
      = A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fsurj) ).

thf(12,plain,
    ! [A: $i] :
    ? [B: $o] :
      ( ( f @ B )
      = A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(13,plain,
    ! [A: $i] :
      ( ( f @ ( sk4 @ A ) )
      = A ),
    inference(cnf,[status(esa)],[12]) ).

thf(18,plain,
    ! [A: $i] :
      ( ( f @ ( sk4 @ A ) )
      = A ),
    inference(lifteq,[status(thm)],[13]) ).

thf(1,conjecture,
    ! [A: $i,B: $i,C: $i] :
      ( ( A = B )
      | ( A = C )
      | ( B = C ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less3) ).

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

thf(4,plain,
    ~ ! [A: $i,B: $i,C: $i] :
        ( ( A = B )
        | ( A = C )
        | ( B = C ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(5,plain,
    ~ ! [A: $i,B: $i] :
        ( ( A = B )
        | ! [C: $i] :
            ( ( A = C )
            | ( B = C ) ) ),
    inference(miniscope,[status(thm)],[4]) ).

thf(7,plain,
    sk1 != sk3,
    inference(cnf,[status(esa)],[5]) ).

thf(16,plain,
    sk3 != sk1,
    inference(lifteq,[status(thm)],[7]) ).

thf(21,plain,
    ! [A: $i] :
      ( ( ( f @ ( sk4 @ A ) )
       != sk1 )
      | ( A != sk3 ) ),
    inference(paramod_ordered,[status(thm)],[18,16]) ).

thf(22,plain,
    ( ( f @ ( sk4 @ sk3 ) )
   != sk1 ),
    inference(pattern_uni,[status(thm)],[21:[bind(A,$thf( sk3 ))]]) ).

thf(51,plain,
    ! [A: $i] :
      ( ( ( f @ ( sk4 @ A ) )
       != ( f @ ( sk4 @ sk3 ) ) )
      | ( A != sk1 ) ),
    inference(paramod_ordered,[status(thm)],[18,22]) ).

thf(52,plain,
    ( ( f @ ( sk4 @ sk1 ) )
   != ( f @ ( sk4 @ sk3 ) ) ),
    inference(pattern_uni,[status(thm)],[51:[bind(A,$thf( sk1 ))]]) ).

thf(124,plain,
    ( ( sk4 @ sk1 )
   != ( sk4 @ sk3 ) ),
    inference(simp,[status(thm)],[52]) ).

thf(142,plain,
    ( ~ ( sk4 @ sk1 )
    | ~ ( sk4 @ sk3 ) ),
    inference(bool_ext,[status(thm)],[124]) ).

thf(6,plain,
    sk2 != sk3,
    inference(cnf,[status(esa)],[5]) ).

thf(15,plain,
    sk3 != sk2,
    inference(lifteq,[status(thm)],[6]) ).

thf(27,plain,
    ! [A: $i] :
      ( ( ( f @ ( sk4 @ A ) )
       != sk2 )
      | ( A != sk3 ) ),
    inference(paramod_ordered,[status(thm)],[18,15]) ).

thf(28,plain,
    ( ( f @ ( sk4 @ sk3 ) )
   != sk2 ),
    inference(pattern_uni,[status(thm)],[27:[bind(A,$thf( sk3 ))]]) ).

thf(73,plain,
    ! [A: $i] :
      ( ( ( f @ ( sk4 @ A ) )
       != ( f @ ( sk4 @ sk3 ) ) )
      | ( A != sk2 ) ),
    inference(paramod_ordered,[status(thm)],[18,28]) ).

thf(74,plain,
    ( ( f @ ( sk4 @ sk2 ) )
   != ( f @ ( sk4 @ sk3 ) ) ),
    inference(pattern_uni,[status(thm)],[73:[bind(A,$thf( sk2 ))]]) ).

thf(704,plain,
    ( ( sk4 @ sk2 )
   != ( sk4 @ sk3 ) ),
    inference(simp,[status(thm)],[74]) ).

thf(143,plain,
    ( ( sk4 @ sk1 )
    | ( sk4 @ sk3 ) ),
    inference(bool_ext,[status(thm)],[124]) ).

thf(203,plain,
    ! [A: $i] :
      ( ( sk4 @ sk3 )
      | ( ( f @ $true )
        = A )
      | ( ( sk4 @ sk1 )
       != ( sk4 @ A ) ) ),
    inference(paramod_ordered,[status(thm)],[143,18]) ).

thf(204,plain,
    ( ( sk4 @ sk3 )
    | ( ( f @ $true )
      = sk1 ) ),
    inference(pattern_uni,[status(thm)],[203:[bind(A,$thf( sk1 ))]]) ).

thf(8,plain,
    sk1 != sk2,
    inference(cnf,[status(esa)],[5]) ).

thf(17,plain,
    sk2 != sk1,
    inference(lifteq,[status(thm)],[8]) ).

thf(37,plain,
    ! [A: $i] :
      ( ( ( f @ ( sk4 @ A ) )
       != sk1 )
      | ( A != sk2 ) ),
    inference(paramod_ordered,[status(thm)],[18,17]) ).

thf(38,plain,
    ( ( f @ ( sk4 @ sk2 ) )
   != sk1 ),
    inference(pattern_uni,[status(thm)],[37:[bind(A,$thf( sk2 ))]]) ).

thf(416,plain,
    ( ( sk4 @ sk3 )
    | ( ( f @ $true )
     != ( f @ ( sk4 @ sk2 ) ) ) ),
    inference(paramod_ordered,[status(thm)],[204,38]) ).

thf(494,plain,
    ( ( sk4 @ sk3 )
    | ~ ( sk4 @ sk2 ) ),
    inference(simp,[status(thm)],[416]) ).

thf(794,plain,
    ( ~ ( sk4 @ sk2 )
    | ( ( sk4 @ sk3 )
     != ( sk4 @ sk3 ) ) ),
    inference(paramod_ordered,[status(thm)],[494,704]) ).

thf(795,plain,
    ~ ( sk4 @ sk2 ),
    inference(pattern_uni,[status(thm)],[794:[]]) ).

thf(820,plain,
    sk4 @ sk3,
    inference(rewrite,[status(thm)],[704,795]) ).

thf(878,plain,
    ( ~ ( sk4 @ sk1 )
    | ~ $true ),
    inference(rewrite,[status(thm)],[142,820]) ).

thf(879,plain,
    ~ ( sk4 @ sk1 ),
    inference(simp,[status(thm)],[878]) ).

thf(822,plain,
    ( ( f @ $false )
   != sk1 ),
    inference(rewrite,[status(thm)],[38,795]) ).

thf(867,plain,
    ! [A: $i] :
      ( ( A != sk1 )
      | ( ( f @ ( sk4 @ A ) )
       != ( f @ $false ) ) ),
    inference(paramod_ordered,[status(thm)],[18,822]) ).

thf(877,plain,
    sk4 @ sk1,
    inference(simp,[status(thm)],[867]) ).

thf(940,plain,
    ~ $true,
    inference(rewrite,[status(thm)],[879,877]) ).

thf(941,plain,
    $false,
    inference(simp,[status(thm)],[940]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEV434^1 : TPTP v8.2.0. Released v5.2.0.
% 0.06/0.15  % Command  : run_Leo-III %s %d
% 0.16/0.36  % Computer : n011.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit : 300
% 0.16/0.36  % WCLimit  : 300
% 0.16/0.36  % DateTime : Sun May 19 18:33:24 EDT 2024
% 0.16/0.36  % CPUTime  : 
% 0.94/0.86  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.16/0.95  % [INFO] 	 Parsing done (94ms). 
% 1.16/0.96  % [INFO] 	 Running in sequential loop mode. 
% 1.64/1.16  % [INFO] 	 eprover registered as external prover. 
% 1.64/1.16  % [INFO] 	 cvc4 registered as external prover. 
% 1.64/1.17  % [INFO] 	 Scanning for conjecture ... 
% 1.64/1.21  % [INFO] 	 Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ... 
% 1.64/1.23  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 1.86/1.23  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.86/1.23  % [INFO] 	 Type checking passed. 
% 1.86/1.24  % [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.37/1.47  % [INFO] 	 GaveUp with current strategy, trying again with another strategy ... 
% 6.06/2.26  % [INFO] 	 Killing All external provers ... 
% 6.06/2.27  % Time passed: 1743ms (effective reasoning time: 1300ms)
% 6.06/2.27  % Solved by strategy<name(funcspec),share(0.5),primSubst(2),sos(false),unifierCount(10),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(true), domConstr(0),specialInstances(-1),restrictUniAttempts(false),termOrdering(none)>
% 6.06/2.27  % Axioms used in derivation (1): fsurj
% 6.06/2.27  % No. of inferences in proof: 42
% 6.06/2.27  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1743 ms resp. 1300 ms w/o parsing
% 6.06/2.29  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.06/2.29  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------