TSTP Solution File: ITP010+2 by Leo-III---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.10
% Problem : ITP010+2 : TPTP v8.1.2. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n027.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 : Tue May 7 07:46:42 EDT 2024
% Result : Theorem 3.58s 1.80s
% Output : Refutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of formulae : 11 ( 2 unt; 7 typ; 0 def)
% Number of atoms : 14 ( 0 equ; 0 cnn)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 64 ( 6 ~; 0 |; 0 &; 48 @)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 10 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 8 ( 0 ^ 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
thf(ne_type,type,
ne: $i > $o ).
thf(mem_type,type,
mem: $i > $i > $o ).
thf(arr_type,type,
arr: $i > $i > $i ).
thf(bool_type,type,
bool: $i ).
thf(p_type,type,
p: $i > $o ).
thf(ap_type,type,
ap: $i > $i > $i ).
thf(c_2Ecardinal_2Ecardleq_type,type,
c_2Ecardinal_2Ecardleq: $i > $i > $i ).
thf(1,conjecture,
! [A: $i] :
( ( ne @ A )
=> ! [B: $i] :
( ( ne @ B )
=> ! [C: $i] :
( ( mem @ C @ ( arr @ A @ bool ) )
=> ! [D: $i] :
( ( mem @ D @ ( arr @ B @ bool ) )
=> ( ~ ( p @ ( ap @ ( ap @ ( c_2Ecardinal_2Ecardleq @ A @ B ) @ C ) @ D ) )
<=> ~ ( p @ ( ap @ ( ap @ ( c_2Ecardinal_2Ecardleq @ A @ B ) @ C ) @ D ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Ecardinal_2ECARD__NOT__LE) ).
thf(2,negated_conjecture,
~ ! [A: $i] :
( ( ne @ A )
=> ! [B: $i] :
( ( ne @ B )
=> ! [C: $i] :
( ( mem @ C @ ( arr @ A @ bool ) )
=> ! [D: $i] :
( ( mem @ D @ ( arr @ B @ bool ) )
=> ( ~ ( p @ ( ap @ ( ap @ ( c_2Ecardinal_2Ecardleq @ A @ B ) @ C ) @ D ) )
<=> ~ ( p @ ( ap @ ( ap @ ( c_2Ecardinal_2Ecardleq @ A @ B ) @ C ) @ D ) ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(43,plain,
~ $true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(44,plain,
$false,
inference(simp,[status(thm)],[43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ITP010+2 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.13/0.15 % Command : run_Leo-III %s %d
% 0.15/0.37 % Computer : n027.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon May 6 14:32:39 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.95/0.86 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.21/0.99 % [INFO] Parsing done (128ms).
% 1.21/1.00 % [INFO] Running in sequential loop mode.
% 1.71/1.20 % [INFO] eprover registered as external prover.
% 1.81/1.20 % [INFO] cvc4 registered as external prover.
% 1.81/1.21 % [INFO] Scanning for conjecture ...
% 1.92/1.28 % [INFO] Found a conjecture and 40 axioms. Running axiom selection ...
% 2.19/1.33 % [INFO] Axiom selection finished. Selected 40 axioms (removed 0 axioms).
% 2.40/1.39 % [INFO] Problem is first-order (TPTP FOF).
% 2.40/1.40 % [INFO] Type checking passed.
% 2.40/1.40 % [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 ...
% 3.53/1.80 % [INFO] Killing All external provers ...
% 3.53/1.80 % Time passed: 1271ms (effective reasoning time: 799ms)
% 3.53/1.80 % 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.53/1.80 % Axioms used in derivation (0):
% 3.53/1.80 % No. of inferences in proof: 4
% 3.58/1.80 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1271 ms resp. 799 ms w/o parsing
% 3.62/1.83 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.62/1.83 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------