TSTP Solution File: SEU917^5 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : SEU917^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n016.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:40:26 EDT 2024
% Result : Theorem 4.34s 2.68s
% Output : Refutation 4.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 6 unt; 2 typ; 0 def)
% Number of atoms : 14 ( 13 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 37 ( 7 ~; 1 |; 0 &; 26 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 17 ( 2 ^ 12 !; 3 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
thf(sk1_type,type,
sk1: ( $i > $i ) > $i ).
thf(sk2_type,type,
sk2: ( $i > $i ) > $i ).
thf(1,conjecture,
? [A: $i > $i] :
! [B: $i,C: $i] :
( ( ( A @ B )
= ( A @ C ) )
=> ( B = C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM8_pme) ).
thf(2,negated_conjecture,
~ ? [A: $i > $i] :
! [B: $i,C: $i] :
( ( ( A @ B )
= ( A @ C ) )
=> ( B = C ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ? [A: $i > $i] :
! [B: $i,C: $i] :
( ( ( A @ B )
= ( A @ C ) )
=> ( B = C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
! [A: $i > $i] :
( ( A @ ( sk1 @ A ) )
= ( A @ ( sk2 @ A ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(7,plain,
! [A: $i > $i] :
( ( A @ ( sk2 @ A ) )
= ( A @ ( sk1 @ A ) ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(4,plain,
! [A: $i > $i] :
( ( sk1 @ A )
!= ( sk2 @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(6,plain,
! [A: $i > $i] :
( ( sk2 @ A )
!= ( sk1 @ A ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(8,plain,
! [B: $i > $i,A: $i > $i] :
( ( ( A @ ( sk1 @ A ) )
!= ( sk1 @ B ) )
| ( ( A @ ( sk2 @ A ) )
!= ( sk2 @ B ) ) ),
inference(paramod_ordered,[status(thm)],[7,6]) ).
thf(11,plain,
( ( sk1
@ ^ [A: $i] : A )
!= ( sk1
@ ^ [A: $i] : A ) ),
inference(pre_uni,[status(thm)],[8:[bind(A,$thf( ^ [C: $i] : C )),bind(B,$thf( ^ [C: $i] : C ))]]) ).
thf(12,plain,
$false,
inference(pattern_uni,[status(thm)],[11:[]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU917^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.14 % Command : run_Leo-III %s %d
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 15:53:24 EDT 2024
% 0.13/0.36 % CPUTime :
% 1.23/1.15 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.55/1.32 % [INFO] Parsing done (169ms).
% 1.55/1.34 % [INFO] Running in sequential loop mode.
% 2.26/1.78 % [INFO] eprover registered as external prover.
% 2.26/1.79 % [INFO] cvc4 registered as external prover.
% 2.26/1.79 % [INFO] Scanning for conjecture ...
% 2.50/1.89 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.50/1.92 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.50/1.92 % [INFO] Problem is higher-order (TPTP THF).
% 2.50/1.93 % [INFO] Type checking passed.
% 2.50/1.93 % [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 ...
% 4.34/2.67 % [INFO] Killing All external provers ...
% 4.34/2.67 % Time passed: 2130ms (effective reasoning time: 1327ms)
% 4.34/2.67 % 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)>
% 4.34/2.68 % Axioms used in derivation (0):
% 4.34/2.68 % No. of inferences in proof: 10
% 4.34/2.68 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2130 ms resp. 1327 ms w/o parsing
% 4.34/2.72 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.34/2.72 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------