TSTP Solution File: SEV288^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEV288^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n024.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 04:11:15 EDT 2024
% Result : Theorem 3.01s 1.66s
% Output : Refutation 3.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 19 unt; 5 typ; 0 def)
% Number of atoms : 44 ( 30 equ; 4 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 107 ( 31 ~; 19 |; 0 &; 46 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 17 ( 17 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 23 ( 8 ^ 15 !; 0 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(sk1_type,type,
sk1: a ).
thf(sk2_type,type,
sk2: a ).
thf(sk3_type,type,
sk3: a > $o ).
thf(sk4_type,type,
sk4: a > $o ).
thf(1,conjecture,
( ( ^ [A: a,B: a] :
! [C: a > $o] :
( ( C @ A )
=> ( C @ B ) ) )
= ( (=) @ a ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cE1_eq__pme) ).
thf(2,negated_conjecture,
( ( ^ [A: a,B: a] :
! [C: a > $o] :
( ( C @ A )
=> ( C @ B ) ) )
!= ( (=) @ a ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ^ [A: a,B: a] :
! [C: a > $o] :
( ( C @ A )
=> ( C @ B ) ) )
!= ( (=) @ a ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ^ [A: a,B: a] :
! [C: a > $o] :
( ( C @ A )
=> ( C @ B ) ) )
!= ( (=) @ a ) ),
inference(lifteq,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [A: a > $o] :
( ( A @ sk1 )
=> ( A @ sk2 ) ) )
!= ( sk1 = sk2 ) ),
inference(func_ext,[status(esa)],[4]) ).
thf(7,plain,
( ! [A: a > $o] :
( ( A @ sk1 )
=> ( A @ sk2 ) )
| ( sk1 = sk2 ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(9,plain,
( ( sk2 = sk1 )
| ! [A: a > $o] :
( ( A @ sk1 )
=> ( A @ sk2 ) ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(12,plain,
! [A: a > $o] :
( ~ ( A @ sk1 )
| ( A @ sk2 )
| ( sk2 = sk1 ) ),
inference(cnf,[status(esa)],[9]) ).
thf(6,plain,
( ~ ! [A: a > $o] :
( ( A @ sk1 )
=> ( A @ sk2 ) )
| ( sk1 != sk2 ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(8,plain,
( ( sk2 != sk1 )
| ~ ! [A: a > $o] :
( ( A @ sk1 )
=> ( A @ sk2 ) ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(11,plain,
( ( sk3 @ sk1 )
| ( sk2 != sk1 ) ),
inference(cnf,[status(esa)],[8]) ).
thf(10,plain,
( ~ ( sk3 @ sk2 )
| ( sk2 != sk1 ) ),
inference(cnf,[status(esa)],[8]) ).
thf(13,plain,
( ( sk2 != sk1 )
| ( ( sk3 @ sk2 )
!= ( sk3 @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[11,10]) ).
thf(14,plain,
( ( sk2 != sk1 )
| ( sk2 != sk1 ) ),
inference(simp,[status(thm)],[13]) ).
thf(15,plain,
sk2 != sk1,
inference(simp,[status(thm)],[14]) ).
thf(16,plain,
! [A: a > $o] :
( ~ ( A @ sk1 )
| ( A @ sk2 ) ),
inference(simplifyReflect,[status(thm)],[12,15]) ).
thf(19,plain,
! [A: a > $o] :
( ~ ( A @ sk1 )
| ~ ! [B: a > $o] :
( ( B @ sk1 )
=> ( B @ sk2 ) )
| ( ( A @ sk2 )
!= ( sk1 = sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[16,5]) ).
thf(32,plain,
( ( sk1 != sk1 )
| ~ ! [A: a > $o] :
( ( A @ sk1 )
=> ( A @ sk2 ) ) ),
inference(pre_uni,[status(thm)],[19:[bind(A,$thf( (=) @ a @ sk1 ))]]) ).
thf(34,plain,
( ( sk4 @ sk1 )
| ( sk1 != sk1 ) ),
inference(cnf,[status(esa)],[32]) ).
thf(37,plain,
( ( sk1 != sk1 )
| ( sk4 @ sk1 ) ),
inference(lifteq,[status(thm)],[34]) ).
thf(38,plain,
sk4 @ sk1,
inference(simp,[status(thm)],[37]) ).
thf(50,plain,
! [A: a > $o] :
( ( A @ sk2 )
| ( ( sk4 @ sk1 )
!= ( A @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[38,16]) ).
thf(52,plain,
sk4 @ sk2,
inference(pre_uni,[status(thm)],[50:[bind(A,$thf( sk4 ))]]) ).
thf(33,plain,
( ~ ( sk4 @ sk2 )
| ( sk1 != sk1 ) ),
inference(cnf,[status(esa)],[32]) ).
thf(35,plain,
( ( sk1 != sk1 )
| ~ ( sk4 @ sk2 ) ),
inference(lifteq,[status(thm)],[33]) ).
thf(36,plain,
~ ( sk4 @ sk2 ),
inference(simp,[status(thm)],[35]) ).
thf(58,plain,
$false,
inference(rewrite,[status(thm)],[52,36]) ).
thf(59,plain,
$false,
inference(simp,[status(thm)],[58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEV288^5 : TPTP v8.2.0. Released v4.0.0.
% 0.15/0.15 % Command : run_Leo-III %s %d
% 0.15/0.35 % Computer : n024.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.21/0.35 % CPULimit : 300
% 0.21/0.35 % WCLimit : 300
% 0.21/0.35 % DateTime : Sun May 19 18:30:09 EDT 2024
% 0.21/0.36 % CPUTime :
% 0.95/0.84 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.16/0.94 % [INFO] Parsing done (99ms).
% 1.16/0.95 % [INFO] Running in sequential loop mode.
% 1.45/1.15 % [INFO] nitpick registered as external prover.
% 1.60/1.16 % [INFO] Scanning for conjecture ...
% 1.71/1.20 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.71/1.22 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.71/1.22 % [INFO] Problem is higher-order (TPTP THF).
% 1.71/1.22 % [INFO] Type checking passed.
% 1.71/1.22 % [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.01/1.65 % [INFO] Killing All external provers ...
% 3.01/1.65 % Time passed: 1139ms (effective reasoning time: 698ms)
% 3.01/1.65 % 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.01/1.65 % Axioms used in derivation (0):
% 3.01/1.65 % No. of inferences in proof: 28
% 3.01/1.66 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1139 ms resp. 698 ms w/o parsing
% 3.01/1.70 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.01/1.70 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------