TSTP Solution File: SWV011-1 by Leo-III---1.7.7

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : SWV011-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n016.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 12:13:33 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
thf(a_holds_type,type,
    a_holds: $i > $o ).

thf(key_type,type,
    key: $i > $i > $i ).

thf(b_type,type,
    b: $i ).

thf(b_holds_type,type,
    b_holds: $i > $o ).

thf(a_type,type,
    a: $i ).

thf(generate_key_type,type,
    generate_key: $i > $i ).

thf(an_a_nonce_type,type,
    an_a_nonce: $i ).

thf(1,negated_conjecture,
    ! [A: $i] :
      ( ~ ( a_holds @ ( key @ A @ b ) )
      | ~ ( b_holds @ ( key @ A @ a ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).

thf(4,plain,
    ! [A: $i] :
      ( ~ ( a_holds @ ( key @ A @ b ) )
      | ~ ( b_holds @ ( key @ A @ a ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(2,axiom,
    b_holds @ ( key @ ( generate_key @ an_a_nonce ) @ a ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1_11) ).

thf(6,plain,
    b_holds @ ( key @ ( generate_key @ an_a_nonce ) @ a ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(3,axiom,
    a_holds @ ( key @ ( generate_key @ an_a_nonce ) @ b ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3_13) ).

thf(7,plain,
    a_holds @ ( key @ ( generate_key @ an_a_nonce ) @ b ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(8,plain,
    $false,
    inference(e,[status(thm)],[4,6,7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SWV011-1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.17  % Command  : run_Leo-III %s %d
% 0.16/0.38  % Computer : n016.cluster.edu
% 0.16/0.38  % Model    : x86_64 x86_64
% 0.16/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38  % Memory   : 8042.1875MB
% 0.16/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38  % CPULimit : 300
% 0.16/0.38  % WCLimit  : 300
% 0.16/0.38  % DateTime : Fri May 19 03:09:13 EDT 2023
% 0.16/0.38  % CPUTime  : 
% 0.93/0.89  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.10/1.01  % [INFO] 	 Parsing done (119ms). 
% 1.10/1.01  % [INFO] 	 Running in sequential loop mode. 
% 1.74/1.33  % [INFO] 	 eprover registered as external prover. 
% 1.74/1.33  % [INFO] 	 cvc4 registered as external prover. 
% 1.74/1.34  % [INFO] 	 Scanning for conjecture ... 
% 1.84/1.42  % [INFO] 	 Found a conjecture and 2 axioms. Running axiom selection ... 
% 2.01/1.45  % [INFO] 	 Axiom selection finished. Selected 2 axioms (removed 0 axioms). 
% 2.01/1.46  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 2.01/1.46  % [INFO] 	 Type checking passed. 
% 2.01/1.46  % [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.45/1.70  % External prover 'e' found a proof!
% 2.45/1.70  % [INFO] 	 Killing All external provers ... 
% 2.45/1.71  % Time passed: 1181ms (effective reasoning time: 687ms)
% 2.45/1.71  % 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.45/1.71  % Axioms used in derivation (2): ax1_11, ax3_13
% 2.45/1.71  % No. of inferences in proof: 7
% 2.45/1.71  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1181 ms resp. 687 ms w/o parsing
% 2.45/1.73  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.45/1.73  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------