TSTP Solution File: KRS181+1 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : KRS181+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n016.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 10:38:31 EDT 2024
% Result : Theorem 8.06s 2.70s
% Output : Refutation 8.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 11
% Syntax : Number of formulae : 43 ( 9 unt; 8 typ; 0 def)
% Number of atoms : 99 ( 6 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 375 ( 30 ~; 22 |; 12 &; 293 @)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 86 ( 0 ^ 76 !; 10 ?; 86 :)
% Comments :
%------------------------------------------------------------------------------
thf(isa_type,type,
isa: $i > $i > $o ).
thf(nota_type,type,
nota: $i > $i > $o ).
thf(status_type,type,
status: $i > $i > $i > $o ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i ).
thf(sk3_type,type,
sk3: $i ).
thf(sk8_type,type,
sk8: $i > $i > $i ).
thf(sk9_type,type,
sk9: $i > $i > $i ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i] :
( ( ( isa @ A @ B )
& ( nota @ A @ C ) )
=> ( nota @ B @ C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nota_isa_nota) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i] :
( ( ( isa @ A @ B )
& ( nota @ A @ C ) )
=> ( nota @ B @ C ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(16,plain,
~ ! [A: $i,B: $i,C: $i] :
( ( ( isa @ A @ B )
& ( nota @ A @ C ) )
=> ( nota @ B @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(18,plain,
nota @ sk1 @ sk3,
inference(cnf,[status(esa)],[16]) ).
thf(5,axiom,
! [A: $i,B: $i] :
( ? [C: $i,D: $i] :
( ( status @ C @ D @ A )
& ~ ( status @ C @ D @ B ) )
<=> ( nota @ A @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nota) ).
thf(33,plain,
! [A: $i,B: $i] :
( ( ? [C: $i,D: $i] :
( ( status @ C @ D @ A )
& ~ ( status @ C @ D @ B ) )
=> ( nota @ A @ B ) )
& ( ( nota @ A @ B )
=> ? [C: $i,D: $i] :
( ( status @ C @ D @ A )
& ~ ( status @ C @ D @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(34,plain,
( ! [A: $i,B: $i] :
( ? [C: $i,D: $i] :
( ( status @ C @ D @ A )
& ~ ( status @ C @ D @ B ) )
=> ( nota @ A @ B ) )
& ! [A: $i,B: $i] :
( ( nota @ A @ B )
=> ? [C: $i,D: $i] :
( ( status @ C @ D @ A )
& ~ ( status @ C @ D @ B ) ) ) ),
inference(miniscope,[status(thm)],[33]) ).
thf(35,plain,
! [B: $i,A: $i] :
( ~ ( nota @ A @ B )
| ( status @ ( sk8 @ B @ A ) @ ( sk9 @ B @ A ) @ A ) ),
inference(cnf,[status(esa)],[34]) ).
thf(38,plain,
! [B: $i,A: $i] :
( ~ ( nota @ A @ B )
| ( status @ ( sk8 @ B @ A ) @ ( sk9 @ B @ A ) @ A ) ),
inference(simp,[status(thm)],[35]) ).
thf(393,plain,
! [B: $i,A: $i] :
( ( status @ ( sk8 @ B @ A ) @ ( sk9 @ B @ A ) @ A )
| ( ( nota @ sk1 @ sk3 )
!= ( nota @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[18,38]) ).
thf(394,plain,
status @ ( sk8 @ sk3 @ sk1 ) @ ( sk9 @ sk3 @ sk1 ) @ sk1,
inference(pattern_uni,[status(thm)],[393:[bind(A,$thf( sk1 )),bind(B,$thf( sk3 ))]]) ).
thf(19,plain,
isa @ sk1 @ sk2,
inference(cnf,[status(esa)],[16]) ).
thf(4,axiom,
! [A: $i,B: $i] :
( ! [C: $i,D: $i] :
( ( status @ C @ D @ A )
=> ( status @ C @ D @ B ) )
<=> ( isa @ A @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',isa) ).
thf(27,plain,
! [A: $i,B: $i] :
( ( ! [C: $i,D: $i] :
( ( status @ C @ D @ A )
=> ( status @ C @ D @ B ) )
=> ( isa @ A @ B ) )
& ( ( isa @ A @ B )
=> ! [C: $i,D: $i] :
( ( status @ C @ D @ A )
=> ( status @ C @ D @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(28,plain,
( ! [A: $i,B: $i] :
( ! [C: $i,D: $i] :
( ( status @ C @ D @ A )
=> ( status @ C @ D @ B ) )
=> ( isa @ A @ B ) )
& ! [A: $i,B: $i] :
( ( isa @ A @ B )
=> ! [C: $i,D: $i] :
( ( status @ C @ D @ A )
=> ( status @ C @ D @ B ) ) ) ),
inference(miniscope,[status(thm)],[27]) ).
thf(29,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( isa @ A @ B )
| ~ ( status @ C @ D @ A )
| ( status @ C @ D @ B ) ),
inference(cnf,[status(esa)],[28]) ).
thf(32,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( isa @ A @ B )
| ~ ( status @ C @ D @ A )
| ( status @ C @ D @ B ) ),
inference(simp,[status(thm)],[29]) ).
thf(285,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( status @ C @ D @ A )
| ( status @ C @ D @ B )
| ( ( isa @ sk1 @ sk2 )
!= ( isa @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[19,32]) ).
thf(286,plain,
! [B: $i,A: $i] :
( ~ ( status @ A @ B @ sk1 )
| ( status @ A @ B @ sk2 ) ),
inference(pattern_uni,[status(thm)],[285:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 ))]]) ).
thf(297,plain,
! [B: $i,A: $i] :
( ~ ( status @ A @ B @ sk1 )
| ( status @ A @ B @ sk2 ) ),
inference(simp,[status(thm)],[286]) ).
thf(425,plain,
! [B: $i,A: $i] :
( ( status @ A @ B @ sk2 )
| ( ( status @ ( sk8 @ sk3 @ sk1 ) @ ( sk9 @ sk3 @ sk1 ) @ sk1 )
!= ( status @ A @ B @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[394,297]) ).
thf(426,plain,
status @ ( sk8 @ sk3 @ sk1 ) @ ( sk9 @ sk3 @ sk1 ) @ sk2,
inference(pattern_uni,[status(thm)],[425:[bind(A,$thf( sk8 @ sk3 @ sk1 )),bind(B,$thf( sk9 @ sk3 @ sk1 ))]]) ).
thf(37,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( status @ C @ D @ A )
| ( status @ C @ D @ B )
| ( nota @ A @ B ) ),
inference(cnf,[status(esa)],[34]) ).
thf(441,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( status @ C @ D @ B )
| ( nota @ A @ B )
| ( ( status @ ( sk8 @ sk3 @ sk1 ) @ ( sk9 @ sk3 @ sk1 ) @ sk2 )
!= ( status @ C @ D @ A ) ) ),
inference(paramod_ordered,[status(thm)],[426,37]) ).
thf(442,plain,
! [A: $i] :
( ( status @ ( sk8 @ sk3 @ sk1 ) @ ( sk9 @ sk3 @ sk1 ) @ A )
| ( nota @ sk2 @ A ) ),
inference(pattern_uni,[status(thm)],[441:[bind(A,$thf( sk2 )),bind(B,$thf( B )),bind(C,$thf( sk8 @ sk3 @ sk1 )),bind(D,$thf( sk9 @ sk3 @ sk1 ))]]) ).
thf(454,plain,
! [A: $i] :
( ( status @ ( sk8 @ sk3 @ sk1 ) @ ( sk9 @ sk3 @ sk1 ) @ A )
| ( nota @ sk2 @ A ) ),
inference(simp,[status(thm)],[442]) ).
thf(36,plain,
! [B: $i,A: $i] :
( ~ ( nota @ A @ B )
| ~ ( status @ ( sk8 @ B @ A ) @ ( sk9 @ B @ A ) @ B ) ),
inference(cnf,[status(esa)],[34]) ).
thf(39,plain,
! [B: $i,A: $i] :
( ~ ( nota @ A @ B )
| ~ ( status @ ( sk8 @ B @ A ) @ ( sk9 @ B @ A ) @ B ) ),
inference(simp,[status(thm)],[36]) ).
thf(543,plain,
! [B: $i,A: $i] :
( ~ ( status @ ( sk8 @ B @ A ) @ ( sk9 @ B @ A ) @ B )
| ( ( nota @ sk1 @ sk3 )
!= ( nota @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[18,39]) ).
thf(544,plain,
~ ( status @ ( sk8 @ sk3 @ sk1 ) @ ( sk9 @ sk3 @ sk1 ) @ sk3 ),
inference(pattern_uni,[status(thm)],[543:[bind(A,$thf( sk1 )),bind(B,$thf( sk3 ))]]) ).
thf(632,plain,
! [A: $i] :
( ( nota @ sk2 @ A )
| ( ( status @ ( sk8 @ sk3 @ sk1 ) @ ( sk9 @ sk3 @ sk1 ) @ A )
!= ( status @ ( sk8 @ sk3 @ sk1 ) @ ( sk9 @ sk3 @ sk1 ) @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[454,544]) ).
thf(633,plain,
nota @ sk2 @ sk3,
inference(pattern_uni,[status(thm)],[632:[bind(A,$thf( sk3 ))]]) ).
thf(17,plain,
~ ( nota @ sk2 @ sk3 ),
inference(cnf,[status(esa)],[16]) ).
thf(642,plain,
$false,
inference(rewrite,[status(thm)],[633,17]) ).
thf(643,plain,
$false,
inference(simp,[status(thm)],[642]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : KRS181+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.14/0.15 % Command : run_Leo-III %s %d
% 0.16/0.36 % Computer : n016.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 : Mon May 6 22:52:54 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.97/0.86 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.25/0.99 % [INFO] Parsing done (127ms).
% 1.25/0.99 % [INFO] Running in sequential loop mode.
% 1.74/1.22 % [INFO] nitpick registered as external prover.
% 1.74/1.22 % [INFO] Scanning for conjecture ...
% 1.89/1.28 % [INFO] Found a conjecture and 13 axioms. Running axiom selection ...
% 1.89/1.30 % [INFO] Axiom selection finished. Selected 13 axioms (removed 0 axioms).
% 2.08/1.33 % [INFO] Problem is first-order (TPTP FOF).
% 2.08/1.34 % [INFO] Type checking passed.
% 2.08/1.34 % [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 ...
% 8.06/2.70 % [INFO] Killing All external provers ...
% 8.06/2.70 % Time passed: 2170ms (effective reasoning time: 1700ms)
% 8.06/2.70 % 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)>
% 8.06/2.70 % Axioms used in derivation (2): nota, isa
% 8.06/2.70 % No. of inferences in proof: 35
% 8.06/2.70 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2170 ms resp. 1700 ms w/o parsing
% 8.13/2.74 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.13/2.74 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------