TSTP Solution File: SYO362^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYO362^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n021.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 08:59:59 EDT 2024
% Result : Theorem 7.83s 3.01s
% Output : Refutation 7.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 9 unt; 5 typ; 0 def)
% Number of atoms : 86 ( 19 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 217 ( 31 ~; 37 |; 0 &; 137 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 44 ( 44 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 67 ( 17 ^ 50 !; 0 ?; 67 :)
% Comments :
%------------------------------------------------------------------------------
thf(cK_type,type,
cK: ( $i > $o ) > $i > $o ).
thf(sk1_type,type,
sk1: $i > $o ).
thf(sk2_type,type,
sk2: $i > $o ).
thf(sk3_type,type,
sk3: $i ).
thf(sk6_type,type,
sk6: ( $i > $o ) > $i ).
thf(1,conjecture,
( ! [A: $i > $o,B: $i > $o] :
( ( cK
@ ^ [C: $i] :
( ( A @ C )
| ( B @ C ) ) )
= ( ^ [C: $i] :
( ( cK @ A @ C )
| ( cK @ B @ C ) ) ) )
=> ! [A: $i > $o,B: $i > $o] :
( ! [C: $i] :
( ( A @ C )
=> ( B @ C ) )
=> ! [C: $i] :
( ( cK @ A @ C )
=> ( cK @ B @ C ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM631A_pme) ).
thf(2,negated_conjecture,
~ ( ! [A: $i > $o,B: $i > $o] :
( ( cK
@ ^ [C: $i] :
( ( A @ C )
| ( B @ C ) ) )
= ( ^ [C: $i] :
( ( cK @ A @ C )
| ( cK @ B @ C ) ) ) )
=> ! [A: $i > $o,B: $i > $o] :
( ! [C: $i] :
( ( A @ C )
=> ( B @ C ) )
=> ! [C: $i] :
( ( cK @ A @ C )
=> ( cK @ B @ C ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i > $o,B: $i > $o] :
( ( cK
@ ^ [C: $i] :
( ( A @ C )
| ( B @ C ) ) )
= ( ^ [C: $i] :
( ( cK @ A @ C )
| ( cK @ B @ C ) ) ) )
=> ! [A: $i > $o,B: $i > $o] :
( ! [C: $i] :
( ( A @ C )
=> ( B @ C ) )
=> ! [C: $i] :
( ( cK @ A @ C )
=> ( cK @ B @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
cK @ sk1 @ sk3,
inference(cnf,[status(esa)],[3]) ).
thf(7,plain,
! [B: $i > $o,A: $i > $o] :
( ( cK
@ ^ [C: $i] :
( ( A @ C )
| ( B @ C ) ) )
= ( ^ [C: $i] :
( ( cK @ A @ C )
| ( cK @ B @ C ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(9,plain,
! [B: $i > $o,A: $i > $o] :
( ( cK
@ ^ [C: $i] :
( ( A @ C )
| ( B @ C ) ) )
= ( ^ [C: $i] :
( ( cK @ A @ C )
| ( cK @ B @ C ) ) ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(30,plain,
! [C: $i,B: $i > $o,A: $i > $o] :
( ( cK
@ ^ [D: $i] :
( ( A @ D )
| ( B @ D ) )
@ C )
= ( ( cK @ A @ C )
| ( cK @ B @ C ) ) ),
inference(func_ext,[status(esa)],[9]) ).
thf(4,plain,
~ ( cK @ sk2 @ sk3 ),
inference(cnf,[status(esa)],[3]) ).
thf(38,plain,
! [C: $i,B: $i > $o,A: $i > $o] :
( ~ ( ( cK @ A @ C )
| ( cK @ B @ C ) )
| ( ( cK
@ ^ [D: $i] :
( ( A @ D )
| ( B @ D ) )
@ C )
!= ( cK @ sk2 @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[30,4]) ).
thf(40,plain,
! [C: $i,B: $i > $o,A: $i > $o] :
( ~ ( ( cK @ A @ C )
| ( cK @ B @ C ) )
| ( ( ^ [D: $i] :
( ( A @ D )
| ( B @ D ) ) )
!= sk2 )
| ( C != sk3 ) ),
inference(simp,[status(thm)],[38]) ).
thf(47,plain,
! [C: $i,B: $i > $o,A: $i > $o] :
( ( C != sk3 )
| ( ( ^ [D: $i] :
( ( A @ D )
| ( B @ D ) ) )
!= sk2 )
| ~ ( cK @ B @ C ) ),
inference(cnf,[status(esa)],[40]) ).
thf(49,plain,
! [B: $i > $o,A: $i > $o] :
( ( ( ^ [C: $i] :
( ( A @ C )
| ( B @ C ) ) )
!= sk2 )
| ~ ( cK @ B @ sk3 ) ),
inference(simp,[status(thm)],[47]) ).
thf(54,plain,
! [B: $i > $o,A: $i > $o] :
( ( ( ^ [C: $i] :
( ( A @ C )
| ( B @ C ) ) )
!= sk2 )
| ( ( cK @ sk1 @ sk3 )
!= ( cK @ B @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[5,49]) ).
thf(55,plain,
! [A: $i > $o] :
( ( ^ [B: $i] :
( ( A @ B )
| ( sk1 @ B ) ) )
!= sk2 ),
inference(pattern_uni,[status(thm)],[54:[bind(A,$thf( A )),bind(B,$thf( sk1 ))]]) ).
thf(62,plain,
! [A: $i > $o] :
( ( ( A @ ( sk6 @ A ) )
| ( sk1 @ ( sk6 @ A ) ) )
!= ( sk2 @ ( sk6 @ A ) ) ),
inference(func_ext,[status(esa)],[55]) ).
thf(6,plain,
! [A: $i] :
( ~ ( sk1 @ A )
| ( sk2 @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(8,plain,
! [A: $i] :
( ~ ( sk1 @ A )
| ( sk2 @ A ) ),
inference(simp,[status(thm)],[6]) ).
thf(129,plain,
! [A: $i > $o] :
( ~ ( ( A @ ( sk6 @ A ) )
| ( sk1 @ ( sk6 @ A ) ) )
| ~ ( sk2 @ ( sk6 @ A ) ) ),
inference(bool_ext,[status(thm)],[62]) ).
thf(146,plain,
! [A: $i > $o] :
( ~ ( sk2 @ ( sk6 @ A ) )
| ~ ( sk1 @ ( sk6 @ A ) ) ),
inference(cnf,[status(esa)],[129]) ).
thf(159,plain,
! [B: $i > $o,A: $i] :
( ~ ( sk1 @ A )
| ~ ( sk1 @ ( sk6 @ B ) )
| ( ( sk2 @ A )
!= ( sk2 @ ( sk6 @ B ) ) ) ),
inference(paramod_ordered,[status(thm)],[8,146]) ).
thf(160,plain,
! [A: $i > $o] :
( ~ ( sk1 @ ( sk6 @ A ) )
| ~ ( sk1 @ ( sk6 @ A ) ) ),
inference(pattern_uni,[status(thm)],[159:[bind(A,$thf( sk6 @ C )),bind(B,$thf( C ))]]) ).
thf(163,plain,
! [A: $i > $o] :
~ ( sk1 @ ( sk6 @ A ) ),
inference(simp,[status(thm)],[160]) ).
thf(196,plain,
! [A: $i > $o] :
( ( ( A @ ( sk6 @ A ) )
| $false )
!= ( sk2 @ ( sk6 @ A ) ) ),
inference(rewrite,[status(thm)],[62,163]) ).
thf(197,plain,
! [A: $i > $o] :
( ( A @ ( sk6 @ A ) )
!= ( sk2 @ ( sk6 @ A ) ) ),
inference(simp,[status(thm)],[196]) ).
thf(221,plain,
$false,
inference(pre_uni,[status(thm)],[197:[bind(A,$thf( sk2 ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SYO362^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.11 % Command : run_Leo-III %s %d
% 0.11/0.31 % Computer : n021.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon May 20 08:58:24 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.91/0.91 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.22/1.07 % [INFO] Parsing done (157ms).
% 1.22/1.08 % [INFO] Running in sequential loop mode.
% 1.69/1.42 % [INFO] nitpick registered as external prover.
% 1.69/1.43 % [INFO] Scanning for conjecture ...
% 1.92/1.51 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.00/1.54 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.00/1.54 % [INFO] Problem is higher-order (TPTP THF).
% 2.05/1.55 % [INFO] Type checking passed.
% 2.05/1.55 % [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 ...
% 7.83/3.00 % [INFO] Killing All external provers ...
% 7.83/3.01 % Time passed: 2549ms (effective reasoning time: 1919ms)
% 7.83/3.01 % 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)>
% 7.83/3.01 % Axioms used in derivation (0):
% 7.83/3.01 % No. of inferences in proof: 25
% 7.83/3.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2549 ms resp. 1919 ms w/o parsing
% 7.83/3.07 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.83/3.07 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------