TSTP Solution File: SWW962+1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SWW962+1 : TPTP v8.2.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n026.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 06:54:13 EDT 2024
% Result : Theorem 20.80s 5.16s
% Output : Refutation 20.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 38 ( 27 unt; 9 typ; 0 def)
% Number of atoms : 33 ( 24 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 124 ( 10 ~; 2 |; 0 &; 112 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 0 ^ 50 !; 0 ?; 50 :)
% Comments :
%------------------------------------------------------------------------------
thf(pred_attacker_type,type,
pred_attacker: $i > $o ).
thf(tuple_2_type,type,
tuple_2: $i > $i > $i ).
thf(name_Nb_type,type,
name_Nb: $i > $i ).
thf(name_objective_type,type,
name_objective: $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_0x30_type,type,
constr_assoc_pair_2_get_0x30: $i > $i ).
thf(constr_assoc_pair_2_get_1_type,type,
constr_assoc_pair_2_get_1: $i > $i ).
thf(sk1_type,type,
sk1: $i ).
thf(20,axiom,
! [A: $i,B: $i] :
( ( constr_assoc_pair_2_get_0x30 @ ( tuple_assoc_pair @ A @ B ) )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax86) ).
thf(229,plain,
! [A: $i,B: $i] :
( ( constr_assoc_pair_2_get_0x30 @ ( tuple_assoc_pair @ A @ B ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[20]) ).
thf(230,plain,
! [B: $i,A: $i] :
( ( constr_assoc_pair_2_get_0x30 @ ( tuple_assoc_pair @ A @ B ) )
= A ),
inference(cnf,[status(esa)],[229]) ).
thf(231,plain,
! [B: $i,A: $i] :
( ( constr_assoc_pair_2_get_0x30 @ ( tuple_assoc_pair @ A @ B ) )
= A ),
inference(lifteq,[status(thm)],[230]) ).
thf(5,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(186,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)],[5]) ).
thf(187,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)],[186]) ).
thf(188,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)],[187]) ).
thf(34,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(271,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)],[34]) ).
thf(272,plain,
! [B: $i,A: $i] :
( ( constr_assoc_pair_2_get_1 @ ( tuple_assoc_pair @ A @ B ) )
= B ),
inference(cnf,[status(esa)],[271]) ).
thf(273,plain,
! [B: $i,A: $i] :
( ( constr_assoc_pair_2_get_1 @ ( tuple_assoc_pair @ A @ B ) )
= B ),
inference(lifteq,[status(thm)],[272]) ).
thf(627,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)],[188,273]) ).
thf(628,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)],[627:[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(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(simp,[status(thm)],[628]) ).
thf(1161,plain,
! [B: $i,A: $i] :
( ( tuple_assoc_pair @ B @ A )
= A ),
inference(rewrite,[status(thm)],[629,273]) ).
thf(1164,plain,
! [B: $i,A: $i] :
( ( constr_assoc_pair_2_get_0x30 @ B )
= A ),
inference(rewrite,[status(thm)],[231,1161]) ).
thf(148,axiom,
pred_attacker @ name_B,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax159) ).
thf(550,plain,
pred_attacker @ name_B,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[148]) ).
thf(1,conjecture,
! [A: $i] : ( pred_attacker @ ( tuple_2 @ ( name_Nb @ A ) @ name_objective ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
thf(2,negated_conjecture,
~ ! [A: $i] : ( pred_attacker @ ( tuple_2 @ ( name_Nb @ A ) @ name_objective ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(178,plain,
~ ! [A: $i] : ( pred_attacker @ ( tuple_2 @ ( name_Nb @ A ) @ name_objective ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(179,plain,
~ ( pred_attacker @ ( tuple_2 @ ( name_Nb @ sk1 ) @ name_objective ) ),
inference(cnf,[status(esa)],[178]) ).
thf(634,plain,
( ( pred_attacker @ ( tuple_2 @ ( name_Nb @ sk1 ) @ name_objective ) )
!= ( pred_attacker @ name_B ) ),
inference(paramod_ordered,[status(thm)],[550,179]) ).
thf(635,plain,
( ( tuple_2 @ ( name_Nb @ sk1 ) @ name_objective )
!= name_B ),
inference(simp,[status(thm)],[634]) ).
thf(1410,plain,
! [B: $i,A: $i] :
( ( ( constr_assoc_pair_2_get_0x30 @ B )
!= name_B )
| ( A
!= ( tuple_2 @ ( name_Nb @ sk1 ) @ name_objective ) ) ),
inference(paramod_ordered,[status(thm)],[1164,635]) ).
thf(1411,plain,
! [A: $i] :
( ( constr_assoc_pair_2_get_0x30 @ A )
!= name_B ),
inference(pattern_uni,[status(thm)],[1410:[bind(A,$thf( tuple_2 @ ( name_Nb @ sk1 ) @ name_objective )),bind(B,$thf( B ))]]) ).
thf(1446,plain,
! [A: $i] :
( ( constr_assoc_pair_2_get_0x30 @ A )
!= name_B ),
inference(simp,[status(thm)],[1411]) ).
thf(1499,plain,
$false,
inference(simplifyReflect,[status(thm)],[1446,1164]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWW962+1 : TPTP v8.2.0. Released v7.4.0.
% 0.11/0.12 % Command : run_Leo-III %s %d
% 0.11/0.32 % Computer : n026.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sat May 18 20:15:09 EDT 2024
% 0.11/0.33 % CPUTime :
% 1.00/0.99 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.68/1.22 % [INFO] Parsing done (227ms).
% 1.73/1.23 % [INFO] Running in sequential loop mode.
% 2.30/1.62 % [INFO] nitpick registered as external prover.
% 2.30/1.63 % [INFO] Scanning for conjecture ...
% 2.47/1.75 % [INFO] Found a conjecture (or negated_conjecture) and 176 axioms. Running axiom selection ...
% 2.75/1.87 % [INFO] Axiom selection finished. Selected 175 axioms (removed 1 axioms).
% 3.12/1.99 % [INFO] Problem is first-order (TPTP FOF).
% 3.37/2.01 % [INFO] Type checking passed.
% 3.37/2.01 % [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 ...
% 20.80/5.16 % [INFO] Killing All external provers ...
% 20.80/5.16 % Time passed: 4679ms (effective reasoning time: 3922ms)
% 20.80/5.16 % 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)>
% 20.80/5.16 % Axioms used in derivation (4): ax86, ax82, ax85, ax159
% 20.80/5.16 % No. of inferences in proof: 29
% 20.80/5.16 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 4679 ms resp. 3922 ms w/o parsing
% 20.80/5.20 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 20.80/5.20 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------