TSTP Solution File: SEV166^5 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV166^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% 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 : Mon Jun 24 15:59:39 EDT 2024
% Result : Theorem 4.21s 1.92s
% Output : Refutation 4.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 1
% Syntax : Number of formulae : 22 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 59 ( 58 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 108 ( 11 ~; 13 |; 8 &; 76 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 66 ( 66 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 5 con; 0-2 aty)
% Number of variables : 45 ( 28 ^ 17 !; 0 ?; 45 :)
% 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 ).
thf(sk4_type,type,
sk4: a ).
thf(1,conjecture,
! [A: a,B: a,C: a,D: a] :
( ( ( ^ [E: a > a > a] : ( E @ A @ B ) )
= ( ^ [E: a > a > a] : ( E @ C @ D ) ) )
= ( ( A = C )
& ( B = D ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM182_pme) ).
thf(2,negated_conjecture,
~ ! [A: a,B: a,C: a,D: a] :
( ( ( ^ [E: a > a > a] : ( E @ A @ B ) )
= ( ^ [E: a > a > a] : ( E @ C @ D ) ) )
= ( ( A = C )
& ( B = D ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a,B: a,C: a,D: a] :
( ( ( ^ [E: a > a > a] : ( E @ A @ B ) )
= ( ^ [E: a > a > a] : ( E @ C @ D ) ) )
= ( ( A = C )
& ( B = D ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ( ^ [A: a > a > a] : ( A @ sk1 @ sk2 ) )
= ( ^ [A: a > a > a] : ( A @ sk3 @ sk4 ) ) )
!= ( ( sk1 = sk3 )
& ( sk2 = sk4 ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( ( sk1 = sk3 )
& ( sk2 = sk4 ) )
!= ( ( ^ [A: a > a > a] : ( A @ sk1 @ sk2 ) )
= ( ^ [A: a > a > a] : ( A @ sk3 @ sk4 ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(7,plain,
( ( ( sk1 = sk3 )
& ( sk2 = sk4 ) )
| ( ( ^ [A: a > a > a] : ( A @ sk1 @ sk2 ) )
= ( ^ [A: a > a > a] : ( A @ sk3 @ sk4 ) ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(9,plain,
( ( ( ^ [A: a > a > a] : ( A @ sk3 @ sk4 ) )
= ( ^ [A: a > a > a] : ( A @ sk1 @ sk2 ) ) )
| ( ( sk1 = sk3 )
& ( sk2 = sk4 ) ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(12,plain,
( ( sk2 = sk4 )
| ( ( ^ [A: a > a > a] : ( A @ sk3 @ sk4 ) )
= ( ^ [A: a > a > a] : ( A @ sk1 @ sk2 ) ) ) ),
inference(cnf,[status(esa)],[9]) ).
thf(14,plain,
( ( sk4 = sk2 )
| ( ( ^ [A: a > a > a] : ( A @ sk3 @ sk4 ) )
= ( ^ [A: a > a > a] : ( A @ sk1 @ sk2 ) ) ) ),
inference(lifteq,[status(thm)],[12]) ).
thf(16,plain,
! [A: a > a > a] :
( ( ( A @ sk3 @ sk4 )
= ( A @ sk1 @ sk2 ) )
| ( sk4 = sk2 ) ),
inference(func_ext,[status(esa)],[14]) ).
thf(32,plain,
! [A: a > a > a] :
( ( sk4 = sk2 )
| ( ( A @ sk3 @ sk4 )
!= sk4 )
| ( ( A @ sk1 @ sk2 )
!= sk2 ) ),
inference(eqfactor_ordered,[status(thm)],[16]) ).
thf(36,plain,
sk4 = sk2,
inference(pre_uni,[status(thm)],[32:[bind(A,$thf( ^ [B: a] : ^ [C: a] : C ))]]) ).
thf(114,plain,
( ( ( sk1 = sk3 )
& ( sk2 = sk2 ) )
!= ( ( ^ [A: a > a > a] : ( A @ sk1 @ sk2 ) )
= ( ^ [A: a > a > a] : ( A @ sk3 @ sk2 ) ) ) ),
inference(rewrite,[status(thm)],[5,36]) ).
thf(115,plain,
( ( sk1 = sk3 )
!= ( ( ^ [A: a > a > a] : ( A @ sk1 @ sk2 ) )
= ( ^ [A: a > a > a] : ( A @ sk3 @ sk2 ) ) ) ),
inference(simp,[status(thm)],[114]) ).
thf(13,plain,
( ( sk1 = sk3 )
| ( ( ^ [A: a > a > a] : ( A @ sk3 @ sk4 ) )
= ( ^ [A: a > a > a] : ( A @ sk1 @ sk2 ) ) ) ),
inference(cnf,[status(esa)],[9]) ).
thf(15,plain,
( ( sk3 = sk1 )
| ( ( ^ [A: a > a > a] : ( A @ sk3 @ sk4 ) )
= ( ^ [A: a > a > a] : ( A @ sk1 @ sk2 ) ) ) ),
inference(lifteq,[status(thm)],[13]) ).
thf(17,plain,
! [A: a > a > a] :
( ( ( A @ sk3 @ sk4 )
= ( A @ sk1 @ sk2 ) )
| ( sk3 = sk1 ) ),
inference(func_ext,[status(esa)],[15]) ).
thf(123,plain,
! [A: a > a > a] :
( ( ( A @ sk3 @ sk2 )
= ( A @ sk1 @ sk2 ) )
| ( sk3 = sk1 ) ),
inference(rewrite,[status(thm)],[17,36]) ).
thf(128,plain,
! [A: a > a > a] :
( ( sk3 = sk1 )
| ( ( A @ sk3 @ sk2 )
!= sk3 )
| ( ( A @ sk1 @ sk2 )
!= sk1 ) ),
inference(eqfactor_ordered,[status(thm)],[123]) ).
thf(132,plain,
sk3 = sk1,
inference(pre_uni,[status(thm)],[128:[bind(A,$thf( ^ [B: a] : ^ [C: a] : B ))]]) ).
thf(141,plain,
( ( ( ^ [A: a > a > a] : ( A @ sk1 @ sk2 ) )
= ( ^ [A: a > a > a] : ( A @ sk1 @ sk2 ) ) )
!= ( sk1 = sk1 ) ),
inference(rewrite,[status(thm)],[115,132]) ).
thf(142,plain,
$false,
inference(simp,[status(thm)],[141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEV166^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.12 % Command : run_Leo-III %s %d SAT
% 0.13/0.33 % Computer : n024.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 19:08:25 EDT 2024
% 0.13/0.34 % CPUTime :
% 1.01/0.91 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.27/1.03 % [INFO] Parsing done (111ms).
% 1.27/1.03 % [INFO] Running in sequential loop mode.
% 1.61/1.23 % [INFO] nitpick registered as external prover.
% 1.61/1.23 % [INFO] Scanning for conjecture ...
% 1.71/1.28 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.71/1.30 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.71/1.30 % [INFO] Problem is higher-order (TPTP THF).
% 1.71/1.30 % [INFO] Type checking passed.
% 1.71/1.30 % [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.21/1.91 % [INFO] Killing All external provers ...
% 4.21/1.92 % Time passed: 1379ms (effective reasoning time: 879ms)
% 4.21/1.92 % 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.21/1.92 % Axioms used in derivation (0):
% 4.21/1.92 % No. of inferences in proof: 22
% 4.21/1.92 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1379 ms resp. 879 ms w/o parsing
% 4.21/1.96 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.21/1.96 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------