TSTP Solution File: SWW961+1 by Leo-III-SAT---1.7.15

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.15
% Problem  : SWW961+1 : TPTP v8.2.0. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d SAT

% Computer : n027.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 18:26:17 EDT 2024

% Result   : Theorem 17.13s 4.46s
% Output   : Refutation 17.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   28 (  26 unt;   0 typ;   0 def)
%            Number of atoms       :   32 (  24 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :  111 (   9   ~;   2   |;   0   &; 100   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   47 (   0   ^  47   !;   0   ?;  47   :)

% Comments : 
%------------------------------------------------------------------------------
thf(pred_attacker_type,type,
    pred_attacker: $i > $o ).

thf(name_objective_type,type,
    name_objective: $i ).

thf(name_A_type,type,
    name_A: $i ).

thf(name_B_type,type,
    name_B: $i ).

thf(tuple_assoc_pair_type,type,
    tuple_assoc_pair: $i > $i > $i ).

thf(constr_assoc_pair_2_get_1_type,type,
    constr_assoc_pair_2_get_1: $i > $i ).

thf(constr_assoc_pair_2_get_0x30_bitstring_type,type,
    constr_assoc_pair_2_get_0x30_bitstring: $i > $i ).

thf(tuple_client_B_out_1_type,type,
    tuple_client_B_out_1: $i > $i > $i ).

thf(63,axiom,
    ! [A: $i,B: $i] :
      ( ( constr_assoc_pair_2_get_0x30_bitstring @ ( tuple_assoc_pair @ A @ B ) )
      = A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).

thf(355,plain,
    ! [A: $i,B: $i] :
      ( ( constr_assoc_pair_2_get_0x30_bitstring @ ( tuple_assoc_pair @ A @ B ) )
      = A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[63]) ).

thf(356,plain,
    ! [B: $i,A: $i] :
      ( ( constr_assoc_pair_2_get_0x30_bitstring @ ( tuple_assoc_pair @ A @ B ) )
      = A ),
    inference(cnf,[status(esa)],[355]) ).

thf(357,plain,
    ! [B: $i,A: $i] :
      ( ( constr_assoc_pair_2_get_0x30_bitstring @ ( tuple_assoc_pair @ A @ B ) )
      = A ),
    inference(lifteq,[status(thm)],[356]) ).

thf(6,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( tuple_assoc_pair @ A @ ( tuple_assoc_pair @ B @ C ) )
      = ( tuple_assoc_pair @ ( tuple_assoc_pair @ A @ B ) @ C ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax82) ).

thf(188,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( tuple_assoc_pair @ A @ ( tuple_assoc_pair @ B @ C ) )
      = ( tuple_assoc_pair @ ( tuple_assoc_pair @ A @ B ) @ C ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(189,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( tuple_assoc_pair @ A @ ( tuple_assoc_pair @ B @ C ) )
      = ( tuple_assoc_pair @ ( tuple_assoc_pair @ A @ B ) @ C ) ),
    inference(cnf,[status(esa)],[188]) ).

thf(190,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( tuple_assoc_pair @ ( tuple_assoc_pair @ A @ B ) @ C )
      = ( tuple_assoc_pair @ A @ ( tuple_assoc_pair @ B @ C ) ) ),
    inference(lifteq,[status(thm)],[189]) ).

thf(35,axiom,
    ! [A: $i,B: $i] :
      ( ( constr_assoc_pair_2_get_1 @ ( tuple_assoc_pair @ A @ B ) )
      = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax85) ).

thf(273,plain,
    ! [A: $i,B: $i] :
      ( ( constr_assoc_pair_2_get_1 @ ( tuple_assoc_pair @ A @ B ) )
      = B ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[35]) ).

thf(274,plain,
    ! [B: $i,A: $i] :
      ( ( constr_assoc_pair_2_get_1 @ ( tuple_assoc_pair @ A @ B ) )
      = B ),
    inference(cnf,[status(esa)],[273]) ).

thf(275,plain,
    ! [B: $i,A: $i] :
      ( ( constr_assoc_pair_2_get_1 @ ( tuple_assoc_pair @ A @ B ) )
      = B ),
    inference(lifteq,[status(thm)],[274]) ).

thf(628,plain,
    ! [E: $i,D: $i,C: $i,B: $i,A: $i] :
      ( ( ( constr_assoc_pair_2_get_1 @ ( tuple_assoc_pair @ A @ ( tuple_assoc_pair @ B @ C ) ) )
        = E )
      | ( ( tuple_assoc_pair @ ( tuple_assoc_pair @ A @ B ) @ C )
       != ( tuple_assoc_pair @ D @ E ) ) ),
    inference(paramod_ordered,[status(thm)],[190,275]) ).

thf(629,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( constr_assoc_pair_2_get_1 @ ( tuple_assoc_pair @ B @ ( tuple_assoc_pair @ C @ A ) ) )
      = A ),
    inference(pattern_uni,[status(thm)],[628:[bind(A,$thf( F )),bind(B,$thf( G )),bind(C,$thf( C )),bind(D,$thf( tuple_assoc_pair @ F @ G )),bind(E,$thf( C ))]]) ).

thf(630,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( constr_assoc_pair_2_get_1 @ ( tuple_assoc_pair @ B @ ( tuple_assoc_pair @ C @ A ) ) )
      = A ),
    inference(simp,[status(thm)],[629]) ).

thf(994,plain,
    ! [B: $i,A: $i] :
      ( ( tuple_assoc_pair @ B @ A )
      = A ),
    inference(rewrite,[status(thm)],[630,275]) ).

thf(995,plain,
    ! [B: $i,A: $i] :
      ( ( constr_assoc_pair_2_get_0x30_bitstring @ B )
      = A ),
    inference(rewrite,[status(thm)],[357,994]) ).

thf(171,axiom,
    pred_attacker @ ( tuple_client_B_out_1 @ name_B @ name_A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax171) ).

thf(597,plain,
    pred_attacker @ ( tuple_client_B_out_1 @ name_B @ name_A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[171]) ).

thf(1,conjecture,
    pred_attacker @ name_objective,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).

thf(2,negated_conjecture,
    ~ ( pred_attacker @ name_objective ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(178,plain,
    ~ ( pred_attacker @ name_objective ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(650,plain,
    ( ( pred_attacker @ ( tuple_client_B_out_1 @ name_B @ name_A ) )
   != ( pred_attacker @ name_objective ) ),
    inference(paramod_ordered,[status(thm)],[597,178]) ).

thf(651,plain,
    ( ( tuple_client_B_out_1 @ name_B @ name_A )
   != name_objective ),
    inference(simp,[status(thm)],[650]) ).

thf(1025,plain,
    ! [B: $i,A: $i] :
      ( ( ( constr_assoc_pair_2_get_0x30_bitstring @ B )
       != name_objective )
      | ( A
       != ( tuple_client_B_out_1 @ name_B @ name_A ) ) ),
    inference(paramod_ordered,[status(thm)],[995,651]) ).

thf(1026,plain,
    ! [A: $i] :
      ( ( constr_assoc_pair_2_get_0x30_bitstring @ A )
     != name_objective ),
    inference(pattern_uni,[status(thm)],[1025:[bind(A,$thf( tuple_client_B_out_1 @ name_B @ name_A )),bind(B,$thf( B ))]]) ).

thf(1187,plain,
    ! [A: $i] :
      ( ( constr_assoc_pair_2_get_0x30_bitstring @ A )
     != name_objective ),
    inference(simp,[status(thm)],[1026]) ).

thf(1218,plain,
    $false,
    inference(simplifyReflect,[status(thm)],[1187,995]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SWW961+1 : TPTP v8.2.0. Released v7.4.0.
% 0.00/0.10  % Command  : run_Leo-III %s %d SAT
% 0.09/0.31  % Computer : n027.cluster.edu
% 0.09/0.31  % Model    : x86_64 x86_64
% 0.09/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31  % Memory   : 8042.1875MB
% 0.09/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31  % CPULimit : 300
% 0.09/0.31  % WCLimit  : 300
% 0.09/0.31  % DateTime : Wed Jun 19 05:09:25 EDT 2024
% 0.09/0.31  % CPUTime  : 
% 0.95/0.93  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.29/1.14  % [INFO] 	 Parsing done (208ms). 
% 1.29/1.15  % [INFO] 	 Running in sequential loop mode. 
% 2.06/1.49  % [INFO] 	 nitpick registered as external prover. 
% 2.06/1.50  % [INFO] 	 Scanning for conjecture ... 
% 2.20/1.60  % [INFO] 	 Found a conjecture (or negated_conjecture) and 176 axioms. Running axiom selection ... 
% 2.62/1.70  % [INFO] 	 Axiom selection finished. Selected 175 axioms (removed 1 axioms). 
% 3.03/1.82  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 3.03/1.83  % [INFO] 	 Type checking passed. 
% 3.03/1.84  % [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 ... 
% 17.13/4.44  % [INFO] 	 Killing All external provers ... 
% 17.13/4.45  % Time passed: 3965ms (effective reasoning time: 3281ms)
% 17.13/4.45  % 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)>
% 17.13/4.45  % Axioms used in derivation (4): ax84, ax82, ax85, ax171
% 17.13/4.45  % No. of inferences in proof: 28
% 17.13/4.46  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 3965 ms resp. 3281 ms w/o parsing
% 17.13/4.48  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 17.13/4.48  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------