TSTP Solution File: SET909+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SET909+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n005.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 : Fri May 19 11:54:48 EDT 2023
% Result : Theorem 3.24s 1.99s
% Output : Refutation 3.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 18
% Syntax : Number of formulae : 33 ( 16 unt; 5 typ; 0 def)
% Number of atoms : 70 ( 28 equ; 0 cnn)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 182 ( 20 ~; 10 |; 7 &; 120 @)
% ( 5 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 0 ^; 55 !; 4 ?; 59 :)
% Comments :
%------------------------------------------------------------------------------
thf(set_union2_type,type,
set_union2: $i > $i > $i ).
thf(unordered_pair_type,type,
unordered_pair: $i > $i > $i ).
thf(empty_set_type,type,
empty_set: $i ).
thf(in_type,type,
in: $i > $i > $o ).
thf(empty_type,type,
empty: $i > $o ).
thf(10,axiom,
! [A: $i,B: $i] :
( ~ ( empty @ A )
=> ~ ( empty @ ( set_union2 @ A @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc2_xboole_0) ).
thf(88,plain,
! [A: $i,B: $i] :
( ~ ( empty @ A )
=> ~ ( empty @ ( set_union2 @ A @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(5,axiom,
! [A: $i,B: $i] :
( ( set_union2 @ A @ B )
= ( set_union2 @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
thf(24,plain,
! [A: $i,B: $i] :
( ( set_union2 @ A @ B )
= ( set_union2 @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(8,axiom,
! [A: $i,B: $i,C: $i] :
( ( C
= ( set_union2 @ A @ B ) )
<=> ! [D: $i] :
( ( in @ D @ C )
<=> ( ( in @ D @ A )
| ( in @ D @ B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
thf(61,plain,
! [A: $i,B: $i,C: $i] :
( ( ( C
= ( set_union2 @ A @ B ) )
=> ! [D: $i] :
( ( ( in @ D @ C )
=> ( ( in @ D @ A )
| ( in @ D @ B ) ) )
& ( ( ( in @ D @ A )
| ( in @ D @ B ) )
=> ( in @ D @ C ) ) ) )
& ( ! [D: $i] :
( ( ( in @ D @ C )
=> ( ( in @ D @ A )
| ( in @ D @ B ) ) )
& ( ( ( in @ D @ A )
| ( in @ D @ B ) )
=> ( in @ D @ C ) ) )
=> ( C
= ( set_union2 @ A @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(4,axiom,
! [A: $i,B: $i] :
( ( unordered_pair @ A @ B )
= ( unordered_pair @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
thf(21,plain,
! [A: $i,B: $i] :
( ( unordered_pair @ A @ B )
= ( unordered_pair @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(13,axiom,
? [A: $i] : ( empty @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
thf(97,plain,
? [A: $i] : ( empty @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(6,axiom,
! [A: $i] :
( ( A = empty_set )
<=> ! [B: $i] :
~ ( in @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
thf(27,plain,
! [A: $i] :
( ( ( A = empty_set )
=> ! [B: $i] :
~ ( in @ B @ A ) )
& ( ! [B: $i] :
~ ( in @ B @ A )
=> ( A = empty_set ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(11,axiom,
! [A: $i,B: $i] :
( ~ ( empty @ A )
=> ~ ( empty @ ( set_union2 @ B @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc3_xboole_0) ).
thf(91,plain,
! [A: $i,B: $i] :
( ~ ( empty @ A )
=> ~ ( empty @ ( set_union2 @ B @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(7,axiom,
! [A: $i,B: $i,C: $i] :
( ( C
= ( unordered_pair @ A @ B ) )
<=> ! [D: $i] :
( ( in @ D @ C )
<=> ( ( D = A )
| ( D = B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
thf(35,plain,
! [A: $i,B: $i,C: $i] :
( ( ( C
= ( unordered_pair @ A @ B ) )
=> ! [D: $i] :
( ( ( in @ D @ C )
=> ( ( D = A )
| ( D = B ) ) )
& ( ( ( D = A )
| ( D = B ) )
=> ( in @ D @ C ) ) ) )
& ( ! [D: $i] :
( ( ( in @ D @ C )
=> ( ( D = A )
| ( D = B ) ) )
& ( ( ( D = A )
| ( D = B ) )
=> ( in @ D @ C ) ) )
=> ( C
= ( unordered_pair @ A @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( in @ A @ B )
=> ~ ( in @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
thf(19,plain,
! [A: $i,B: $i] :
( ( in @ A @ B )
=> ~ ( in @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(12,axiom,
! [A: $i,B: $i] :
( ( set_union2 @ A @ A )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k2_xboole_0) ).
thf(94,plain,
! [A: $i] :
( ( set_union2 @ A @ A )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i] :
( ( set_union2 @ ( unordered_pair @ A @ B ) @ C )
!= empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t50_zfmisc_1) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i] :
( ( set_union2 @ ( unordered_pair @ A @ B ) @ C )
!= empty_set ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(15,plain,
~ ! [A: $i,B: $i,C: $i] :
( ( set_union2 @ ( unordered_pair @ A @ B ) @ C )
!= empty_set ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(14,axiom,
? [A: $i] :
~ ( empty @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).
thf(99,plain,
? [A: $i] :
~ ( empty @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(9,axiom,
empty @ empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
thf(87,plain,
empty @ empty_set,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(102,plain,
$false,
inference(e,[status(thm)],[88,24,61,21,97,27,91,35,19,94,15,99,87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET909+1 : TPTP v8.1.2. Released v3.2.0.
% 0.14/0.16 % Command : run_Leo-III %s %d
% 0.15/0.37 % Computer : n005.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu May 18 19:05:24 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.90/0.91 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.26/1.04 % [INFO] Parsing done (130ms).
% 1.26/1.05 % [INFO] Running in sequential loop mode.
% 1.63/1.29 % [INFO] eprover registered as external prover.
% 1.63/1.30 % [INFO] cvc4 registered as external prover.
% 1.63/1.30 % [INFO] Scanning for conjecture ...
% 1.79/1.36 % [INFO] Found a conjecture and 12 axioms. Running axiom selection ...
% 1.89/1.39 % [INFO] Axiom selection finished. Selected 12 axioms (removed 0 axioms).
% 1.89/1.41 % [INFO] Problem is first-order (TPTP FOF).
% 1.89/1.41 % [INFO] Type checking passed.
% 1.89/1.42 % [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.24/1.98 % External prover 'e' found a proof!
% 3.24/1.98 % [INFO] Killing All external provers ...
% 3.24/1.99 % Time passed: 1441ms (effective reasoning time: 931ms)
% 3.24/1.99 % 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.24/1.99 % Axioms used in derivation (12): fc1_xboole_0, d1_xboole_0, commutativity_k2_xboole_0, commutativity_k2_tarski, rc1_xboole_0, idempotence_k2_xboole_0, rc2_xboole_0, antisymmetry_r2_hidden, d2_tarski, fc2_xboole_0, fc3_xboole_0, d2_xboole_0
% 3.24/1.99 % No. of inferences in proof: 28
% 3.24/1.99 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1441 ms resp. 931 ms w/o parsing
% 3.38/2.03 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.38/2.03 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------