TSTP Solution File: SET788+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SET788+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n025.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:19 EDT 2023
% Result : Theorem 2.56s 1.59s
% Output : Refutation 2.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 6 ( 1 unt; 2 typ; 0 def)
% Number of atoms : 25 ( 0 equ; 0 cnn)
% Maximal formula atoms : 14 ( 6 avg)
% Number of connectives : 71 ( 2 ~; 0 |; 4 &; 48 @)
% ( 6 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 3 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 16 ( 0 ^; 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(equalish_type,type,
equalish: $i > $i > $o ).
thf(a_member_of_type,type,
a_member_of: $i > $i > $o ).
thf(1,conjecture,
( ! [A: $i,B: $i] :
( ( equalish @ A @ B )
<=> ! [C: $i] :
( ( a_member_of @ C @ A )
<=> ( a_member_of @ C @ B ) ) )
=> ! [A: $i,B: $i] :
( ( equalish @ A @ B )
<=> ( equalish @ B @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
thf(2,negated_conjecture,
~ ( ! [A: $i,B: $i] :
( ( equalish @ A @ B )
<=> ! [C: $i] :
( ( a_member_of @ C @ A )
<=> ( a_member_of @ C @ B ) ) )
=> ! [A: $i,B: $i] :
( ( equalish @ A @ B )
<=> ( equalish @ B @ A ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i] :
( ( ( equalish @ A @ B )
=> ! [C: $i] :
( ( ( a_member_of @ C @ A )
=> ( a_member_of @ C @ B ) )
& ( ( a_member_of @ C @ B )
=> ( a_member_of @ C @ A ) ) ) )
& ( ! [C: $i] :
( ( ( a_member_of @ C @ A )
=> ( a_member_of @ C @ B ) )
& ( ( a_member_of @ C @ B )
=> ( a_member_of @ C @ A ) ) )
=> ( equalish @ A @ B ) ) )
=> ! [A: $i,B: $i] :
( ( ( equalish @ A @ B )
=> ( equalish @ B @ A ) )
& ( ( equalish @ B @ A )
=> ( equalish @ A @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(26,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET788+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.15 % Command : run_Leo-III %s %d
% 0.16/0.36 % Computer : n025.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu May 18 19:31:04 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.98/0.85 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.22/0.96 % [INFO] Parsing done (108ms).
% 1.22/0.97 % [INFO] Running in sequential loop mode.
% 1.65/1.18 % [INFO] eprover registered as external prover.
% 1.65/1.18 % [INFO] cvc4 registered as external prover.
% 1.65/1.19 % [INFO] Scanning for conjecture ...
% 1.83/1.24 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ...
% 1.83/1.26 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.83/1.26 % [INFO] Problem is first-order (TPTP FOF).
% 1.83/1.26 % [INFO] Type checking passed.
% 1.83/1.26 % [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.56/1.59 % External prover 'e' found a proof!
% 2.56/1.59 % [INFO] Killing All external provers ...
% 2.56/1.59 % Time passed: 1067ms (effective reasoning time: 621ms)
% 2.56/1.59 % 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.56/1.59 % Axioms used in derivation (0):
% 2.56/1.59 % No. of inferences in proof: 4
% 2.56/1.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1067 ms resp. 621 ms w/o parsing
% 2.93/1.65 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.93/1.65 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------