TSTP Solution File: SEU902^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEU902^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n015.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 21 03:44:12 EDT 2024
% Result : Theorem 25.32s 4.80s
% Output : Refutation 25.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 12 unt; 4 typ; 0 def)
% Number of atoms : 74 ( 33 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 109 ( 21 ~; 4 |; 11 &; 67 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 32 ( 32 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 5 ^ 18 !; 8 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
thf(d_type,type,
d: $i > $o ).
thf(sk1_type,type,
sk1: ( $i > $o ) > $i ).
thf(sk2_type,type,
sk2: $i > $i > $o ).
thf(sk8_type,type,
sk8: $i > $o ).
thf(1,conjecture,
! [A: ( $i > $o ) > $i] :
( ( ! [B: $i > $o,C: $i > $o] :
( ( ( A @ B )
= ( A @ C ) )
=> ( B = C ) )
& ( d
= ( ^ [B: $i] :
? [C: $i > $o] :
( ~ ( C @ ( A @ C ) )
& ( B
= ( A @ C ) ) ) ) ) )
=> ~ ( d @ ( A @ d ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM143_pme) ).
thf(2,negated_conjecture,
~ ! [A: ( $i > $o ) > $i] :
( ( ! [B: $i > $o,C: $i > $o] :
( ( ( A @ B )
= ( A @ C ) )
=> ( B = C ) )
& ( d
= ( ^ [B: $i] :
? [C: $i > $o] :
( ~ ( C @ ( A @ C ) )
& ( B
= ( A @ C ) ) ) ) ) )
=> ~ ( d @ ( A @ d ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: ( $i > $o ) > $i] :
( ( ! [B: $i > $o,C: $i > $o] :
( ( ( A @ B )
= ( A @ C ) )
=> ( B = C ) )
& ( d
= ( ^ [B: $i] :
? [C: $i > $o] :
( ~ ( C @ ( A @ C ) )
& ( B
= ( A @ C ) ) ) ) ) )
=> ~ ( d @ ( A @ d ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
( d
= ( ^ [A: $i] :
? [B: $i > $o] :
( ~ ( B @ ( sk1 @ B ) )
& ( A
= ( sk1 @ B ) ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(7,plain,
( d
= ( ^ [A: $i] :
? [B: $i > $o] :
( ~ ( B @ ( sk1 @ B ) )
& ( A
= ( sk1 @ B ) ) ) ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(10,plain,
! [A: $i] :
( ( d @ A )
= ( ? [B: $i > $o] :
( ~ ( B @ ( sk1 @ B ) )
& ( A
= ( sk1 @ B ) ) ) ) ),
inference(func_ext,[status(esa)],[7]) ).
thf(4,plain,
d @ ( sk1 @ d ),
inference(cnf,[status(esa)],[3]) ).
thf(60,plain,
! [A: $i] :
( ? [B: $i > $o] :
( ~ ( B @ ( sk1 @ B ) )
& ( A
= ( sk1 @ B ) ) )
| ( ( d @ A )
!= ( d @ ( sk1 @ d ) ) ) ),
inference(paramod_ordered,[status(thm)],[10,4]) ).
thf(61,plain,
? [A: $i > $o] :
( ~ ( A @ ( sk1 @ A ) )
& ( ( sk1 @ d )
= ( sk1 @ A ) ) ),
inference(pattern_uni,[status(thm)],[60:[bind(A,$thf( sk1 @ d ))]]) ).
thf(87,plain,
~ ( sk8 @ ( sk1 @ sk8 ) ),
inference(cnf,[status(esa)],[61]) ).
thf(86,plain,
( ( sk1 @ d )
= ( sk1 @ sk8 ) ),
inference(cnf,[status(esa)],[61]) ).
thf(88,plain,
( ( sk1 @ sk8 )
= ( sk1 @ d ) ),
inference(lifteq,[status(thm)],[86]) ).
thf(114,plain,
~ ( sk8 @ ( sk1 @ d ) ),
inference(rewrite,[status(thm)],[87,88]) ).
thf(6,plain,
! [B: $i > $o,A: $i > $o] :
( ( ( sk1 @ A )
!= ( sk1 @ B ) )
| ( A = B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(8,plain,
! [B: $i > $o,A: $i > $o] :
( ( ( sk1 @ A )
!= ( sk1 @ B ) )
| ( A = B ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(9,plain,
! [A: $i > $o] :
( ( sk2 @ ( sk1 @ A ) )
= A ),
introduced(tautology,[new_symbols(inverse(sk1),[sk2])]) ).
thf(116,plain,
! [A: $i > $o] :
( ( ( sk2 @ ( sk1 @ d ) )
= A )
| ( ( sk1 @ sk8 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[88,9]) ).
thf(117,plain,
( ( sk2 @ ( sk1 @ d ) )
= sk8 ),
inference(pattern_uni,[status(thm)],[116:[bind(A,$thf( sk8 ))]]) ).
thf(420,plain,
sk8 = d,
inference(rewrite,[status(thm)],[117,9]) ).
thf(424,plain,
! [A: $i] :
( ( sk8 @ A )
= ( d @ A ) ),
inference(func_ext,[status(esa)],[420]) ).
thf(2123,plain,
~ ( d @ ( sk1 @ d ) ),
inference(rewrite,[status(thm)],[114,424]) ).
thf(2142,plain,
~ $true,
inference(rewrite,[status(thm)],[2123,4]) ).
thf(2143,plain,
$false,
inference(simp,[status(thm)],[2142]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU902^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n015.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 : Sun May 19 16:05:09 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.92/0.84 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.19/0.95 % [INFO] Parsing done (104ms).
% 1.19/0.96 % [INFO] Running in sequential loop mode.
% 1.54/1.17 % [INFO] nitpick registered as external prover.
% 1.54/1.17 % [INFO] Scanning for conjecture ...
% 1.63/1.23 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.79/1.25 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.79/1.25 % [INFO] Problem is higher-order (TPTP THF).
% 1.79/1.25 % [INFO] Type checking passed.
% 1.87/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 ...
% 24.85/4.79 % [INFO] Killing All external provers ...
% 25.32/4.79 % Time passed: 4277ms (effective reasoning time: 3831ms)
% 25.32/4.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)>
% 25.32/4.80 % Axioms used in derivation (0):
% 25.32/4.80 % No. of inferences in proof: 23
% 25.32/4.80 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 4277 ms resp. 3831 ms w/o parsing
% 25.32/4.84 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 25.32/4.85 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------