TSTP Solution File: SET881+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SET881+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n028.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:44 EDT 2023
% Result : Theorem 2.86s 1.67s
% Output : Refutation 3.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 14
% Syntax : Number of formulae : 24 ( 12 unt; 6 typ; 0 def)
% Number of atoms : 40 ( 21 equ; 0 cnn)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 96 ( 6 ~; 5 |; 4 &; 68 @)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 0 ^; 27 !; 4 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
thf(set_difference_type,type,
set_difference: $i > $i > $i ).
thf(singleton_type,type,
singleton: $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(1,conjecture,
! [A: $i,B: $i] :
( ( set_difference @ ( singleton @ A ) @ ( unordered_pair @ A @ B ) )
= empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t22_zfmisc_1) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i] :
( ( set_difference @ ( singleton @ A ) @ ( unordered_pair @ A @ B ) )
= empty_set ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(10,plain,
~ ! [A: $i,B: $i] :
( ( set_difference @ ( singleton @ A ) @ ( unordered_pair @ A @ B ) )
= empty_set ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(8,axiom,
? [A: $i] : ( empty @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
thf(52,plain,
? [A: $i] : ( empty @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( in @ A @ B )
=> ~ ( in @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
thf(13,plain,
! [A: $i,B: $i] :
( ( in @ A @ B )
=> ~ ( in @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(7,axiom,
! [A: $i,B: $i] :
( ( ( set_difference @ ( singleton @ A ) @ B )
= empty_set )
<=> ( in @ A @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l36_zfmisc_1) ).
thf(45,plain,
! [A: $i,B: $i] :
( ( ( ( set_difference @ ( singleton @ A ) @ B )
= empty_set )
=> ( in @ A @ B ) )
& ( ( in @ A @ B )
=> ( ( set_difference @ ( singleton @ A ) @ B )
= empty_set ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(6,axiom,
empty @ empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
thf(44,plain,
empty @ empty_set,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(9,axiom,
? [A: $i] :
~ ( empty @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).
thf(54,plain,
? [A: $i] :
~ ( empty @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(5,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(18,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)],[5]) ).
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(15,plain,
! [A: $i,B: $i] :
( ( unordered_pair @ A @ B )
= ( unordered_pair @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(57,plain,
$false,
inference(e,[status(thm)],[10,52,13,45,44,54,18,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET881+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.15 % Command : run_Leo-III %s %d
% 0.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 18 19:16:49 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.83/0.85 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.09/0.98 % [INFO] Parsing done (125ms).
% 1.09/0.99 % [INFO] Running in sequential loop mode.
% 1.63/1.19 % [INFO] eprover registered as external prover.
% 1.63/1.19 % [INFO] cvc4 registered as external prover.
% 1.63/1.20 % [INFO] Scanning for conjecture ...
% 1.63/1.25 % [INFO] Found a conjecture and 7 axioms. Running axiom selection ...
% 1.63/1.27 % [INFO] Axiom selection finished. Selected 7 axioms (removed 0 axioms).
% 1.63/1.28 % [INFO] Problem is first-order (TPTP FOF).
% 1.63/1.29 % [INFO] Type checking passed.
% 1.98/1.29 % [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.86/1.67 % External prover 'e' found a proof!
% 2.86/1.67 % [INFO] Killing All external provers ...
% 2.86/1.67 % Time passed: 1158ms (effective reasoning time: 678ms)
% 2.86/1.67 % 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.86/1.67 % Axioms used in derivation (7): fc1_xboole_0, d2_tarski, commutativity_k2_tarski, rc1_xboole_0, rc2_xboole_0, l36_zfmisc_1, antisymmetry_r2_hidden
% 2.86/1.67 % No. of inferences in proof: 18
% 2.86/1.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1158 ms resp. 678 ms w/o parsing
% 3.18/1.76 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.18/1.76 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------