TSTP Solution File: SEU599^2 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---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 : n013.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:38:29 EDT 2024
% Result : Theorem 2.91s 1.60s
% Output : Refutation 2.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of formulae : 13 ( 4 unt; 6 typ; 3 def)
% Number of atoms : 39 ( 12 equ; 0 cnn)
% Maximal formula atoms : 10 ( 5 avg)
% Number of connectives : 68 ( 2 ~; 0 |; 0 &; 44 @)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 0 ^ 26 !; 0 ?; 26 :)
% 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(1,conjecture,
( in__Cong
=> ( subsetI1
=> ( binintersectER
=> ! [A: $i,B: $i] :
( ( ( binintersect @ A @ B )
= A )
=> ( subset @ A @ B ) ) ) ) ),
file('/export/starexec/sandbox2/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(18,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU599^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.14 % Command : run_Leo-III %s %d
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 17:47:54 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.95/0.85 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.21/0.94 % [INFO] Parsing done (96ms).
% 1.21/0.95 % [INFO] Running in sequential loop mode.
% 1.55/1.15 % [INFO] eprover registered as external prover.
% 1.55/1.15 % [INFO] cvc4 registered as external prover.
% 1.55/1.15 % [INFO] Scanning for conjecture ...
% 1.66/1.22 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.89/1.23 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.89/1.23 % [INFO] Problem is higher-order (TPTP THF).
% 1.89/1.24 % [INFO] Type checking passed.
% 1.89/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.91/1.60 % External prover 'e' found a proof!
% 2.91/1.60 % [INFO] Killing All external provers ...
% 2.91/1.60 % Time passed: 1089ms (effective reasoning time: 644ms)
% 2.91/1.60 % 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.91/1.60 % Axioms used in derivation (0):
% 2.91/1.60 % No. of inferences in proof: 4
% 2.91/1.60 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1089 ms resp. 644 ms w/o parsing
% 2.91/1.63 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.91/1.63 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------