TSTP Solution File: SEU599^2 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEU599^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n006.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 03:42:54 EDT 2024
% Result : Theorem 3.59s 2.29s
% Output : Refutation 3.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 35 ( 11 unt; 9 typ; 3 def)
% Number of atoms : 77 ( 18 equ; 0 cnn)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 191 ( 18 ~; 13 |; 0 &; 138 @)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 50 ( 0 ^ 50 !; 0 ?; 50 :)
% Comments :
%------------------------------------------------------------------------------
thf(in_type,type,
in: $i > $i > $o ).
thf(in__Cong_type,type,
in__Cong: $o ).
thf(in__Cong_def,definition,
( in__Cong
= ( ! [A: $i,B: $i] :
( ( A = B )
=> ! [C: $i,D: $i] :
( ( C = D )
=> ( ( in @ C @ A )
= ( in @ D @ B ) ) ) ) ) ) ).
thf(subset_type,type,
subset: $i > $i > $o ).
thf(subsetI1_type,type,
subsetI1: $o ).
thf(subsetI1_def,definition,
( subsetI1
= ( ! [A: $i,B: $i] :
( ! [C: $i] :
( ( in @ C @ A )
=> ( in @ C @ B ) )
=> ( subset @ A @ B ) ) ) ) ).
thf(binintersect_type,type,
binintersect: $i > $i > $i ).
thf(binintersectER_type,type,
binintersectER: $o ).
thf(binintersectER_def,definition,
( binintersectER
= ( ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( binintersect @ A @ B ) )
=> ( in @ C @ B ) ) ) ) ).
thf(sk1_type,type,
sk1: $i > $i > $i ).
thf(sk2_type,type,
sk2: $i ).
thf(sk3_type,type,
sk3: $i ).
thf(1,conjecture,
( in__Cong
=> ( subsetI1
=> ( binintersectER
=> ! [A: $i,B: $i] :
( ( ( binintersect @ A @ B )
= A )
=> ( subset @ A @ B ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectSubset1) ).
thf(2,negated_conjecture,
~ ( in__Cong
=> ( subsetI1
=> ( binintersectER
=> ! [A: $i,B: $i] :
( ( ( binintersect @ A @ B )
= A )
=> ( subset @ A @ B ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i] :
( ( A = B )
=> ! [C: $i,D: $i] :
( ( C = D )
=> ( ( in @ C @ A )
= ( in @ D @ B ) ) ) )
=> ( ! [A: $i,B: $i] :
( ! [C: $i] :
( ( in @ C @ A )
=> ( in @ C @ B ) )
=> ( subset @ A @ B ) )
=> ( ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( binintersect @ A @ B ) )
=> ( in @ C @ B ) )
=> ! [A: $i,B: $i] :
( ( ( binintersect @ A @ B )
= A )
=> ( subset @ A @ B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [B: $i,A: $i] :
( ( in @ ( sk1 @ B @ A ) @ A )
| ( subset @ A @ B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(15,plain,
! [B: $i,A: $i] :
( ( in @ ( sk1 @ B @ A ) @ A )
| ( subset @ A @ B ) ),
inference(simp,[status(thm)],[4]) ).
thf(8,plain,
( ( binintersect @ sk2 @ sk3 )
= sk2 ),
inference(cnf,[status(esa)],[3]) ).
thf(14,plain,
( ( binintersect @ sk2 @ sk3 )
= sk2 ),
inference(lifteq,[status(thm)],[8]) ).
thf(9,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( in @ C @ ( binintersect @ A @ B ) )
| ( in @ C @ B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(13,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( in @ C @ ( binintersect @ A @ B ) )
| ( in @ C @ B ) ),
inference(simp,[status(thm)],[9]) ).
thf(18,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( in @ C @ sk2 )
| ( in @ C @ B )
| ( ( binintersect @ sk2 @ sk3 )
!= ( binintersect @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[14,13]) ).
thf(19,plain,
! [A: $i] :
( ~ ( in @ A @ sk2 )
| ( in @ A @ sk3 ) ),
inference(pattern_uni,[status(thm)],[18:[bind(A,$thf( sk2 )),bind(B,$thf( sk3 ))]]) ).
thf(20,plain,
! [A: $i] :
( ~ ( in @ A @ sk2 )
| ( in @ A @ sk3 ) ),
inference(simp,[status(thm)],[19]) ).
thf(5,plain,
! [B: $i,A: $i] :
( ~ ( in @ ( sk1 @ B @ A ) @ B )
| ( subset @ A @ B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(10,plain,
! [B: $i,A: $i] :
( ~ ( in @ ( sk1 @ B @ A ) @ B )
| ( subset @ A @ B ) ),
inference(simp,[status(thm)],[5]) ).
thf(7,plain,
~ ( subset @ sk2 @ sk3 ),
inference(cnf,[status(esa)],[3]) ).
thf(16,plain,
! [B: $i,A: $i] :
( ~ ( in @ ( sk1 @ B @ A ) @ B )
| ( ( subset @ A @ B )
!= ( subset @ sk2 @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[10,7]) ).
thf(17,plain,
~ ( in @ ( sk1 @ sk3 @ sk2 ) @ sk3 ),
inference(pattern_uni,[status(thm)],[16:[bind(A,$thf( sk2 )),bind(B,$thf( sk3 ))]]) ).
thf(25,plain,
! [A: $i] :
( ~ ( in @ A @ sk2 )
| ( ( in @ A @ sk3 )
!= ( in @ ( sk1 @ sk3 @ sk2 ) @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[20,17]) ).
thf(26,plain,
~ ( in @ ( sk1 @ sk3 @ sk2 ) @ sk2 ),
inference(pattern_uni,[status(thm)],[25:[bind(A,$thf( sk1 @ sk3 @ sk2 ))]]) ).
thf(47,plain,
! [B: $i,A: $i] :
( ( subset @ A @ B )
| ( ( in @ ( sk1 @ B @ A ) @ A )
!= ( in @ ( sk1 @ sk3 @ sk2 ) @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[15,26]) ).
thf(48,plain,
subset @ sk2 @ sk3,
inference(pattern_uni,[status(thm)],[47:[bind(A,$thf( sk2 )),bind(B,$thf( sk3 ))]]) ).
thf(51,plain,
$false,
inference(rewrite,[status(thm)],[48,7]) ).
thf(52,plain,
$false,
inference(simp,[status(thm)],[51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SEU599^2 : TPTP v8.2.0. Released v3.7.0.
% 0.02/0.12 % Command : run_Leo-III %s %d
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 17:47:54 EDT 2024
% 0.12/0.33 % CPUTime :
% 1.02/0.96 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.28/1.13 % [INFO] Parsing done (168ms).
% 1.28/1.14 % [INFO] Running in sequential loop mode.
% 1.93/1.50 % [INFO] nitpick registered as external prover.
% 1.93/1.51 % [INFO] Scanning for conjecture ...
% 2.02/1.62 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.19/1.65 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.19/1.65 % [INFO] Problem is higher-order (TPTP THF).
% 2.19/1.65 % [INFO] Type checking passed.
% 2.19/1.66 % [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 ...
% 3.59/2.29 % [INFO] Killing All external provers ...
% 3.59/2.29 % Time passed: 1811ms (effective reasoning time: 1143ms)
% 3.59/2.29 % 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)>
% 3.59/2.29 % Axioms used in derivation (0):
% 3.59/2.29 % No. of inferences in proof: 23
% 3.59/2.29 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1811 ms resp. 1143 ms w/o parsing
% 3.59/2.34 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.59/2.34 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------