TSTP Solution File: SEU121+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SEU121+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n020.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:04 EDT 2023
% Result : Theorem 2.77s 1.76s
% Output : Refutation 3.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 15
% Syntax : Number of formulae : 28 ( 11 unt; 4 typ; 0 def)
% Number of atoms : 47 ( 4 equ; 0 cnn)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 101 ( 12 ~; 0 |; 10 &; 66 @)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 0 ^; 33 !; 4 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
thf(subset_type,type,
subset: $i > $i > $o ).
thf(in_type,type,
in: $i > $i > $o ).
thf(empty_type,type,
empty: $i > $o ).
thf(empty_set_type,type,
empty_set: $i ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( in @ A @ B )
=> ~ ( in @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
thf(17,plain,
! [A: $i,B: $i] :
( ( in @ A @ B )
=> ~ ( in @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(6,axiom,
empty @ empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
thf(27,plain,
empty @ empty_set,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(10,axiom,
! [A: $i] :
( ( empty @ A )
=> ( A = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
thf(35,plain,
! [A: $i] :
( ( empty @ A )
=> ( A = empty_set ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(5,axiom,
$true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_xboole_0) ).
thf(26,plain,
$true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(9,axiom,
! [A: $i,B: $i] : ( subset @ A @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
thf(33,plain,
! [A: $i] : ( subset @ A @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(7,axiom,
? [A: $i] : ( empty @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
thf(28,plain,
? [A: $i] : ( empty @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(11,axiom,
! [A: $i,B: $i] :
~ ( ( in @ A @ B )
& ( empty @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
thf(38,plain,
! [A: $i,B: $i] :
~ ( ( in @ A @ B )
& ( empty @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i] :
( ( ( subset @ A @ B )
& ( subset @ B @ C ) )
=> ( subset @ A @ C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i] :
( ( ( subset @ A @ B )
& ( subset @ B @ C ) )
=> ( subset @ A @ C ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(13,plain,
~ ! [A: $i,B: $i,C: $i] :
( ( ( subset @ A @ B )
& ( subset @ B @ C ) )
=> ( subset @ A @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(12,axiom,
! [A: $i,B: $i] :
~ ( ( empty @ A )
& ( A != B )
& ( empty @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_boole) ).
thf(41,plain,
! [A: $i,B: $i] :
~ ( ( empty @ A )
& ( A != B )
& ( empty @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(8,axiom,
? [A: $i] :
~ ( empty @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).
thf(30,plain,
? [A: $i] :
~ ( empty @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(4,axiom,
! [A: $i,B: $i] :
( ( subset @ A @ B )
<=> ! [C: $i] :
( ( in @ C @ A )
=> ( in @ C @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
thf(19,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)],[4]) ).
thf(49,plain,
$false,
inference(cvc4,[status(thm)],[17,27,35,26,33,28,38,13,41,30,19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU121+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n020.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu May 18 13:32:48 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.98/0.89 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.31/1.01 % [INFO] Parsing done (125ms).
% 1.31/1.02 % [INFO] Running in sequential loop mode.
% 1.72/1.22 % [INFO] eprover registered as external prover.
% 1.72/1.23 % [INFO] cvc4 registered as external prover.
% 1.72/1.23 % [INFO] Scanning for conjecture ...
% 1.72/1.29 % [INFO] Found a conjecture and 10 axioms. Running axiom selection ...
% 1.72/1.31 % [INFO] Axiom selection finished. Selected 10 axioms (removed 0 axioms).
% 1.98/1.32 % [INFO] Problem is first-order (TPTP FOF).
% 1.98/1.32 % [INFO] Type checking passed.
% 1.98/1.33 % [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.77/1.76 % External prover 'cvc4' found a proof!
% 2.77/1.76 % [INFO] Killing All external provers ...
% 2.77/1.76 % Time passed: 1254ms (effective reasoning time: 733ms)
% 2.77/1.76 % 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.77/1.76 % Axioms used in derivation (10): fc1_xboole_0, t6_boole, t7_boole, dt_k1_xboole_0, rc2_xboole_0, antisymmetry_r2_hidden, d3_tarski, reflexivity_r1_tarski, t8_boole, rc1_xboole_0
% 2.77/1.76 % No. of inferences in proof: 24
% 2.77/1.76 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1254 ms resp. 733 ms w/o parsing
% 3.13/1.83 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.13/1.83 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------