TSTP Solution File: SEV239^5 by Leo-III---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.15
% Problem : SEV239^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n020.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:35 EDT 2024
% Result : Theorem 3.91s 1.85s
% Output : Refutation 3.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 1
% Syntax : Number of formulae : 30 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 91 ( 42 equ; 13 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 137 ( 29 ~; 23 |; 14 &; 71 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 4 usr; 5 con; 0-2 aty)
% Number of variables : 26 ( 4 ^ 8 !; 14 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(y_type,type,
y: a > $o ).
thf(sk1_type,type,
sk1: a ).
thf(sk2_type,type,
sk2: a > $o ).
thf(sk3_type,type,
sk3: a ).
thf(1,conjecture,
( y
= ( ^ [A: a] :
? [B: a > $o] :
( ? [C: a] :
( ( y @ C )
& ( B
= ( (=) @ a @ C ) ) )
& ( B @ A ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX5211_pme) ).
thf(2,negated_conjecture,
( y
!= ( ^ [A: a] :
? [B: a > $o] :
( ? [C: a] :
( ( y @ C )
& ( B
= ( (=) @ a @ C ) ) )
& ( B @ A ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( y
!= ( ^ [A: a] :
? [B: a > $o] :
( ? [C: a] :
( ( y @ C )
& ( B
= ( (=) @ a @ C ) ) )
& ( B @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( y
!= ( ^ [A: a] :
? [B: a > $o] :
( ? [C: a] :
( ( y @ C )
& ( B
= ( (=) @ a @ C ) ) )
& ( B @ A ) ) ) ),
inference(lifteq,[status(thm)],[3]) ).
thf(5,plain,
( ( y @ sk1 )
!= ( ? [A: a > $o] :
( ? [B: a] :
( ( y @ B )
& ( A
= ( (=) @ a @ B ) ) )
& ( A @ sk1 ) ) ) ),
inference(func_ext,[status(esa)],[4]) ).
thf(7,plain,
( ( y @ sk1 )
| ? [A: a > $o] :
( ? [B: a] :
( ( y @ B )
& ( A
= ( (=) @ a @ B ) ) )
& ( A @ sk1 ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(11,plain,
( ( sk2 @ sk1 )
| ( y @ sk1 ) ),
inference(cnf,[status(esa)],[7]) ).
thf(6,plain,
( ~ ( y @ sk1 )
| ~ ? [A: a > $o] :
( ? [B: a] :
( ( y @ B )
& ( A
= ( (=) @ a @ B ) ) )
& ( A @ sk1 ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(8,plain,
! [B: a,A: a > $o] :
( ~ ( y @ B )
| ( A
!= ( (=) @ a @ B ) )
| ~ ( A @ sk1 )
| ~ ( y @ sk1 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(9,plain,
! [B: a,A: a > $o] :
( ( A
!= ( (=) @ a @ B ) )
| ~ ( y @ B )
| ~ ( A @ sk1 )
| ~ ( y @ sk1 ) ),
inference(lifteq,[status(thm)],[8]) ).
thf(10,plain,
! [A: a] :
( ~ ( y @ A )
| ( A != sk1 )
| ~ ( y @ sk1 ) ),
inference(simp,[status(thm)],[9]) ).
thf(23,plain,
! [A: a] :
( ( A != sk1 )
| ~ ( y @ A )
| ~ ( y @ sk1 ) ),
inference(lifteq,[status(thm)],[10]) ).
thf(29,plain,
! [A: a] :
( ( A != sk1 )
| ~ ( y @ A )
| ( ( y @ sk1 )
!= ( y @ A ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[23]) ).
thf(30,plain,
( ( sk1 != sk1 )
| ~ ( y @ sk1 ) ),
inference(pattern_uni,[status(thm)],[29:[bind(A,$thf( sk1 ))]]) ).
thf(31,plain,
~ ( y @ sk1 ),
inference(pattern_uni,[status(thm)],[30:[]]) ).
thf(37,plain,
( ( sk2 @ sk1 )
| $false ),
inference(rewrite,[status(thm)],[11,31]) ).
thf(38,plain,
sk2 @ sk1,
inference(simp,[status(thm)],[37]) ).
thf(12,plain,
( ( sk2
= ( (=) @ a @ sk3 ) )
| ( y @ sk1 ) ),
inference(cnf,[status(esa)],[7]) ).
thf(14,plain,
( ( sk2
= ( (=) @ a @ sk3 ) )
| ( y @ sk1 ) ),
inference(lifteq,[status(thm)],[12]) ).
thf(47,plain,
( ( sk2
= ( (=) @ a @ sk3 ) )
| $false ),
inference(rewrite,[status(thm)],[14,31]) ).
thf(48,plain,
( sk2
= ( (=) @ a @ sk3 ) ),
inference(simp,[status(thm)],[47]) ).
thf(49,plain,
! [A: a] :
( ( sk2 @ A )
= ( sk3 = A ) ),
inference(func_ext,[status(esa)],[48]) ).
thf(62,plain,
sk3 = sk1,
inference(rewrite,[status(thm)],[38,49]) ).
thf(67,plain,
sk3 = sk1,
inference(lifteq,[status(thm)],[62]) ).
thf(13,plain,
( ( y @ sk3 )
| ( y @ sk1 ) ),
inference(cnf,[status(esa)],[7]) ).
thf(39,plain,
( ( y @ sk3 )
| $false ),
inference(rewrite,[status(thm)],[13,31]) ).
thf(40,plain,
y @ sk3,
inference(simp,[status(thm)],[39]) ).
thf(50,plain,
( ( y @ sk3 )
!= ( y @ sk1 ) ),
inference(paramod_ordered,[status(thm)],[40,31]) ).
thf(51,plain,
sk3 != sk1,
inference(simp,[status(thm)],[50]) ).
thf(71,plain,
$false,
inference(simplifyReflect,[status(thm)],[67,51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEV239^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.12 % Command : run_Leo-III %s %d THM
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Jun 21 19:12:55 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.96/0.88 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.21/0.99 % [INFO] Parsing done (103ms).
% 1.21/0.99 % [INFO] Running in sequential loop mode.
% 1.61/1.19 % [INFO] eprover registered as external prover.
% 1.61/1.19 % [INFO] Scanning for conjecture ...
% 1.74/1.24 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.78/1.26 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.78/1.26 % [INFO] Problem is higher-order (TPTP THF).
% 1.78/1.26 % [INFO] Type checking passed.
% 1.78/1.27 % [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 ...
% 3.91/1.85 % [INFO] Killing All external provers ...
% 3.91/1.85 % Time passed: 1302ms (effective reasoning time: 850ms)
% 3.91/1.85 % 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)>
% 3.91/1.85 % Axioms used in derivation (0):
% 3.91/1.85 % No. of inferences in proof: 30
% 3.91/1.85 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1302 ms resp. 850 ms w/o parsing
% 3.91/1.88 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.91/1.88 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------