TSTP Solution File: SEV088^5 by Leo-III---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.15
% Problem : SEV088^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n025.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 : Mon Jun 24 15:58:11 EDT 2024
% Result : Theorem 9.07s 3.66s
% Output : Refutation 9.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 24 ( 1 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 141 ( 10 ~; 16 |; 6 &; 106 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 104 ( 104 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 7 con; 0-2 aty)
% Number of variables : 58 ( 18 ^ 34 !; 6 ?; 58 :)
% Comments :
%------------------------------------------------------------------------------
thf(sk1_type,type,
sk1: ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > $o ).
thf(1,conjecture,
? [A: ( $i > $o ) > ( $i > $o ) > $i > $o,B: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ! [C: $i > $o,D: $i > $o,E: $i > $o] :
( ( ! [F: $i] :
( ( B @ C @ D @ F )
| ( A @ C @ D @ F ) )
& ! [F: $i] :
( ( B @ D @ E @ F )
| ( A @ D @ E @ F ) ) )
=> ! [F: $i] :
( ( B @ C @ E @ F )
| ( A @ C @ E @ F ) ) )
& ! [C: $i > $o,D: $i] :
( ( B @ C @ C @ D )
| ( A @ C @ C @ D ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM120G_pme) ).
thf(2,negated_conjecture,
~ ? [A: ( $i > $o ) > ( $i > $o ) > $i > $o,B: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ! [C: $i > $o,D: $i > $o,E: $i > $o] :
( ( ! [F: $i] :
( ( B @ C @ D @ F )
| ( A @ C @ D @ F ) )
& ! [F: $i] :
( ( B @ D @ E @ F )
| ( A @ D @ E @ F ) ) )
=> ! [F: $i] :
( ( B @ C @ E @ F )
| ( A @ C @ E @ F ) ) )
& ! [C: $i > $o,D: $i] :
( ( B @ C @ C @ D )
| ( A @ C @ C @ D ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ? [A: ( $i > $o ) > ( $i > $o ) > $i > $o,B: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ! [C: $i > $o,D: $i > $o,E: $i > $o] :
( ( ! [F: $i] :
( ( B @ C @ D @ F )
| ( A @ C @ D @ F ) )
& ! [F: $i] :
( ( B @ D @ E @ F )
| ( A @ D @ E @ F ) ) )
=> ! [F: $i] :
( ( B @ C @ E @ F )
| ( A @ C @ E @ F ) ) )
& ! [C: $i > $o,D: $i] :
( ( B @ C @ C @ D )
| ( A @ C @ C @ D ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
! [B: ( $i > $o ) > ( $i > $o ) > $i > $o,A: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ( sk1 @ B @ A )
| ~ ( B @ ( sk6 @ B @ A ) @ ( sk6 @ B @ A ) @ ( sk7 @ B @ A ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(42,plain,
! [A: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ( sk1
@ ^ [B: $i > $o,C: $i > $o,D: $i] : $true
@ A )
| ~ $true ),
inference(prim_subst,[status(thm)],[5:[bind(A,$thf( A )),bind(B,$thf( ^ [C: $i > $o] : ^ [D: $i > $o] : ^ [E: $i] : $true ))]]) ).
thf(55,plain,
! [A: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( sk1
@ ^ [B: $i > $o,C: $i > $o,D: $i] : $true
@ A ),
inference(simp,[status(thm)],[42]) ).
thf(4,plain,
! [B: ( $i > $o ) > ( $i > $o ) > $i > $o,A: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ~ ( A @ ( sk2 @ B @ A ) @ ( sk4 @ B @ A ) @ ( sk5 @ B @ A ) )
| ~ ( sk1 @ B @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(19,plain,
! [A: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ~ $true
| ~ ( sk1 @ A
@ ^ [B: $i > $o,C: $i > $o,D: $i] : $true ) ),
inference(prim_subst,[status(thm)],[4:[bind(A,$thf( ^ [C: $i > $o] : ^ [D: $i > $o] : ^ [E: $i] : $true ))]]) ).
thf(28,plain,
! [A: ( $i > $o ) > ( $i > $o ) > $i > $o] :
~ ( sk1 @ A
@ ^ [B: $i > $o,C: $i > $o,D: $i] : $true ),
inference(simp,[status(thm)],[19]) ).
thf(72,plain,
! [B: ( $i > $o ) > ( $i > $o ) > $i > $o,A: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ( sk1
@ ^ [C: $i > $o,D: $i > $o,E: $i] : $true
@ A )
!= ( sk1 @ B
@ ^ [C: $i > $o,D: $i > $o,E: $i] : $true ) ),
inference(paramod_ordered,[status(thm)],[55,28]) ).
thf(73,plain,
$false,
inference(pattern_uni,[status(thm)],[72:[bind(A,$thf( ^ [C: $i > $o] : ^ [D: $i > $o] : ^ [E: $i] : $true )),bind(B,$thf( ^ [C: $i > $o] : ^ [D: $i > $o] : ^ [E: $i] : $true ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV088^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.12 % Command : run_Leo-III %s %d THM
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jun 21 19:38:40 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.84/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.17/0.95 % [INFO] Parsing done (93ms).
% 1.17/0.96 % [INFO] Running in sequential loop mode.
% 1.45/1.15 % [INFO] eprover registered as external prover.
% 1.45/1.15 % [INFO] Scanning for conjecture ...
% 1.74/1.21 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.83/1.23 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.83/1.23 % [INFO] Problem is higher-order (TPTP THF).
% 1.83/1.24 % [INFO] Type checking passed.
% 1.83/1.24 % [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 ...
% 9.07/3.66 % [INFO] Killing All external provers ...
% 9.07/3.66 % Time passed: 3130ms (effective reasoning time: 2694ms)
% 9.07/3.66 % 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)>
% 9.07/3.66 % Axioms used in derivation (0):
% 9.07/3.66 % No. of inferences in proof: 11
% 9.07/3.66 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 3130 ms resp. 2694 ms w/o parsing
% 9.38/3.68 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 9.38/3.69 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------