TSTP Solution File: SEU937^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEU937^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% 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 : Tue May 21 03:44:17 EDT 2024
% Result : Theorem 2.95s 1.95s
% Output : Refutation 2.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 28 ( 9 unt; 8 typ; 0 def)
% Number of atoms : 44 ( 43 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 102 ( 16 ~; 9 |; 3 &; 62 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 3 ( 3 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 0 ^ 39 !; 0 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
thf(b_type,type,
b: $tType ).
thf(a_type,type,
a: $tType ).
thf(c_type,type,
c: $tType ).
thf(sk1_type,type,
sk1: b > a ).
thf(sk2_type,type,
sk2: c > b ).
thf(sk3_type,type,
sk3: c ).
thf(sk4_type,type,
sk4: c ).
thf(sk6_type,type,
sk6: a > b ).
thf(1,conjecture,
! [A: b > a,B: c > b] :
( ( ! [C: b,D: b] :
( ( ( A @ C )
= ( A @ D ) )
=> ( C = D ) )
& ! [C: c,D: c] :
( ( ( B @ C )
= ( B @ D ) )
=> ( C = D ) ) )
=> ! [C: c,D: c] :
( ( ( A @ ( B @ C ) )
= ( A @ ( B @ D ) ) )
=> ( C = D ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM48_pme) ).
thf(2,negated_conjecture,
~ ! [A: b > a,B: c > b] :
( ( ! [C: b,D: b] :
( ( ( A @ C )
= ( A @ D ) )
=> ( C = D ) )
& ! [C: c,D: c] :
( ( ( B @ C )
= ( B @ D ) )
=> ( C = D ) ) )
=> ! [C: c,D: c] :
( ( ( A @ ( B @ C ) )
= ( A @ ( B @ D ) ) )
=> ( C = D ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: b > a,B: c > b] :
( ( ! [C: b,D: b] :
( ( ( A @ C )
= ( A @ D ) )
=> ( C = D ) )
& ! [C: c,D: c] :
( ( ( B @ C )
= ( B @ D ) )
=> ( C = D ) ) )
=> ! [C: c,D: c] :
( ( ( A @ ( B @ C ) )
= ( A @ ( B @ D ) ) )
=> ( C = D ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
( ( sk1 @ ( sk2 @ sk3 ) )
= ( sk1 @ ( sk2 @ sk4 ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(9,plain,
( ( sk1 @ ( sk2 @ sk4 ) )
= ( sk1 @ ( sk2 @ sk3 ) ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(7,plain,
! [B: b,A: b] :
( ( ( sk1 @ A )
!= ( sk1 @ B ) )
| ( A = B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(13,plain,
! [B: b,A: b] :
( ( ( sk1 @ A )
!= ( sk1 @ B ) )
| ( A = B ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(14,plain,
! [A: b] :
( ( sk6 @ ( sk1 @ A ) )
= A ),
introduced(tautology,[new_symbols(inverse(sk1),[sk6])]) ).
thf(15,plain,
! [A: b] :
( ( ( sk6 @ ( sk1 @ ( sk2 @ sk3 ) ) )
= A )
| ( ( sk1 @ ( sk2 @ sk4 ) )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[9,14]) ).
thf(16,plain,
( ( sk6 @ ( sk1 @ ( sk2 @ sk3 ) ) )
= ( sk2 @ sk4 ) ),
inference(pattern_uni,[status(thm)],[15:[bind(A,$thf( sk2 @ sk4 ))]]) ).
thf(42,plain,
( ( sk2 @ sk4 )
= ( sk2 @ sk3 ) ),
inference(rewrite,[status(thm)],[16,14]) ).
thf(6,plain,
! [B: c,A: c] :
( ( ( sk2 @ A )
!= ( sk2 @ B ) )
| ( A = B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(10,plain,
! [B: c,A: c] :
( ( ( sk2 @ A )
!= ( sk2 @ B ) )
| ( A = B ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(11,plain,
! [B: c,A: c] :
( ( ( sk2 @ A )
!= ( sk2 @ B ) )
| ( A = B ) ),
inference(simp,[status(thm)],[10]) ).
thf(4,plain,
sk3 != sk4,
inference(cnf,[status(esa)],[3]) ).
thf(8,plain,
sk4 != sk3,
inference(lifteq,[status(thm)],[4]) ).
thf(27,plain,
! [B: c,A: c] :
( ( ( sk2 @ A )
!= ( sk2 @ B ) )
| ( B != sk3 )
| ( A != sk4 ) ),
inference(paramod_ordered,[status(thm)],[11,8]) ).
thf(28,plain,
! [A: c] :
( ( ( sk2 @ sk4 )
!= ( sk2 @ A ) )
| ( A != sk3 ) ),
inference(pattern_uni,[status(thm)],[27:[bind(A,$thf( sk4 ))]]) ).
thf(34,plain,
( ( sk2 @ sk4 )
!= ( sk2 @ sk3 ) ),
inference(simp,[status(thm)],[28]) ).
thf(43,plain,
$false,
inference(simplifyReflect,[status(thm)],[42,34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SEU937^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.11 % Command : run_Leo-III %s %d
% 0.10/0.31 % Computer : n020.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 17:09:54 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.94/0.91 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.18/1.06 % [INFO] Parsing done (148ms).
% 1.18/1.07 % [INFO] Running in sequential loop mode.
% 1.67/1.38 % [INFO] nitpick registered as external prover.
% 1.67/1.38 % [INFO] Scanning for conjecture ...
% 1.88/1.44 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.88/1.47 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.88/1.47 % [INFO] Problem is higher-order (TPTP THF).
% 1.88/1.47 % [INFO] Type checking passed.
% 1.88/1.48 % [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 ...
% 2.76/1.95 % [INFO] Killing All external provers ...
% 2.95/1.95 % Time passed: 1514ms (effective reasoning time: 872ms)
% 2.95/1.95 % 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)>
% 2.95/1.95 % Axioms used in derivation (0):
% 2.95/1.95 % No. of inferences in proof: 20
% 2.95/1.95 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1514 ms resp. 872 ms w/o parsing
% 2.95/1.99 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.95/1.99 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------