TSTP Solution File: SET200+3 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SET200+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% 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 : Fri May 19 11:52:59 EDT 2023
% Result : Theorem 2.99s 1.66s
% Output : Refutation 3.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of formulae : 17 ( 5 unt; 3 typ; 0 def)
% Number of atoms : 45 ( 5 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 137 ( 2 ~; 3 |; 8 &; 104 @)
% ( 4 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 38 ( 0 ^; 38 !; 0 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
thf(subset_type,type,
subset: $i > $i > $o ).
thf(union_type,type,
union: $i > $i > $i ).
thf(member_type,type,
member: $i > $i > $o ).
thf(6,axiom,
! [A: $i] : ( subset @ A @ A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_of_subset) ).
thf(29,plain,
! [A: $i] : ( subset @ A @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(3,axiom,
! [A: $i,B: $i,C: $i] :
( ( member @ C @ ( union @ A @ B ) )
<=> ( ( member @ C @ A )
| ( member @ C @ B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).
thf(12,plain,
! [A: $i,B: $i,C: $i] :
( ( ( member @ C @ ( union @ A @ B ) )
=> ( ( member @ C @ A )
| ( member @ C @ B ) ) )
& ( ( ( member @ C @ A )
| ( member @ C @ B ) )
=> ( member @ C @ ( union @ A @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(7,axiom,
! [A: $i,B: $i] :
( ( A = B )
<=> ! [C: $i] :
( ( member @ C @ A )
<=> ( member @ C @ B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn) ).
thf(31,plain,
! [A: $i,B: $i] :
( ( ( A = B )
=> ! [C: $i] :
( ( ( member @ C @ A )
=> ( member @ C @ B ) )
& ( ( member @ C @ B )
=> ( member @ C @ A ) ) ) )
& ( ! [C: $i] :
( ( ( member @ C @ A )
=> ( member @ C @ B ) )
& ( ( member @ C @ B )
=> ( member @ C @ A ) ) )
=> ( A = B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(5,axiom,
! [A: $i,B: $i] :
( ( union @ A @ B )
= ( union @ B @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_union) ).
thf(26,plain,
! [A: $i,B: $i] :
( ( union @ A @ B )
= ( union @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ( subset @ A @ B )
& ( subset @ C @ D ) )
=> ( subset @ ( union @ A @ C ) @ ( union @ B @ D ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th34) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i,D: $i] :
( ( ( subset @ A @ B )
& ( subset @ C @ D ) )
=> ( subset @ ( union @ A @ C ) @ ( union @ B @ D ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(8,plain,
~ ! [A: $i,B: $i,C: $i,D: $i] :
( ( ( subset @ A @ B )
& ( subset @ C @ D ) )
=> ( subset @ ( union @ A @ C ) @ ( union @ B @ D ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,axiom,
! [A: $i,B: $i] :
( ( subset @ A @ B )
<=> ! [C: $i] :
( ( member @ C @ A )
=> ( member @ C @ B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
thf(19,plain,
! [A: $i,B: $i] :
( ( ( subset @ A @ B )
=> ! [C: $i] :
( ( member @ C @ A )
=> ( member @ C @ B ) ) )
& ( ! [C: $i] :
( ( member @ C @ A )
=> ( member @ C @ B ) )
=> ( subset @ A @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(58,plain,
$false,
inference(cvc4,[status(thm)],[29,12,31,26,8,19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET200+3 : TPTP v8.1.2. Released v2.2.0.
% 0.12/0.15 % Command : run_Leo-III %s %d
% 0.14/0.35 % Computer : n018.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.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu May 18 19:21:13 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.83/0.83 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.18/0.94 % [INFO] Parsing done (111ms).
% 1.24/0.95 % [INFO] Running in sequential loop mode.
% 1.47/1.14 % [INFO] eprover registered as external prover.
% 1.47/1.14 % [INFO] cvc4 registered as external prover.
% 1.47/1.15 % [INFO] Scanning for conjecture ...
% 1.75/1.20 % [INFO] Found a conjecture and 5 axioms. Running axiom selection ...
% 1.75/1.22 % [INFO] Axiom selection finished. Selected 5 axioms (removed 0 axioms).
% 1.86/1.23 % [INFO] Problem is first-order (TPTP FOF).
% 1.87/1.23 % [INFO] Type checking passed.
% 1.87/1.23 % [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.99/1.66 % External prover 'cvc4' found a proof!
% 2.99/1.66 % [INFO] Killing All external provers ...
% 2.99/1.66 % Time passed: 1150ms (effective reasoning time: 706ms)
% 2.99/1.66 % 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.99/1.66 % Axioms used in derivation (5): reflexivity_of_subset, equal_member_defn, commutativity_of_union, union_defn, subset_defn
% 2.99/1.66 % No. of inferences in proof: 14
% 2.99/1.66 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1150 ms resp. 706 ms w/o parsing
% 3.26/1.69 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.26/1.69 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------