TSTP Solution File: SEV057^5 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV057^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n032.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:59:25 EDT 2024
% Result : Theorem 11.98s 2.96s
% Output : Refutation 12.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 1
% Syntax : Number of formulae : 23 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 65 ( 27 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 199 ( 33 ~; 32 |; 12 &; 113 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 17 ( 17 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 61 ( 27 ^ 28 !; 6 ?; 61 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(sk1_type,type,
sk1: a > $o ).
thf(sk2_type,type,
sk2: ( a > a ) > $o ).
thf(sk3_type,type,
sk3: ( a > a ) > a ).
thf(sk4_type,type,
sk4: ( a > a ) > a ).
thf(sk5_type,type,
sk5: a > ( a > a ) > a ).
thf(1,conjecture,
! [A: a > $o] :
? [B: a > a] :
( ! [C: a] :
( ( A @ C )
=> ( A @ ( B @ C ) ) )
& ! [C: a] :
( ( A @ C )
=> ? [D: a] :
( ( A @ D )
& ( C
= ( B @ D ) )
& ! [E: a] :
( ( ( A @ E )
& ( C
= ( B @ E ) ) )
=> ( E = D ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cEQP1_1A_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > $o] :
? [B: a > a] :
( ! [C: a] :
( ( A @ C )
=> ( A @ ( B @ C ) ) )
& ! [C: a] :
( ( A @ C )
=> ? [D: a] :
( ( A @ D )
& ( C
= ( B @ D ) )
& ! [E: a] :
( ( ( A @ E )
& ( C
= ( B @ E ) ) )
=> ( E = D ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > $o] :
? [B: a > a] :
( ! [C: a] :
( ( A @ C )
=> ( A @ ( B @ C ) ) )
& ! [C: a] :
( ( A @ C )
=> ? [D: a] :
( ( A @ D )
& ( C
= ( B @ D ) )
& ! [E: a] :
( ( ( A @ E )
& ( C
= ( B @ E ) ) )
=> ( E = D ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
! [B: a,A: a > a] :
( ( sk2 @ A )
| ~ ( sk1 @ B )
| ( ( sk4 @ A )
!= ( A @ B ) )
| ( ( sk4 @ A )
= ( A @ ( sk5 @ B @ A ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(10,plain,
! [B: a,A: a > a] :
( ( ( sk4 @ A )
!= ( A @ B ) )
| ( ( A @ ( sk5 @ B @ A ) )
= ( sk4 @ A ) )
| ( sk2 @ A )
| ~ ( sk1 @ B ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(48,plain,
( ~ ( sk1
@ ( sk4
@ ^ [A: a] : A ) )
| ( sk2
@ ^ [A: a] : A )
| ( ( sk5
@ ( sk4
@ ^ [A: a] : A )
@ ^ [A: a] : A )
= ( sk4
@ ^ [A: a] : A ) ) ),
inference(pre_uni,[status(thm)],[10:[bind(A,$thf( ^ [C: a] : C )),bind(B,$thf( sk4 @ ^ [C: a] : C ))]]) ).
thf(5,plain,
! [A: a > a] :
( ( sk2 @ A )
| ( sk1 @ ( sk4 @ A ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(8,plain,
! [A: a > a] :
( ( sk1 @ ( sk3 @ A ) )
| ~ ( sk2 @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(4,plain,
! [A: a > a] :
( ~ ( sk1 @ ( A @ ( sk3 @ A ) ) )
| ~ ( sk2 @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(21,plain,
! [B: a > a,A: a > a] :
( ~ ( sk2 @ A )
| ~ ( sk2 @ B )
| ( ( sk1 @ ( sk3 @ A ) )
!= ( sk1 @ ( B @ ( sk3 @ B ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[8,4]) ).
thf(25,plain,
( ~ ( sk2
@ ^ [A: a] : A )
| ~ ( sk2
@ ^ [A: a] : A ) ),
inference(pre_uni,[status(thm)],[21:[bind(A,$thf( ^ [C: a] : C )),bind(B,$thf( ^ [C: a] : C ))]]) ).
thf(29,plain,
~ ( sk2
@ ^ [A: a] : A ),
inference(simp,[status(thm)],[25]) ).
thf(31,plain,
! [A: a > a] :
( ( sk1 @ ( sk4 @ A ) )
| ( ( sk2 @ A )
!= ( sk2
@ ^ [B: a] : B ) ) ),
inference(paramod_ordered,[status(thm)],[5,29]) ).
thf(32,plain,
( sk1
@ ( sk4
@ ^ [A: a] : A ) ),
inference(pattern_uni,[status(thm)],[31:[bind(A,$thf( ^ [B: a] : B ))]]) ).
thf(213,plain,
( ~ $true
| $false
| ( ( sk5
@ ( sk4
@ ^ [A: a] : A )
@ ^ [A: a] : A )
= ( sk4
@ ^ [A: a] : A ) ) ),
inference(rewrite,[status(thm)],[48,32,29]) ).
thf(214,plain,
( ( sk5
@ ( sk4
@ ^ [A: a] : A )
@ ^ [A: a] : A )
= ( sk4
@ ^ [A: a] : A ) ),
inference(simp,[status(thm)],[213]) ).
thf(9,plain,
! [B: a,A: a > a] :
( ( sk2 @ A )
| ~ ( sk1 @ B )
| ( ( sk4 @ A )
!= ( A @ B ) )
| ( ( sk5 @ B @ A )
!= B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(11,plain,
! [B: a,A: a > a] :
( ( ( sk4 @ A )
!= ( A @ B ) )
| ( ( sk5 @ B @ A )
!= B )
| ( sk2 @ A )
| ~ ( sk1 @ B ) ),
inference(lifteq,[status(thm)],[9]) ).
thf(274,plain,
! [B: a,A: a > a] :
( ( ( sk4 @ A )
!= ( A @ B ) )
| ( ( sk4
@ ^ [C: a] : C )
!= B )
| ( sk2 @ A )
| ~ ( sk1 @ B )
| ( ( sk5
@ ( sk4
@ ^ [C: a] : C )
@ ^ [C: a] : C )
!= ( sk5 @ B @ A ) ) ),
inference(paramod_ordered,[status(thm)],[214,11]) ).
thf(275,plain,
( ( ( sk4
@ ^ [A: a] : A )
!= ( sk4
@ ^ [A: a] : A ) )
| ( ( sk4
@ ^ [A: a] : A )
!= ( sk4
@ ^ [A: a] : A ) )
| ( sk2
@ ^ [A: a] : A )
| ~ ( sk1
@ ( sk4
@ ^ [A: a] : A ) ) ),
inference(pattern_uni,[status(thm)],[274:[bind(A,$thf( ^ [C: a] : C )),bind(B,$thf( sk4 @ ^ [C: a] : C ))]]) ).
thf(290,plain,
( ( sk2
@ ^ [A: a] : A )
| ~ ( sk1
@ ( sk4
@ ^ [A: a] : A ) ) ),
inference(simp,[status(thm)],[275]) ).
thf(705,plain,
( $false
| ~ $true ),
inference(rewrite,[status(thm)],[290,32,29]) ).
thf(706,plain,
$false,
inference(simp,[status(thm)],[705]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEV057^5 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.09 % Command : run_Leo-III %s %d SAT
% 0.09/0.27 % Computer : n032.cluster.edu
% 0.09/0.27 % Model : x86_64 x86_64
% 0.09/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.27 % Memory : 8042.1875MB
% 0.09/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.27 % CPULimit : 300
% 0.09/0.27 % WCLimit : 300
% 0.09/0.27 % DateTime : Fri Jun 21 18:58:25 EDT 2024
% 0.09/0.27 % CPUTime :
% 0.78/0.73 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.90/0.83 % [INFO] Parsing done (97ms).
% 0.90/0.84 % [INFO] Running in sequential loop mode.
% 1.32/1.04 % [INFO] nitpick registered as external prover.
% 1.32/1.05 % [INFO] Scanning for conjecture ...
% 1.50/1.10 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.50/1.13 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.50/1.13 % [INFO] Problem is higher-order (TPTP THF).
% 1.50/1.13 % [INFO] Type checking passed.
% 1.50/1.13 % [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 ...
% 11.98/2.96 % [INFO] Killing All external provers ...
% 11.98/2.96 % Time passed: 2549ms (effective reasoning time: 2116ms)
% 11.98/2.96 % 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)>
% 11.98/2.96 % Axioms used in derivation (0):
% 11.98/2.96 % No. of inferences in proof: 23
% 11.98/2.96 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2549 ms resp. 2116 ms w/o parsing
% 12.01/3.00 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 12.01/3.00 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------