TSTP Solution File: SEU932^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEU932^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% 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 : Tue May 21 03:44:16 EDT 2024
% Result : Theorem 5.36s 2.33s
% Output : Refutation 5.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 10 unt; 3 typ; 0 def)
% Number of atoms : 41 ( 40 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 97 ( 14 ~; 9 |; 6 &; 62 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 10 ^ 17 !; 9 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
thf(sk1_type,type,
sk1: $i > $i ).
thf(sk2_type,type,
sk2: $i > $i ).
thf(sk3_type,type,
sk3: $i ).
thf(1,conjecture,
! [A: $i > $i] :
( ? [B: $i > $i] :
( ( ( ^ [C: $i] : ( A @ ( B @ C ) ) )
= ( ^ [C: $i] : ( B @ ( A @ C ) ) ) )
& ? [C: $i] :
( ( ( B @ C )
= C )
& ! [D: $i] :
( ( ( B @ D )
= D )
=> ( D = C ) ) ) )
=> ? [B: $i] :
( ( A @ B )
= B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM141_pme) ).
thf(2,negated_conjecture,
~ ! [A: $i > $i] :
( ? [B: $i > $i] :
( ( ( ^ [C: $i] : ( A @ ( B @ C ) ) )
= ( ^ [C: $i] : ( B @ ( A @ C ) ) ) )
& ? [C: $i] :
( ( ( B @ C )
= C )
& ! [D: $i] :
( ( ( B @ D )
= D )
=> ( D = C ) ) ) )
=> ? [B: $i] :
( ( A @ B )
= B ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i > $i] :
( ? [B: $i > $i] :
( ( ( ^ [C: $i] : ( A @ ( B @ C ) ) )
= ( ^ [C: $i] : ( B @ ( A @ C ) ) ) )
& ? [C: $i] :
( ( ( B @ C )
= C )
& ! [D: $i] :
( ( ( B @ D )
= D )
=> ( D = C ) ) ) )
=> ? [B: $i] :
( ( A @ B )
= B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
( ( sk2 @ sk3 )
= sk3 ),
inference(cnf,[status(esa)],[3]) ).
thf(11,plain,
( ( sk2 @ sk3 )
= sk3 ),
inference(lifteq,[status(thm)],[6]) ).
thf(7,plain,
( ( ^ [A: $i] : ( sk1 @ ( sk2 @ A ) ) )
= ( ^ [A: $i] : ( sk2 @ ( sk1 @ A ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(12,plain,
( ( ^ [A: $i] : ( sk2 @ ( sk1 @ A ) ) )
= ( ^ [A: $i] : ( sk1 @ ( sk2 @ A ) ) ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(13,plain,
! [A: $i] :
( ( sk2 @ ( sk1 @ A ) )
= ( sk1 @ ( sk2 @ A ) ) ),
inference(func_ext,[status(esa)],[12]) ).
thf(5,plain,
! [A: $i] :
( ( ( sk2 @ A )
!= A )
| ( A = sk3 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(10,plain,
! [A: $i] :
( ( ( sk2 @ A )
!= A )
| ( A = sk3 ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(44,plain,
! [B: $i,A: $i] :
( ( ( sk1 @ ( sk2 @ A ) )
!= B )
| ( B = sk3 )
| ( ( sk2 @ ( sk1 @ A ) )
!= ( sk2 @ B ) ) ),
inference(paramod_ordered,[status(thm)],[13,10]) ).
thf(45,plain,
! [A: $i] :
( ( ( sk1 @ ( sk2 @ A ) )
!= ( sk1 @ A ) )
| ( ( sk1 @ A )
= sk3 ) ),
inference(pattern_uni,[status(thm)],[44:[bind(A,$thf( C )),bind(B,$thf( sk1 @ C ))]]) ).
thf(48,plain,
! [A: $i] :
( ( ( sk1 @ ( sk2 @ A ) )
!= ( sk1 @ A ) )
| ( ( sk1 @ A )
= sk3 ) ),
inference(simp,[status(thm)],[45]) ).
thf(388,plain,
! [A: $i] :
( ( ( sk1 @ sk3 )
!= ( sk1 @ A ) )
| ( ( sk1 @ A )
= sk3 )
| ( ( sk2 @ sk3 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[11,48]) ).
thf(389,plain,
( ( ( sk1 @ sk3 )
!= ( sk1 @ sk3 ) )
| ( ( sk1 @ sk3 )
= sk3 ) ),
inference(pattern_uni,[status(thm)],[388:[bind(A,$thf( sk3 ))]]) ).
thf(396,plain,
( ( sk1 @ sk3 )
= sk3 ),
inference(simp,[status(thm)],[389]) ).
thf(4,plain,
! [A: $i] :
( ( sk1 @ A )
!= A ),
inference(cnf,[status(esa)],[3]) ).
thf(8,plain,
! [A: $i] :
( ( sk1 @ A )
!= A ),
inference(lifteq,[status(thm)],[4]) ).
thf(9,plain,
! [A: $i] :
( ( sk1 @ A )
!= A ),
inference(simp,[status(thm)],[8]) ).
thf(398,plain,
$false,
inference(simplifyReflect,[status(thm)],[396,9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU932^5 : TPTP v8.2.0. Released v4.0.0.
% 0.15/0.16 % Command : run_Leo-III %s %d
% 0.15/0.37 % Computer : n025.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sun May 19 17:11:09 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.94/0.87 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.19/1.00 % [INFO] Parsing done (133ms).
% 1.19/1.01 % [INFO] Running in sequential loop mode.
% 1.57/1.26 % [INFO] nitpick registered as external prover.
% 1.57/1.26 % [INFO] Scanning for conjecture ...
% 1.65/1.32 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.80/1.35 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.80/1.35 % [INFO] Problem is higher-order (TPTP THF).
% 1.80/1.35 % [INFO] Type checking passed.
% 1.80/1.35 % [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 ...
% 5.36/2.32 % [INFO] Killing All external provers ...
% 5.36/2.33 % Time passed: 1797ms (effective reasoning time: 1311ms)
% 5.36/2.33 % 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)>
% 5.36/2.33 % Axioms used in derivation (0):
% 5.36/2.33 % No. of inferences in proof: 20
% 5.36/2.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1797 ms resp. 1311 ms w/o parsing
% 5.37/2.37 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.37/2.37 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------