TSTP Solution File: SEV081^5 by Leo-III---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.15
% Problem : SEV081^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n022.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:09 EDT 2024
% Result : Theorem 2.85s 1.59s
% Output : Refutation 2.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 99 ( 54 equ; 32 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 178 ( 24 ~; 18 |; 9 &; 124 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 92 ( 92 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 0 ^ 33 !; 9 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
thf(sk1_type,type,
sk1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(sk2_type,type,
sk2: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(sk3_type,type,
sk3: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(sk4_type,type,
sk4: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(1,conjecture,
? [A: ( $i > $o ) > ( $i > $o ) > $o] :
( ? [B: $i > $o,C: $i > $o] : ( A @ B @ C )
& ! [B: $i > $o] : ( A @ B @ B )
& ! [B: $i > $o,C: $i > $o,D: $i > $o] :
( ( ( A @ B @ C )
& ( A @ C @ D ) )
=> ( A @ B @ D ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM120_1_pme) ).
thf(2,negated_conjecture,
~ ? [A: ( $i > $o ) > ( $i > $o ) > $o] :
( ? [B: $i > $o,C: $i > $o] : ( A @ B @ C )
& ! [B: $i > $o] : ( A @ B @ B )
& ! [B: $i > $o,C: $i > $o,D: $i > $o] :
( ( ( A @ B @ C )
& ( A @ C @ D ) )
=> ( A @ B @ D ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ? [A: ( $i > $o ) > ( $i > $o ) > $o] :
( ? [B: $i > $o,C: $i > $o] : ( A @ B @ C )
& ! [B: $i > $o] : ( A @ B @ B )
& ! [B: $i > $o,C: $i > $o,D: $i > $o] :
( ( ( A @ B @ C )
& ( A @ C @ D ) )
=> ( A @ B @ D ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
! [C: $i > $o,B: $i > $o,A: ( $i > $o ) > ( $i > $o ) > $o] :
( ~ ( A @ B @ C )
| ~ ( A @ ( sk1 @ A ) @ ( sk1 @ A ) )
| ( A @ ( sk3 @ A ) @ ( sk4 @ A ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(8,plain,
! [B: $i > $o,A: $i > $o] :
( ( A != B )
| ( ( sk1 @ ( (=) @ ( $i > $o ) ) )
!= ( sk1 @ ( (=) @ ( $i > $o ) ) ) )
| ( ( sk3 @ ( (=) @ ( $i > $o ) ) )
= ( sk4 @ ( (=) @ ( $i > $o ) ) ) ) ),
inference(replace_andrewseq,[status(thm)],[5:[bind(A,$thf( (=) @ ( $i > $o ) ))]]) ).
thf(14,plain,
! [B: $i > $o,A: $i > $o] :
( ( A != B )
| ( ( sk1 @ ( (=) @ ( $i > $o ) ) )
!= ( sk1 @ ( (=) @ ( $i > $o ) ) ) )
| ( ( sk4 @ ( (=) @ ( $i > $o ) ) )
= ( sk3 @ ( (=) @ ( $i > $o ) ) ) ) ),
inference(lifteq,[status(thm)],[8]) ).
thf(15,plain,
( ( sk4 @ ( (=) @ ( $i > $o ) ) )
= ( sk3 @ ( (=) @ ( $i > $o ) ) ) ),
inference(simp,[status(thm)],[14]) ).
thf(6,plain,
! [C: $i > $o,B: $i > $o,A: ( $i > $o ) > ( $i > $o ) > $o] :
( ~ ( A @ B @ C )
| ~ ( A @ ( sk1 @ A ) @ ( sk1 @ A ) )
| ( A @ ( sk2 @ A ) @ ( sk3 @ A ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(9,plain,
! [B: $i > $o,A: $i > $o] :
( ( A != B )
| ( ( sk1 @ ( (=) @ ( $i > $o ) ) )
!= ( sk1 @ ( (=) @ ( $i > $o ) ) ) )
| ( ( sk2 @ ( (=) @ ( $i > $o ) ) )
= ( sk3 @ ( (=) @ ( $i > $o ) ) ) ) ),
inference(replace_andrewseq,[status(thm)],[6:[bind(A,$thf( (=) @ ( $i > $o ) ))]]) ).
thf(10,plain,
! [B: $i > $o,A: $i > $o] :
( ( A != B )
| ( ( sk1 @ ( (=) @ ( $i > $o ) ) )
!= ( sk1 @ ( (=) @ ( $i > $o ) ) ) )
| ( ( sk3 @ ( (=) @ ( $i > $o ) ) )
= ( sk2 @ ( (=) @ ( $i > $o ) ) ) ) ),
inference(lifteq,[status(thm)],[9]) ).
thf(11,plain,
( ( sk3 @ ( (=) @ ( $i > $o ) ) )
= ( sk2 @ ( (=) @ ( $i > $o ) ) ) ),
inference(simp,[status(thm)],[10]) ).
thf(18,plain,
( ( sk4 @ ( (=) @ ( $i > $o ) ) )
= ( sk2 @ ( (=) @ ( $i > $o ) ) ) ),
inference(rewrite,[status(thm)],[15,11]) ).
thf(4,plain,
! [C: $i > $o,B: $i > $o,A: ( $i > $o ) > ( $i > $o ) > $o] :
( ~ ( A @ B @ C )
| ~ ( A @ ( sk1 @ A ) @ ( sk1 @ A ) )
| ~ ( A @ ( sk2 @ A ) @ ( sk4 @ A ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(7,plain,
! [B: $i > $o,A: $i > $o] :
( ( A != B )
| ( ( sk1 @ ( (=) @ ( $i > $o ) ) )
!= ( sk1 @ ( (=) @ ( $i > $o ) ) ) )
| ( ( sk2 @ ( (=) @ ( $i > $o ) ) )
!= ( sk4 @ ( (=) @ ( $i > $o ) ) ) ) ),
inference(replace_andrewseq,[status(thm)],[4:[bind(A,$thf( (=) @ ( $i > $o ) ))]]) ).
thf(12,plain,
! [B: $i > $o,A: $i > $o] :
( ( A != B )
| ( ( sk1 @ ( (=) @ ( $i > $o ) ) )
!= ( sk1 @ ( (=) @ ( $i > $o ) ) ) )
| ( ( sk4 @ ( (=) @ ( $i > $o ) ) )
!= ( sk2 @ ( (=) @ ( $i > $o ) ) ) ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(13,plain,
( ( sk4 @ ( (=) @ ( $i > $o ) ) )
!= ( sk2 @ ( (=) @ ( $i > $o ) ) ) ),
inference(simp,[status(thm)],[12]) ).
thf(19,plain,
$false,
inference(simplifyReflect,[status(thm)],[18,13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEV081^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.12 % Command : run_Leo-III %s %d THM
% 0.12/0.33 % Computer : n022.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 18:41:55 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.94/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.18/0.95 % [INFO] Parsing done (93ms).
% 1.18/0.96 % [INFO] Running in sequential loop mode.
% 1.64/1.15 % [INFO] eprover registered as external prover.
% 1.64/1.16 % [INFO] Scanning for conjecture ...
% 1.64/1.21 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.64/1.22 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.64/1.23 % [INFO] Problem is higher-order (TPTP THF).
% 1.64/1.23 % [INFO] Type checking passed.
% 1.64/1.23 % [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 ...
% 2.74/1.54 % [INFO] Killing All external provers ...
% 2.74/1.54 % Time passed: 1014ms (effective reasoning time: 578ms)
% 2.74/1.54 % 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)>
% 2.85/1.59 % Axioms used in derivation (0):
% 2.85/1.59 % No. of inferences in proof: 17
% 2.85/1.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1014 ms resp. 578 ms w/o parsing
% 2.85/1.65 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.85/1.65 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------