TSTP Solution File: SEU637^2 by Leo-III---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.15
% Problem : SEU637^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n018.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 15:27:36 EDT 2024
% Result : Theorem 3.10s 1.91s
% Output : Refutation 3.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of formulae : 11 ( 8 unt; 0 typ; 7 def)
% Number of atoms : 73 ( 18 equ; 0 cnn)
% Maximal formula atoms : 20 ( 6 avg)
% Number of connectives : 176 ( 2 ~; 0 |; 5 &; 113 @)
% ( 0 <=>; 56 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 52 ( 1 ^ 46 !; 5 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
thf(in_type,type,
in: $i > $i > $o ).
thf(emptyset_type,type,
emptyset: $i ).
thf(setadjoin_type,type,
setadjoin: $i > $i > $i ).
thf(dsetconstr_type,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(dsetconstrI_type,type,
dsetconstrI: $o ).
thf(dsetconstrI_def,definition,
( dsetconstrI
= ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ A )
=> ( ( B @ C )
=> ( in @ C @ ( dsetconstr @ A @ B ) ) ) ) ) ) ).
thf(dsetconstrEL_type,type,
dsetconstrEL: $o ).
thf(dsetconstrEL_def,definition,
( dsetconstrEL
= ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
=> ( in @ C @ A ) ) ) ) ).
thf(dsetconstrER_type,type,
dsetconstrER: $o ).
thf(dsetconstrER_def,definition,
( dsetconstrER
= ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
=> ( B @ C ) ) ) ) ).
thf(setext_type,type,
setext: $o ).
thf(setext_def,definition,
( setext
= ( ! [A: $i,B: $i] :
( ! [C: $i] :
( ( in @ C @ A )
=> ( in @ C @ B ) )
=> ( ! [C: $i] :
( ( in @ C @ B )
=> ( in @ C @ A ) )
=> ( A = B ) ) ) ) ) ).
thf(uniqinunit_type,type,
uniqinunit: $o ).
thf(uniqinunit_def,definition,
( uniqinunit
= ( ! [A: $i,B: $i] :
( ( in @ A @ ( setadjoin @ B @ emptyset ) )
=> ( A = B ) ) ) ) ).
thf(eqinunit_type,type,
eqinunit: $o ).
thf(eqinunit_def,definition,
( eqinunit
= ( ! [A: $i,B: $i] :
( ( A = B )
=> ( in @ A @ ( setadjoin @ B @ emptyset ) ) ) ) ) ).
thf(singleton_type,type,
singleton: $i > $o ).
thf(singleton_def,definition,
( singleton
= ( ^ [A: $i] :
? [B: $i] :
( ( in @ B @ A )
& ( A
= ( setadjoin @ B @ emptyset ) ) ) ) ) ).
thf(1,conjecture,
( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( setext
=> ( uniqinunit
=> ( eqinunit
=> ! [A: $i,B: $i > $o] :
( ! [C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( ( B @ C )
=> ( ( B @ D )
=> ( C = D ) ) ) ) )
=> ( ? [C: $i] :
( ( in @ C @ A )
& ( B @ C ) )
=> ( singleton @ ( dsetconstr @ A @ B ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singletonprop) ).
thf(2,negated_conjecture,
~ ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( setext
=> ( uniqinunit
=> ( eqinunit
=> ! [A: $i,B: $i > $o] :
( ! [C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( ( B @ C )
=> ( ( B @ D )
=> ( C = D ) ) ) ) )
=> ( ? [C: $i] :
( ( in @ C @ A )
& ( B @ C ) )
=> ( singleton @ ( dsetconstr @ A @ B ) ) ) ) ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ A )
=> ( ( B @ C )
=> ( in @ C @ ( dsetconstr @ A @ B ) ) ) )
=> ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
=> ( in @ C @ A ) )
=> ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
=> ( B @ C ) )
=> ( ! [A: $i,B: $i] :
( ! [C: $i] :
( ( in @ C @ A )
=> ( in @ C @ B ) )
=> ( ! [C: $i] :
( ( in @ C @ B )
=> ( in @ C @ A ) )
=> ( A = B ) ) )
=> ( ! [A: $i,B: $i] :
( ( in @ A @ ( setadjoin @ B @ emptyset ) )
=> ( A = B ) )
=> ( ! [A: $i,B: $i] :
( ( A = B )
=> ( in @ A @ ( setadjoin @ B @ emptyset ) ) )
=> ! [A: $i,B: $i > $o] :
( ! [C: $i] :
( ( in @ C @ A )
=> ! [D: $i] :
( ( in @ D @ A )
=> ( ( B @ C )
=> ( ( B @ D )
=> ( C = D ) ) ) ) )
=> ( ? [C: $i] :
( ( in @ C @ A )
& ( B @ C ) )
=> ? [C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
& ( ( dsetconstr @ A @ B )
= ( setadjoin @ C @ emptyset ) ) ) ) ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(41,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU637^2 : TPTP v8.2.0. Released v3.7.0.
% 0.11/0.12 % Command : run_Leo-III %s %d THM
% 0.13/0.33 % Computer : n018.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Jun 21 14:26:24 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.88/0.85 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.22/0.97 % [INFO] Parsing done (119ms).
% 1.22/0.98 % [INFO] Running in sequential loop mode.
% 1.75/1.22 % [INFO] eprover registered as external prover.
% 1.75/1.23 % [INFO] Scanning for conjecture ...
% 1.97/1.34 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.97/1.37 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.97/1.37 % [INFO] Problem is higher-order (TPTP THF).
% 2.14/1.37 % [INFO] Type checking passed.
% 2.14/1.38 % [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.10/1.91 % External prover 'e' found a proof!
% 3.10/1.91 % [INFO] Killing All external provers ...
% 3.10/1.91 % Time passed: 1366ms (effective reasoning time: 927ms)
% 3.10/1.91 % 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.10/1.91 % Axioms used in derivation (0):
% 3.10/1.91 % No. of inferences in proof: 4
% 3.10/1.91 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1366 ms resp. 927 ms w/o parsing
% 3.43/1.95 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.43/1.95 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------