TSTP Solution File: SEU159+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SEU159+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n024.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:57:17 EDT 2023
% Result : Theorem 3.21s 1.70s
% Output : Refutation 3.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of formulae : 19 ( 7 unt; 3 typ; 0 def)
% Number of atoms : 50 ( 15 equ; 0 cnn)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 124 ( 4 ~; 5 |; 9 &; 86 @)
% ( 5 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 0 ^; 36 !; 0 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
thf(subset_type,type,
subset: $i > $i > $o ).
thf(unordered_pair_type,type,
unordered_pair: $i > $i > $i ).
thf(in_type,type,
in: $i > $i > $o ).
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/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
thf(21,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(1,conjecture,
! [A: $i,B: $i,C: $i] :
( ( subset @ ( unordered_pair @ A @ B ) @ C )
<=> ( ( in @ A @ C )
& ( in @ B @ C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i] :
( ( subset @ ( unordered_pair @ A @ B ) @ C )
<=> ( ( in @ A @ C )
& ( in @ B @ C ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(9,plain,
~ ! [A: $i,B: $i,C: $i] :
( ( ( subset @ ( unordered_pair @ A @ B ) @ C )
=> ( ( in @ A @ C )
& ( in @ B @ C ) ) )
& ( ( ( in @ A @ C )
& ( in @ B @ C ) )
=> ( subset @ ( unordered_pair @ A @ B ) @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(7,axiom,
$true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_tarski) ).
thf(54,plain,
$true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(4,axiom,
! [A: $i,B: $i] :
( ( unordered_pair @ A @ B )
= ( unordered_pair @ B @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
thf(18,plain,
! [A: $i,B: $i] :
( ( unordered_pair @ A @ B )
= ( unordered_pair @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( in @ A @ B )
=> ~ ( in @ B @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
thf(16,plain,
! [A: $i,B: $i] :
( ( in @ A @ B )
=> ~ ( in @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(8,axiom,
! [A: $i,B: $i] : ( subset @ A @ A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
thf(55,plain,
! [A: $i] : ( subset @ A @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(6,axiom,
! [A: $i,B: $i] :
( ( subset @ A @ B )
<=> ! [C: $i] :
( ( in @ C @ A )
=> ( in @ C @ B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
thf(47,plain,
! [A: $i,B: $i] :
( ( ( subset @ A @ B )
=> ! [C: $i] :
( ( in @ C @ A )
=> ( in @ C @ B ) ) )
& ( ! [C: $i] :
( ( in @ C @ A )
=> ( in @ C @ B ) )
=> ( subset @ A @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(65,plain,
$false,
inference(cvc4,[status(thm)],[21,9,54,18,16,55,47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : SEU159+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.15 % Command : run_Leo-III %s %d
% 0.14/0.36 % Computer : n024.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu May 18 12:32:23 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.89/0.83 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.22/0.94 % [INFO] Parsing done (107ms).
% 1.22/0.95 % [INFO] Running in sequential loop mode.
% 1.52/1.14 % [INFO] eprover registered as external prover.
% 1.52/1.15 % [INFO] cvc4 registered as external prover.
% 1.52/1.15 % [INFO] Scanning for conjecture ...
% 1.77/1.20 % [INFO] Found a conjecture and 6 axioms. Running axiom selection ...
% 1.85/1.22 % [INFO] Axiom selection finished. Selected 6 axioms (removed 0 axioms).
% 1.88/1.23 % [INFO] Problem is first-order (TPTP FOF).
% 1.88/1.24 % [INFO] Type checking passed.
% 1.88/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.86/1.70 % External prover 'cvc4' found a proof!
% 2.86/1.70 % [INFO] Killing All external provers ...
% 3.21/1.70 % Time passed: 1185ms (effective reasoning time: 746ms)
% 3.21/1.70 % 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.21/1.70 % Axioms used in derivation (6): d2_tarski, dt_k2_tarski, commutativity_k2_tarski, antisymmetry_r2_hidden, d3_tarski, reflexivity_r1_tarski
% 3.21/1.70 % No. of inferences in proof: 16
% 3.21/1.70 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1185 ms resp. 746 ms w/o parsing
% 3.21/1.73 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.21/1.73 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------