TSTP Solution File: SEV231^5 by Leo-III---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.15
% Problem : SEV231^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n001.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:34 EDT 2024
% Result : Theorem 3.71s 1.84s
% Output : Refutation 3.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 1
% Syntax : Number of formulae : 28 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 125 ( 38 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 136 ( 29 ~; 36 |; 7 &; 57 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 8 ^ 18 !; 0 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(y_type,type,
y: a > $o ).
thf(x_type,type,
x: a > $o ).
thf(sk1_type,type,
sk1: a ).
thf(sk2_type,type,
sk2: a > $o ).
thf(1,conjecture,
( ( ^ [A: a] :
( ( x @ A )
& ( y @ A ) ) )
= ( ^ [A: a] :
! [B: a > $o] :
( ( ( B = x )
| ( B = y ) )
=> ( B @ A ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX5201_pme) ).
thf(2,negated_conjecture,
( ( ^ [A: a] :
( ( x @ A )
& ( y @ A ) ) )
!= ( ^ [A: a] :
! [B: a > $o] :
( ( ( B = x )
| ( B = y ) )
=> ( B @ A ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ^ [A: a] :
( ( x @ A )
& ( y @ A ) ) )
!= ( ^ [A: a] :
! [B: a > $o] :
( ( ( B = x )
| ( B = y ) )
=> ( B @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ^ [A: a] :
( ( x @ A )
& ( y @ A ) ) )
!= ( ^ [A: a] :
! [B: a > $o] :
( ( ( B = x )
| ( B = y ) )
=> ( B @ A ) ) ) ),
inference(lifteq,[status(thm)],[3]) ).
thf(5,plain,
( ( ( x @ sk1 )
& ( y @ sk1 ) )
!= ( ! [A: a > $o] :
( ( ( A = x )
| ( A = y ) )
=> ( A @ sk1 ) ) ) ),
inference(func_ext,[status(esa)],[4]) ).
thf(6,plain,
( ~ ( ( x @ sk1 )
& ( y @ sk1 ) )
| ~ ! [A: a > $o] :
( ( ( A = x )
| ( A = y ) )
=> ( A @ sk1 ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(8,plain,
( ~ ( sk2 @ sk1 )
| ~ ( x @ sk1 )
| ~ ( y @ sk1 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(7,plain,
( ( ( x @ sk1 )
& ( y @ sk1 ) )
| ! [A: a > $o] :
( ( ( A = x )
| ( A = y ) )
=> ( A @ sk1 ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(11,plain,
! [A: a > $o] :
( ( A != x )
| ( A @ sk1 )
| ( x @ sk1 ) ),
inference(cnf,[status(esa)],[7]) ).
thf(15,plain,
! [A: a > $o] :
( ( A != x )
| ( A @ sk1 )
| ( x @ sk1 ) ),
inference(lifteq,[status(thm)],[11]) ).
thf(16,plain,
x @ sk1,
inference(simp,[status(thm)],[15]) ).
thf(14,plain,
! [A: a > $o] :
( ( A != y )
| ( A @ sk1 )
| ( y @ sk1 ) ),
inference(cnf,[status(esa)],[7]) ).
thf(21,plain,
! [A: a > $o] :
( ( A != y )
| ( A @ sk1 )
| ( y @ sk1 ) ),
inference(lifteq,[status(thm)],[14]) ).
thf(22,plain,
y @ sk1,
inference(simp,[status(thm)],[21]) ).
thf(25,plain,
( ~ ( sk2 @ sk1 )
| ~ $true
| ~ $true ),
inference(rewrite,[status(thm)],[8,16,22]) ).
thf(26,plain,
~ ( sk2 @ sk1 ),
inference(simp,[status(thm)],[25]) ).
thf(9,plain,
( ( sk2 = x )
| ( sk2 = y )
| ~ ( x @ sk1 )
| ~ ( y @ sk1 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(10,plain,
( ( sk2 = x )
| ( sk2 = y )
| ~ ( x @ sk1 )
| ~ ( y @ sk1 ) ),
inference(lifteq,[status(thm)],[9]) ).
thf(34,plain,
( ( sk2 = x )
| ( sk2 = y )
| ~ $true
| ~ $true ),
inference(rewrite,[status(thm)],[10,16,22]) ).
thf(35,plain,
( ( sk2 = x )
| ( sk2 = y ) ),
inference(simp,[status(thm)],[34]) ).
thf(36,plain,
! [B: a,A: a] :
( ( ( sk2 @ A )
= ( x @ A ) )
| ( ( sk2 @ B )
= ( y @ B ) ) ),
inference(func_ext,[status(esa)],[35]) ).
thf(45,plain,
! [B: a,A: a] :
( ( ( sk2 @ A )
= ( x @ A ) )
| ~ ( y @ B )
| ( ( sk2 @ B )
!= ( sk2 @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[36,26]) ).
thf(46,plain,
! [A: a] :
( ( ( sk2 @ A )
= ( x @ A ) )
| ~ ( y @ sk1 ) ),
inference(pattern_uni,[status(thm)],[45:[bind(A,$thf( A )),bind(B,$thf( sk1 ))]]) ).
thf(53,plain,
! [A: a] :
( ( ( sk2 @ A )
= ( x @ A ) )
| ~ $true ),
inference(rewrite,[status(thm)],[46,22]) ).
thf(54,plain,
! [A: a] :
( ( sk2 @ A )
= ( x @ A ) ),
inference(simp,[status(thm)],[53]) ).
thf(57,plain,
~ ( x @ sk1 ),
inference(rewrite,[status(thm)],[26,54]) ).
thf(60,plain,
~ $true,
inference(rewrite,[status(thm)],[57,16]) ).
thf(61,plain,
$false,
inference(simp,[status(thm)],[60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEV231^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.12 % Command : run_Leo-III %s %d THM
% 0.13/0.33 % Computer : n001.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 18:27:55 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.91/0.87 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.25/0.97 % [INFO] Parsing done (101ms).
% 1.30/0.98 % [INFO] Running in sequential loop mode.
% 1.65/1.19 % [INFO] eprover registered as external prover.
% 1.65/1.20 % [INFO] Scanning for conjecture ...
% 1.65/1.24 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.65/1.26 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.65/1.26 % [INFO] Problem is higher-order (TPTP THF).
% 1.65/1.27 % [INFO] Type checking passed.
% 1.65/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.71/1.83 % [INFO] Killing All external provers ...
% 3.71/1.84 % Time passed: 1308ms (effective reasoning time: 852ms)
% 3.71/1.84 % 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.71/1.84 % Axioms used in derivation (0):
% 3.71/1.84 % No. of inferences in proof: 28
% 3.71/1.84 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1308 ms resp. 852 ms w/o parsing
% 3.71/1.87 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.71/1.87 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------