TSTP Solution File: NUN067+1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : NUN067+1 : TPTP v8.2.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n009.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 02:16:38 EDT 2024
% Result : Theorem 29.54s 6.00s
% Output : Refutation 29.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 32 ( 9 unt; 7 typ; 0 def)
% Number of atoms : 59 ( 4 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 189 ( 33 ~; 18 |; 8 &; 130 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 1 con; 0-3 aty)
% Number of variables : 67 ( 0 ^ 56 !; 11 ?; 67 :)
% Comments :
%------------------------------------------------------------------------------
thf(id_type,type,
id: $i > $i > $o ).
thf(r1_type,type,
r1: $i > $o ).
thf(r2_type,type,
r2: $i > $i > $o ).
thf(r3_type,type,
r3: $i > $i > $i > $o ).
thf(sk1_type,type,
sk1: $i > $i ).
thf(sk16_type,type,
sk16: $i > $i > $i ).
thf(sk19_type,type,
sk19: $i > $i > $i ).
thf(1,conjecture,
? [A: $i] :
! [B: $i] :
( ~ ( id @ A @ B )
| ~ ( r1 @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nonzerosexistid) ).
thf(2,negated_conjecture,
~ ? [A: $i] :
! [B: $i] :
( ~ ( id @ A @ B )
| ~ ( r1 @ B ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(21,plain,
~ ? [A: $i] :
! [B: $i] :
( ~ ( id @ A @ B )
| ~ ( r1 @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(23,plain,
! [A: $i] : ( id @ A @ ( sk1 @ A ) ),
inference(cnf,[status(esa)],[21]) ).
thf(16,axiom,
! [A: $i,B: $i] :
( ~ ( id @ A @ B )
| ( id @ B @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
thf(81,plain,
! [A: $i,B: $i] :
( ~ ( id @ A @ B )
| ( id @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).
thf(82,plain,
! [B: $i,A: $i] :
( ~ ( id @ A @ B )
| ( id @ B @ A ) ),
inference(cnf,[status(esa)],[81]) ).
thf(1986,plain,
! [C: $i,B: $i,A: $i] :
( ( id @ C @ B )
| ( ( id @ A @ ( sk1 @ A ) )
!= ( id @ B @ C ) ) ),
inference(paramod_ordered,[status(thm)],[23,82]) ).
thf(1987,plain,
! [A: $i] : ( id @ ( sk1 @ A ) @ A ),
inference(pattern_uni,[status(thm)],[1986:[bind(A,$thf( D )),bind(B,$thf( D )),bind(C,$thf( sk1 @ D ))]]) ).
thf(2010,plain,
! [A: $i] : ( id @ ( sk1 @ A ) @ A ),
inference(simp,[status(thm)],[1987]) ).
thf(14,axiom,
! [A: $i,B: $i] :
? [C: $i] :
( ? [D: $i] :
( ( id @ D @ C )
& ? [E: $i] :
( ( r2 @ B @ E )
& ( r3 @ A @ E @ D ) ) )
& ? [D: $i] :
( ( r2 @ D @ C )
& ( r3 @ A @ B @ D ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1a) ).
thf(73,plain,
! [A: $i,B: $i] :
? [C: $i] :
( ? [D: $i] :
( ( id @ D @ C )
& ? [E: $i] :
( ( r2 @ B @ E )
& ( r3 @ A @ E @ D ) ) )
& ? [D: $i] :
( ( r2 @ D @ C )
& ( r3 @ A @ B @ D ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(75,plain,
! [B: $i,A: $i] : ( r2 @ ( sk19 @ B @ A ) @ ( sk16 @ B @ A ) ),
inference(cnf,[status(esa)],[73]) ).
thf(22,plain,
! [A: $i] : ( r1 @ ( sk1 @ A ) ),
inference(cnf,[status(esa)],[21]) ).
thf(9,axiom,
! [A: $i,B: $i] :
( ! [C: $i] :
( ~ ( id @ C @ B )
| ~ ( r1 @ C ) )
| ~ ( r2 @ A @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7a) ).
thf(50,plain,
! [A: $i,B: $i] :
( ! [C: $i] :
( ~ ( id @ C @ B )
| ~ ( r1 @ C ) )
| ~ ( r2 @ A @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(51,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( id @ C @ B )
| ~ ( r1 @ C )
| ~ ( r2 @ A @ B ) ),
inference(cnf,[status(esa)],[50]) ).
thf(108,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( id @ D @ C )
| ~ ( r2 @ B @ C )
| ( ( r1 @ ( sk1 @ A ) )
!= ( r1 @ D ) ) ),
inference(paramod_ordered,[status(thm)],[22,51]) ).
thf(109,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( id @ ( sk1 @ C ) @ B )
| ~ ( r2 @ A @ B ) ),
inference(pattern_uni,[status(thm)],[108:[bind(A,$thf( E )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( sk1 @ E ))]]) ).
thf(114,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( id @ ( sk1 @ C ) @ B )
| ~ ( r2 @ A @ B ) ),
inference(simp,[status(thm)],[109]) ).
thf(996,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( id @ ( sk1 @ E ) @ D )
| ( ( r2 @ ( sk19 @ B @ A ) @ ( sk16 @ B @ A ) )
!= ( r2 @ C @ D ) ) ),
inference(paramod_ordered,[status(thm)],[75,114]) ).
thf(997,plain,
! [C: $i,B: $i,A: $i] :
~ ( id @ ( sk1 @ A ) @ ( sk16 @ B @ C ) ),
inference(pattern_uni,[status(thm)],[996:[bind(A,$thf( I )),bind(B,$thf( H )),bind(C,$thf( sk19 @ H @ I )),bind(D,$thf( sk16 @ H @ I )),bind(E,$thf( E ))]]) ).
thf(1010,plain,
! [C: $i,B: $i,A: $i] :
~ ( id @ ( sk1 @ A ) @ ( sk16 @ B @ C ) ),
inference(simp,[status(thm)],[997]) ).
thf(2338,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( id @ ( sk1 @ A ) @ A )
!= ( id @ ( sk1 @ B ) @ ( sk16 @ C @ D ) ) ),
inference(paramod_ordered,[status(thm)],[2010,1010]) ).
thf(2339,plain,
$false,
inference(pattern_uni,[status(thm)],[2338:[bind(A,$thf( sk16 @ E @ F )),bind(B,$thf( sk16 @ E @ F )),bind(C,$thf( E )),bind(D,$thf( F ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : NUN067+1 : TPTP v8.2.0. Released v7.3.0.
% 0.08/0.12 % Command : run_Leo-III %s %d
% 0.11/0.32 % Computer : n009.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sat May 18 15:10:09 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.99/0.93 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.30/1.11 % [INFO] Parsing done (179ms).
% 1.41/1.12 % [INFO] Running in sequential loop mode.
% 1.92/1.49 % [INFO] nitpick registered as external prover.
% 1.92/1.50 % [INFO] Scanning for conjecture ...
% 2.18/1.59 % [INFO] Found a conjecture (or negated_conjecture) and 18 axioms. Running axiom selection ...
% 2.18/1.65 % [INFO] Axiom selection finished. Selected 18 axioms (removed 0 axioms).
% 2.47/1.71 % [INFO] Problem is first-order (TPTP FOF).
% 2.47/1.72 % [INFO] Type checking passed.
% 2.47/1.73 % [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 ...
% 29.54/5.99 % [INFO] Killing All external provers ...
% 29.54/6.00 % Time passed: 5531ms (effective reasoning time: 4863ms)
% 29.54/6.00 % 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)>
% 29.54/6.00 % Axioms used in derivation (3): axiom_6, axiom_1a, axiom_7a
% 29.54/6.00 % No. of inferences in proof: 25
% 29.54/6.00 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 5531 ms resp. 4863 ms w/o parsing
% 29.65/6.13 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 29.65/6.13 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------